/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-e106359-m [2022-04-15 11:14:30,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:14:30,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:14:30,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:14:31,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:14:31,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:14:31,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:14:31,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:14:31,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:14:31,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:14:31,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:14:31,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:14:31,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:14:31,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:14:31,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:14:31,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:14:31,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:14:31,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:14:31,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:14:31,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:14:31,022 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:14:31,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:14:31,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:14:31,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:14:31,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:14:31,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:14:31,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:14:31,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:14:31,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:14:31,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:14:31,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:14:31,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:14:31,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:14:31,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:14:31,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:14:31,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:14:31,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:14:31,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:14:31,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:14:31,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:14:31,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:14:31,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:14:31,036 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:14:31,044 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:14:31,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:14:31,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:14:31,045 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:14:31,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:14:31,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:14:31,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:14:31,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:14:31,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:14:31,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:14:31,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:14:31,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:14:31,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:14:31,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:14:31,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:14:31,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:14:31,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:14:31,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:14:31,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:14:31,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:14:31,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:14:31,047 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:14:31,047 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:14:31,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:14:31,047 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:14:31,047 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:14:31,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:14:31,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:14:31,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:14:31,245 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:14:31,245 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:14:31,246 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-15 11:14:31,308 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12757883e/f61777cfd7cc401d84603bbbb702f30e/FLAG0e5f79b5a [2022-04-15 11:14:31,668 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:14:31,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-04-15 11:14:31,683 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12757883e/f61777cfd7cc401d84603bbbb702f30e/FLAG0e5f79b5a [2022-04-15 11:14:31,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12757883e/f61777cfd7cc401d84603bbbb702f30e [2022-04-15 11:14:31,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:14:31,695 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:14:31,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:14:31,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:14:31,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:14:31,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:14:31" (1/1) ... [2022-04-15 11:14:31,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b348c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:14:31, skipping insertion in model container [2022-04-15 11:14:31,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:14:31" (1/1) ... [2022-04-15 11:14:31,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:14:31,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:14:31,883 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-15 11:14:31,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:14:31,890 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:14:31,919 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-15 11:14:31,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:14:31,928 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:14:31,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:14:31 WrapperNode [2022-04-15 11:14:31,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:14:31,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:14:31,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:14:31,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:14:31,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:14:31" (1/1) ... [2022-04-15 11:14:31,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:14:31" (1/1) ... [2022-04-15 11:14:31,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:14:31" (1/1) ... [2022-04-15 11:14:31,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:14:31" (1/1) ... [2022-04-15 11:14:31,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:14:31" (1/1) ... [2022-04-15 11:14:31,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:14:31" (1/1) ... [2022-04-15 11:14:31,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:14:31" (1/1) ... [2022-04-15 11:14:31,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:14:31,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:14:31,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:14:31,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:14:31,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:14:31" (1/1) ... [2022-04-15 11:14:31,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:14:32,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:14:32,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:14:32,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:14:32,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:14:32,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:14:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:14:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-15 11:14:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-15 11:14:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-04-15 11:14:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:14:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-15 11:14:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-15 11:14:32,038 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-15 11:14:32,038 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-15 11:14:32,038 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-15 11:14:32,040 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-04-15 11:14:32,040 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-15 11:14:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:14:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:14:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:14:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:14:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:14:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:14:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:14:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-04-15 11:14:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-15 11:14:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-15 11:14:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-15 11:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-04-15 11:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-15 11:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-15 11:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-15 11:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-15 11:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-15 11:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:14:32,111 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:14:32,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:14:32,220 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:14:32,352 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-04-15 11:14:32,352 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-04-15 11:14:32,353 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:14:32,403 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2022-04-15 11:14:32,403 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2022-04-15 11:14:32,422 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:14:32,443 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-15 11:14:32,443 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-15 11:14:32,456 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:14:32,582 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-04-15 11:14:32,582 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-04-15 11:14:32,585 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:14:32,590 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:14:32,591 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 11:14:32,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:14:32 BoogieIcfgContainer [2022-04-15 11:14:32,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:14:32,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:14:32,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:14:32,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:14:32,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:14:31" (1/3) ... [2022-04-15 11:14:32,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6944240f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:14:32, skipping insertion in model container [2022-04-15 11:14:32,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:14:31" (2/3) ... [2022-04-15 11:14:32,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6944240f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:14:32, skipping insertion in model container [2022-04-15 11:14:32,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:14:32" (3/3) ... [2022-04-15 11:14:32,599 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2022-04-15 11:14:32,602 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:14:32,602 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:14:32,629 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:14:32,633 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:14:32,633 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:14:32,648 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-15 11:14:32,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 11:14:32,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:32,653 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:14:32,653 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:32,657 INFO L85 PathProgramCache]: Analyzing trace with hash -657298671, now seen corresponding path program 1 times [2022-04-15 11:14:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:32,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1216294327] [2022-04-15 11:14:32,669 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:32,669 INFO L85 PathProgramCache]: Analyzing trace with hash -657298671, now seen corresponding path program 2 times [2022-04-15 11:14:32,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:32,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886954785] [2022-04-15 11:14:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:32,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:32,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:32,943 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-15 11:14:32,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-15 11:14:32,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #462#return; {154#true} is VALID [2022-04-15 11:14:32,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:32,978 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-15 11:14:32,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-15 11:14:32,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {159#(= main_~status~1 0)} #442#return; {159#(= main_~status~1 0)} is VALID [2022-04-15 11:14:32,981 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-15 11:14:32,981 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-15 11:14:32,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-15 11:14:32,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #462#return; {154#true} is VALID [2022-04-15 11:14:32,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret35 := main(); {154#true} is VALID [2022-04-15 11:14:32,982 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-15 11:14:32,983 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-15 11:14:32,984 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-15 11:14:32,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-15 11:14:32,984 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {154#true} {159#(= main_~status~1 0)} #442#return; {159#(= main_~status~1 0)} is VALID [2022-04-15 11:14:32,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {159#(= main_~status~1 0)} assume !(~status~1 >= 0); {155#false} is VALID [2022-04-15 11:14:32,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#false} assume !(1 == ~pended~0); {155#false} is VALID [2022-04-15 11:14:32,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#false} assume !(1 == ~pended~0); {155#false} is VALID [2022-04-15 11:14:32,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {155#false} assume ~s~0 != ~UNLOADED~0; {155#false} is VALID [2022-04-15 11:14:32,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {155#false} assume -1 != ~status~1; {155#false} is VALID [2022-04-15 11:14:32,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {155#false} assume !(~s~0 != ~SKIP2~0); {155#false} is VALID [2022-04-15 11:14:32,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {155#false} assume 1 == ~pended~0; {155#false} is VALID [2022-04-15 11:14:32,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {155#false} assume 259 != ~status~1; {155#false} is VALID [2022-04-15 11:14:32,986 INFO L272 TraceCheckUtils]: 18: Hoare triple {155#false} call errorFn(); {155#false} is VALID [2022-04-15 11:14:32,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-15 11:14:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:32,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:32,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886954785] [2022-04-15 11:14:32,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886954785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:32,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:32,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:14:32,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:32,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1216294327] [2022-04-15 11:14:32,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1216294327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:32,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:32,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:14:32,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586466576] [2022-04-15 11:14:32,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:32,995 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-15 11:14:32,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:32,998 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-15 11:14:33,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:14:33,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:14:33,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:33,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:14:33,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:14:33,033 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-15 11:14:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:34,043 INFO L93 Difference]: Finished difference Result 302 states and 462 transitions. [2022-04-15 11:14:34,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:14:34,043 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-15 11:14:34,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:34,044 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-15 11:14:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2022-04-15 11:14:34,080 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-15 11:14:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2022-04-15 11:14:34,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 462 transitions. [2022-04-15 11:14:34,547 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-15 11:14:34,563 INFO L225 Difference]: With dead ends: 302 [2022-04-15 11:14:34,563 INFO L226 Difference]: Without dead ends: 157 [2022-04-15 11:14:34,566 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-15 11:14:34,568 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-15 11:14:34,568 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-15 11:14:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-15 11:14:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2022-04-15 11:14:34,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:34,600 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-15 11:14:34,601 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-15 11:14:34,602 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-15 11:14:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:34,608 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2022-04-15 11:14:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2022-04-15 11:14:34,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:34,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:34,610 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-15 11:14:34,611 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-15 11:14:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:34,616 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2022-04-15 11:14:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2022-04-15 11:14:34,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:34,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:34,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:34,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:34,618 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-15 11:14:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2022-04-15 11:14:34,623 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2022-04-15 11:14:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:34,623 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2022-04-15 11:14:34,624 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-15 11:14:34,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 190 transitions. [2022-04-15 11:14:34,768 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-15 11:14:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2022-04-15 11:14:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:14:34,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:34,769 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-15 11:14:34,769 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:14:34,769 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:34,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:34,770 INFO L85 PathProgramCache]: Analyzing trace with hash 919351458, now seen corresponding path program 1 times [2022-04-15 11:14:34,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:34,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [293777979] [2022-04-15 11:14:34,770 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:34,770 INFO L85 PathProgramCache]: Analyzing trace with hash 919351458, now seen corresponding path program 2 times [2022-04-15 11:14:34,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:34,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458077409] [2022-04-15 11:14:34,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:34,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:34,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:34,850 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-15 11:14:34,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-04-15 11:14:34,851 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1365#true} {1365#true} #462#return; {1365#true} is VALID [2022-04-15 11:14:34,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:34,874 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-15 11:14:34,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-04-15 11:14:34,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1365#true} {1365#true} #442#return; {1365#true} is VALID [2022-04-15 11:14:34,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:34,890 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-15 11:14:34,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {1376#(= ~s~0 ~NP~0)} assume true; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:14:34,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1376#(= ~s~0 ~NP~0)} {1365#true} #444#return; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:14:34,892 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-15 11:14:34,893 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-15 11:14:34,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-04-15 11:14:34,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1365#true} {1365#true} #462#return; {1365#true} is VALID [2022-04-15 11:14:34,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {1365#true} call #t~ret35 := main(); {1365#true} is VALID [2022-04-15 11:14:34,893 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-15 11:14:34,894 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-15 11:14:34,895 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-15 11:14:34,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-04-15 11:14:34,895 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1365#true} {1365#true} #442#return; {1365#true} is VALID [2022-04-15 11:14:34,895 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-15 11:14:34,895 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-15 11:14:34,896 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-15 11:14:34,897 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-15 11:14:34,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {1376#(= ~s~0 ~NP~0)} assume true; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:14:34,900 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1376#(= ~s~0 ~NP~0)} {1365#true} #444#return; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:14:34,900 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-15 11:14:34,900 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-15 11:14:34,901 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-15 11:14:34,902 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-15 11:14:34,903 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-15 11:14:34,903 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-15 11:14:34,903 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-15 11:14:34,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {1376#(= ~s~0 ~NP~0)} assume ~s~0 != ~NP~0; {1366#false} is VALID [2022-04-15 11:14:34,904 INFO L272 TraceCheckUtils]: 24: Hoare triple {1366#false} call errorFn(); {1366#false} is VALID [2022-04-15 11:14:34,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {1366#false} assume !false; {1366#false} is VALID [2022-04-15 11:14:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:34,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:34,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458077409] [2022-04-15 11:14:34,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458077409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:34,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:34,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:14:34,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:34,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [293777979] [2022-04-15 11:14:34,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [293777979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:34,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:34,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:14:34,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281497158] [2022-04-15 11:14:34,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:34,906 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-15 11:14:34,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:34,907 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-15 11:14:34,924 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-15 11:14:34,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:14:34,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:34,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:14:34,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:14:34,926 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-15 11:14:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:35,783 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2022-04-15 11:14:35,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:14:35,783 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-15 11:14:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:35,784 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-15 11:14:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2022-04-15 11:14:35,788 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-15 11:14:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2022-04-15 11:14:35,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 370 transitions. [2022-04-15 11:14:36,116 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-15 11:14:36,121 INFO L225 Difference]: With dead ends: 275 [2022-04-15 11:14:36,121 INFO L226 Difference]: Without dead ends: 219 [2022-04-15 11:14:36,122 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-15 11:14:36,122 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-15 11:14:36,123 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-15 11:14:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-15 11:14:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2022-04-15 11:14:36,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:36,139 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-15 11:14:36,140 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-15 11:14:36,141 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-15 11:14:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:36,150 INFO L93 Difference]: Finished difference Result 219 states and 291 transitions. [2022-04-15 11:14:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 291 transitions. [2022-04-15 11:14:36,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:36,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:36,152 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-15 11:14:36,152 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-15 11:14:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:36,162 INFO L93 Difference]: Finished difference Result 219 states and 291 transitions. [2022-04-15 11:14:36,162 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 291 transitions. [2022-04-15 11:14:36,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:36,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:36,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:36,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:36,163 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-15 11:14:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2022-04-15 11:14:36,171 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2022-04-15 11:14:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:36,172 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2022-04-15 11:14:36,172 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-15 11:14:36,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 259 transitions. [2022-04-15 11:14:36,394 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-15 11:14:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2022-04-15 11:14:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:14:36,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:36,394 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-15 11:14:36,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:14:36,395 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:36,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:36,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1564864640, now seen corresponding path program 1 times [2022-04-15 11:14:36,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:36,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [722900134] [2022-04-15 11:14:36,396 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:36,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1564864640, now seen corresponding path program 2 times [2022-04-15 11:14:36,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:36,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89323927] [2022-04-15 11:14:36,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:36,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:36,496 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-15 11:14:36,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-15 11:14:36,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2763#true} {2763#true} #462#return; {2763#true} is VALID [2022-04-15 11:14:36,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:36,518 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-15 11:14:36,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-15 11:14:36,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2763#true} {2763#true} #442#return; {2763#true} is VALID [2022-04-15 11:14:36,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:36,540 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-15 11:14:36,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {2774#(= ~compRegistered~0 0)} assume true; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:36,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2774#(= ~compRegistered~0 0)} {2763#true} #444#return; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:36,542 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-15 11:14:36,542 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-15 11:14:36,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-15 11:14:36,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2763#true} {2763#true} #462#return; {2763#true} is VALID [2022-04-15 11:14:36,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {2763#true} call #t~ret35 := main(); {2763#true} is VALID [2022-04-15 11:14:36,543 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-15 11:14:36,544 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-15 11:14:36,544 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-15 11:14:36,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-15 11:14:36,544 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2763#true} {2763#true} #442#return; {2763#true} is VALID [2022-04-15 11:14:36,545 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-15 11:14:36,545 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-15 11:14:36,545 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-15 11:14:36,546 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-15 11:14:36,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {2774#(= ~compRegistered~0 0)} assume true; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:36,546 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2774#(= ~compRegistered~0 0)} {2763#true} #444#return; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:36,547 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-15 11:14:36,547 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-15 11:14:36,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {2774#(= ~compRegistered~0 0)} assume 3 == ~tmp_ndt_1~0; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:36,548 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-15 11:14:36,548 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-15 11:14:36,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {2774#(= ~compRegistered~0 0)} assume 0 == ~irpStack__MinorFunction~0; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:36,549 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-15 11:14:36,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {2774#(= ~compRegistered~0 0)} assume !(~s~0 != ~NP~0); {2774#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:36,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {2774#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {2764#false} is VALID [2022-04-15 11:14:36,553 INFO L272 TraceCheckUtils]: 25: Hoare triple {2764#false} call errorFn(); {2764#false} is VALID [2022-04-15 11:14:36,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {2764#false} assume !false; {2764#false} is VALID [2022-04-15 11:14:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:36,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:36,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89323927] [2022-04-15 11:14:36,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89323927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:36,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:36,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:14:36,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:36,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [722900134] [2022-04-15 11:14:36,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [722900134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:36,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:36,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:14:36,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301473118] [2022-04-15 11:14:36,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:36,555 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-15 11:14:36,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:36,555 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-15 11:14:36,571 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-15 11:14:36,571 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:14:36,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:36,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:14:36,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:14:36,572 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-15 11:14:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:37,471 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2022-04-15 11:14:37,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:14:37,471 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-15 11:14:37,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:37,472 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-15 11:14:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 334 transitions. [2022-04-15 11:14:37,475 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-15 11:14:37,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 334 transitions. [2022-04-15 11:14:37,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 334 transitions. [2022-04-15 11:14:37,730 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-15 11:14:37,735 INFO L225 Difference]: With dead ends: 316 [2022-04-15 11:14:37,735 INFO L226 Difference]: Without dead ends: 254 [2022-04-15 11:14:37,736 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-15 11:14:37,737 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-15 11:14:37,737 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-15 11:14:37,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-15 11:14:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2022-04-15 11:14:37,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:37,758 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-15 11:14:37,758 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-15 11:14:37,759 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-15 11:14:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:37,766 INFO L93 Difference]: Finished difference Result 254 states and 335 transitions. [2022-04-15 11:14:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 335 transitions. [2022-04-15 11:14:37,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:37,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:37,767 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-15 11:14:37,767 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-15 11:14:37,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:37,773 INFO L93 Difference]: Finished difference Result 254 states and 335 transitions. [2022-04-15 11:14:37,773 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 335 transitions. [2022-04-15 11:14:37,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:37,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:37,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:37,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:37,775 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-15 11:14:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2022-04-15 11:14:37,780 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2022-04-15 11:14:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:37,780 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2022-04-15 11:14:37,780 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-15 11:14:37,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 217 states and 289 transitions. [2022-04-15 11:14:38,045 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-15 11:14:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2022-04-15 11:14:38,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 11:14:38,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:38,046 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-15 11:14:38,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:14:38,046 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:38,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:38,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1424448937, now seen corresponding path program 1 times [2022-04-15 11:14:38,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:38,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [234676114] [2022-04-15 11:14:38,047 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:38,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1424448937, now seen corresponding path program 2 times [2022-04-15 11:14:38,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:38,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801725200] [2022-04-15 11:14:38,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:38,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:38,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:38,136 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-15 11:14:38,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-15 11:14:38,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4357#true} {4357#true} #462#return; {4357#true} is VALID [2022-04-15 11:14:38,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:38,174 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-15 11:14:38,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-15 11:14:38,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4357#true} {4357#true} #442#return; {4357#true} is VALID [2022-04-15 11:14:38,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:38,187 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-15 11:14:38,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-15 11:14:38,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4357#true} {4357#true} #444#return; {4357#true} is VALID [2022-04-15 11:14:38,188 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-15 11:14:38,189 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-15 11:14:38,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-15 11:14:38,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4357#true} {4357#true} #462#return; {4357#true} is VALID [2022-04-15 11:14:38,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {4357#true} call #t~ret35 := main(); {4357#true} is VALID [2022-04-15 11:14:38,189 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-15 11:14:38,190 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-15 11:14:38,190 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-15 11:14:38,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-15 11:14:38,190 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4357#true} {4357#true} #442#return; {4357#true} is VALID [2022-04-15 11:14:38,190 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-15 11:14:38,190 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-15 11:14:38,191 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-15 11:14:38,191 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-15 11:14:38,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-15 11:14:38,191 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4357#true} {4357#true} #444#return; {4357#true} is VALID [2022-04-15 11:14:38,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {4357#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {4357#true} is VALID [2022-04-15 11:14:38,192 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-15 11:14:38,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {4357#true} assume 3 == ~tmp_ndt_1~0; {4357#true} is VALID [2022-04-15 11:14:38,192 INFO L272 TraceCheckUtils]: 19: Hoare triple {4357#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {4357#true} is VALID [2022-04-15 11:14:38,192 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-15 11:14:38,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {4357#true} assume !(0 == ~irpStack__MinorFunction~0); {4357#true} is VALID [2022-04-15 11:14:38,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {4357#true} assume 23 == ~irpStack__MinorFunction~0; {4357#true} is VALID [2022-04-15 11:14:38,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {4357#true} ~devExt__SurpriseRemoved~0 := 1; {4357#true} is VALID [2022-04-15 11:14:38,193 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-15 11:14:38,193 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-15 11:14:38,194 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-15 11:14:38,194 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-15 11:14:38,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:14:38,195 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-15 11:14:38,195 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-15 11:14:38,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} ~returnVal2~0 := 0; {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:14:38,196 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-15 11:14:38,196 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-15 11:14:38,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {4358#false} is VALID [2022-04-15 11:14:38,197 INFO L272 TraceCheckUtils]: 35: Hoare triple {4358#false} call errorFn(); {4358#false} is VALID [2022-04-15 11:14:38,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {4358#false} assume !false; {4358#false} is VALID [2022-04-15 11:14:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:38,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:38,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801725200] [2022-04-15 11:14:38,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801725200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:38,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:38,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:14:38,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:38,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [234676114] [2022-04-15 11:14:38,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [234676114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:38,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:38,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:14:38,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511230291] [2022-04-15 11:14:38,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:38,199 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-15 11:14:38,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:38,199 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-15 11:14:38,220 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-15 11:14:38,221 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:14:38,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:38,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:14:38,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:14:38,221 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-15 11:14:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:38,920 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2022-04-15 11:14:38,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:14:38,920 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-15 11:14:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:38,920 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-15 11:14:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2022-04-15 11:14:38,922 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-15 11:14:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2022-04-15 11:14:38,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 214 transitions. [2022-04-15 11:14:39,092 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-15 11:14:39,095 INFO L225 Difference]: With dead ends: 220 [2022-04-15 11:14:39,096 INFO L226 Difference]: Without dead ends: 217 [2022-04-15 11:14:39,096 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-15 11:14:39,096 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-15 11:14:39,097 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-15 11:14:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-15 11:14:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-04-15 11:14:39,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:39,111 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-15 11:14:39,111 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-15 11:14:39,112 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-15 11:14:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:39,116 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2022-04-15 11:14:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-04-15 11:14:39,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:39,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:39,117 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-15 11:14:39,118 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-15 11:14:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:39,123 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2022-04-15 11:14:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-04-15 11:14:39,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:39,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:39,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:39,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:39,124 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-15 11:14:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2022-04-15 11:14:39,129 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2022-04-15 11:14:39,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:39,129 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2022-04-15 11:14:39,129 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-15 11:14:39,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 217 states and 288 transitions. [2022-04-15 11:14:39,361 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-15 11:14:39,361 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-04-15 11:14:39,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 11:14:39,362 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:39,362 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-15 11:14:39,362 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:14:39,362 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:39,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash -327288786, now seen corresponding path program 1 times [2022-04-15 11:14:39,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:39,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1143560252] [2022-04-15 11:14:39,363 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash -327288786, now seen corresponding path program 2 times [2022-04-15 11:14:39,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:39,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610218251] [2022-04-15 11:14:39,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:39,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:39,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:39,447 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-15 11:14:39,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-15 11:14:39,447 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5685#true} {5685#true} #462#return; {5685#true} is VALID [2022-04-15 11:14:39,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:39,475 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-15 11:14:39,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-15 11:14:39,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5685#true} {5685#true} #442#return; {5685#true} is VALID [2022-04-15 11:14:39,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:39,491 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-15 11:14:39,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-15 11:14:39,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5685#true} {5685#true} #444#return; {5685#true} is VALID [2022-04-15 11:14:39,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 11:14:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:39,509 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-15 11:14:39,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {5685#true} assume !(0 != ~compRegistered~0); {5711#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:39,510 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-15 11:14:39,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {5711#(= ~compRegistered~0 0)} assume 0 == ~tmp_ndt_2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:39,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {5711#(= ~compRegistered~0 0)} ~returnVal2~0 := 0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:39,511 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-15 11:14:39,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {5711#(= ~compRegistered~0 0)} #res := ~returnVal2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:39,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {5711#(= ~compRegistered~0 0)} assume true; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:39,512 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {5711#(= ~compRegistered~0 0)} {5697#(not (= ~compRegistered~0 0))} #470#return; {5686#false} is VALID [2022-04-15 11:14:39,513 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-15 11:14:39,513 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-15 11:14:39,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-15 11:14:39,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5685#true} {5685#true} #462#return; {5685#true} is VALID [2022-04-15 11:14:39,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {5685#true} call #t~ret35 := main(); {5685#true} is VALID [2022-04-15 11:14:39,514 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-15 11:14:39,514 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-15 11:14:39,515 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-15 11:14:39,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-15 11:14:39,515 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5685#true} {5685#true} #442#return; {5685#true} is VALID [2022-04-15 11:14:39,515 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-15 11:14:39,515 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-15 11:14:39,523 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-15 11:14:39,524 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-15 11:14:39,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-15 11:14:39,524 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5685#true} {5685#true} #444#return; {5685#true} is VALID [2022-04-15 11:14:39,524 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-15 11:14:39,524 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-15 11:14:39,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {5685#true} assume 3 == ~tmp_ndt_1~0; {5685#true} is VALID [2022-04-15 11:14:39,525 INFO L272 TraceCheckUtils]: 19: Hoare triple {5685#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {5685#true} is VALID [2022-04-15 11:14:39,525 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-15 11:14:39,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {5685#true} assume 0 == ~irpStack__MinorFunction~0; {5685#true} is VALID [2022-04-15 11:14:39,525 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-15 11:14:39,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {5685#true} assume !(~s~0 != ~NP~0); {5685#true} is VALID [2022-04-15 11:14:39,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {5685#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {5697#(not (= ~compRegistered~0 0))} is VALID [2022-04-15 11:14:39,526 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-15 11:14:39,526 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-15 11:14:39,526 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-15 11:14:39,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {5685#true} assume !(0 != ~compRegistered~0); {5711#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:39,527 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-15 11:14:39,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {5711#(= ~compRegistered~0 0)} assume 0 == ~tmp_ndt_2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:39,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {5711#(= ~compRegistered~0 0)} ~returnVal2~0 := 0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:39,528 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-15 11:14:39,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {5711#(= ~compRegistered~0 0)} #res := ~returnVal2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:39,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {5711#(= ~compRegistered~0 0)} assume true; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:14:39,529 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5711#(= ~compRegistered~0 0)} {5697#(not (= ~compRegistered~0 0))} #470#return; {5686#false} is VALID [2022-04-15 11:14:39,529 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-15 11:14:39,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {5686#false} assume 259 == ~__cil_tmp23~0; {5686#false} is VALID [2022-04-15 11:14:39,529 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-15 11:14:39,529 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-15 11:14:39,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {5686#false} assume !(~s~0 == ~MPR3~0); {5686#false} is VALID [2022-04-15 11:14:39,530 INFO L290 TraceCheckUtils]: 41: Hoare triple {5686#false} assume !(1 == ~customIrp~0); {5686#false} is VALID [2022-04-15 11:14:39,530 INFO L290 TraceCheckUtils]: 42: Hoare triple {5686#false} assume ~s~0 == ~MPR3~0; {5686#false} is VALID [2022-04-15 11:14:39,530 INFO L272 TraceCheckUtils]: 43: Hoare triple {5686#false} call errorFn(); {5686#false} is VALID [2022-04-15 11:14:39,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {5686#false} assume !false; {5686#false} is VALID [2022-04-15 11:14:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:39,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:39,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610218251] [2022-04-15 11:14:39,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610218251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:39,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:39,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:14:39,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:39,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1143560252] [2022-04-15 11:14:39,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1143560252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:39,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:39,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:14:39,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666144725] [2022-04-15 11:14:39,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:39,532 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-15 11:14:39,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:39,532 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-15 11:14:39,557 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-15 11:14:39,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 11:14:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:39,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 11:14:39,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 11:14:39,558 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-15 11:14:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:40,525 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2022-04-15 11:14:40,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 11:14:40,525 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-15 11:14:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:40,525 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-15 11:14:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 292 transitions. [2022-04-15 11:14:40,528 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-15 11:14:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 292 transitions. [2022-04-15 11:14:40,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 292 transitions. [2022-04-15 11:14:40,737 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-15 11:14:40,741 INFO L225 Difference]: With dead ends: 274 [2022-04-15 11:14:40,742 INFO L226 Difference]: Without dead ends: 208 [2022-04-15 11:14:40,742 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-15 11:14:40,743 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-15 11:14:40,743 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-15 11:14:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-15 11:14:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2022-04-15 11:14:40,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:40,755 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-15 11:14:40,767 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-15 11:14:40,768 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-15 11:14:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:40,779 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2022-04-15 11:14:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 271 transitions. [2022-04-15 11:14:40,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:40,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:40,781 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-15 11:14:40,781 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-15 11:14:40,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:40,794 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2022-04-15 11:14:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 271 transitions. [2022-04-15 11:14:40,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:40,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:40,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:40,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:40,795 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-15 11:14:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2022-04-15 11:14:40,799 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2022-04-15 11:14:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:40,799 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2022-04-15 11:14:40,800 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-15 11:14:40,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 250 transitions. [2022-04-15 11:14:41,051 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-15 11:14:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2022-04-15 11:14:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 11:14:41,053 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:41,053 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-15 11:14:41,053 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:14:41,053 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:41,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1063639731, now seen corresponding path program 1 times [2022-04-15 11:14:41,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:41,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2044660781] [2022-04-15 11:14:41,054 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:41,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1063639731, now seen corresponding path program 2 times [2022-04-15 11:14:41,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:41,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308073252] [2022-04-15 11:14:41,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:41,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:41,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:41,153 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-15 11:14:41,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-15 11:14:41,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7071#true} {7071#true} #462#return; {7071#true} is VALID [2022-04-15 11:14:41,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:41,188 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-15 11:14:41,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-15 11:14:41,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7071#true} {7071#true} #442#return; {7071#true} is VALID [2022-04-15 11:14:41,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:41,201 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-15 11:14:41,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-15 11:14:41,201 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7071#true} {7071#true} #444#return; {7071#true} is VALID [2022-04-15 11:14:41,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 11:14:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:41,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:14:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:41,214 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-15 11:14:41,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-15 11:14:41,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7071#true} {7071#true} #440#return; {7071#true} is VALID [2022-04-15 11:14:41,215 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-15 11:14:41,215 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-15 11:14:41,215 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-15 11:14:41,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-15 11:14:41,216 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7071#true} {7071#true} #440#return; {7071#true} is VALID [2022-04-15 11:14:41,216 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-15 11:14:41,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-15 11:14:41,216 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7071#true} {7071#true} #450#return; {7071#true} is VALID [2022-04-15 11:14:41,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-15 11:14:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:41,224 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-15 11:14:41,225 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-15 11:14:41,225 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-15 11:14:41,226 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-15 11:14:41,226 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-15 11:14:41,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-15 11:14:41,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7071#true} {7071#true} #462#return; {7071#true} is VALID [2022-04-15 11:14:41,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {7071#true} call #t~ret35 := main(); {7071#true} is VALID [2022-04-15 11:14:41,226 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-15 11:14:41,227 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-15 11:14:41,227 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-15 11:14:41,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-15 11:14:41,227 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7071#true} {7071#true} #442#return; {7071#true} is VALID [2022-04-15 11:14:41,232 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-15 11:14:41,232 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-15 11:14:41,233 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-15 11:14:41,233 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-15 11:14:41,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-15 11:14:41,237 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7071#true} {7071#true} #444#return; {7071#true} is VALID [2022-04-15 11:14:41,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {7071#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {7071#true} is VALID [2022-04-15 11:14:41,237 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-15 11:14:41,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {7071#true} assume 3 == ~tmp_ndt_1~0; {7071#true} is VALID [2022-04-15 11:14:41,237 INFO L272 TraceCheckUtils]: 19: Hoare triple {7071#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {7071#true} is VALID [2022-04-15 11:14:41,239 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-15 11:14:41,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {7071#true} assume 0 == ~irpStack__MinorFunction~0; {7071#true} is VALID [2022-04-15 11:14:41,239 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-15 11:14:41,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {7071#true} assume !(~s~0 != ~NP~0); {7071#true} is VALID [2022-04-15 11:14:41,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {7071#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {7071#true} is VALID [2022-04-15 11:14:41,242 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-15 11:14:41,242 INFO L272 TraceCheckUtils]: 26: Hoare triple {7071#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {7071#true} is VALID [2022-04-15 11:14:41,242 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-15 11:14:41,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {7071#true} assume 0 != ~compRegistered~0; {7071#true} is VALID [2022-04-15 11:14:41,245 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-15 11:14:41,245 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-15 11:14:41,246 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-15 11:14:41,246 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-15 11:14:41,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-15 11:14:41,246 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7071#true} {7071#true} #440#return; {7071#true} is VALID [2022-04-15 11:14:41,246 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-15 11:14:41,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-15 11:14:41,246 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7071#true} {7071#true} #450#return; {7071#true} is VALID [2022-04-15 11:14:41,246 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-15 11:14:41,247 INFO L272 TraceCheckUtils]: 39: Hoare triple {7071#true} call stubMoreProcessingRequired(); {7101#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:41,248 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-15 11:14:41,248 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-15 11:14:41,248 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-15 11:14:41,249 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-15 11:14:41,249 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-15 11:14:41,249 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-15 11:14:41,249 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-15 11:14:41,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume !(~s~0 == ~MPR1~0); {7072#false} is VALID [2022-04-15 11:14:41,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {7072#false} assume !(~s~0 == ~SKIP1~0); {7072#false} is VALID [2022-04-15 11:14:41,250 INFO L272 TraceCheckUtils]: 49: Hoare triple {7072#false} call errorFn(); {7072#false} is VALID [2022-04-15 11:14:41,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {7072#false} assume !false; {7072#false} is VALID [2022-04-15 11:14:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:41,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:41,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308073252] [2022-04-15 11:14:41,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308073252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:41,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:41,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:14:41,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:41,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2044660781] [2022-04-15 11:14:41,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2044660781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:41,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:41,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:14:41,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334224306] [2022-04-15 11:14:41,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:41,251 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-15 11:14:41,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:41,252 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-15 11:14:41,280 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-15 11:14:41,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:14:41,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:41,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:14:41,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:14:41,280 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-15 11:14:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:42,024 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2022-04-15 11:14:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 11:14:42,025 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-15 11:14:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:42,026 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-15 11:14:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 270 transitions. [2022-04-15 11:14:42,029 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-15 11:14:42,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 270 transitions. [2022-04-15 11:14:42,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 270 transitions. [2022-04-15 11:14:42,235 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-15 11:14:42,238 INFO L225 Difference]: With dead ends: 258 [2022-04-15 11:14:42,239 INFO L226 Difference]: Without dead ends: 197 [2022-04-15 11:14:42,239 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-15 11:14:42,239 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-15 11:14:42,240 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-15 11:14:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-15 11:14:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-04-15 11:14:42,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:42,252 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-15 11:14:42,252 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-15 11:14:42,253 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-15 11:14:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:42,256 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2022-04-15 11:14:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 257 transitions. [2022-04-15 11:14:42,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:42,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:42,257 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-15 11:14:42,257 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-15 11:14:42,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:42,260 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2022-04-15 11:14:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 257 transitions. [2022-04-15 11:14:42,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:42,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:42,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:42,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:42,261 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-15 11:14:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2022-04-15 11:14:42,264 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2022-04-15 11:14:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:42,264 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2022-04-15 11:14:42,264 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-15 11:14:42,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 246 transitions. [2022-04-15 11:14:42,473 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-15 11:14:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2022-04-15 11:14:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 11:14:42,474 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:42,474 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-15 11:14:42,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:14:42,474 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:42,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1356664997, now seen corresponding path program 1 times [2022-04-15 11:14:42,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:42,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [826972088] [2022-04-15 11:14:42,475 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1356664997, now seen corresponding path program 2 times [2022-04-15 11:14:42,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:42,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489508988] [2022-04-15 11:14:42,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:42,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:42,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:42,540 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-15 11:14:42,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {8397#true} assume true; {8397#true} is VALID [2022-04-15 11:14:42,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8397#true} {8397#true} #462#return; {8397#true} is VALID [2022-04-15 11:14:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:42,559 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-15 11:14:42,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume true; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:14:42,560 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-15 11:14:42,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:42,576 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-15 11:14:42,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {8397#true} assume true; {8397#true} is VALID [2022-04-15 11:14:42,577 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-15 11:14:42,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-15 11:14:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:42,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:42,637 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-15 11:14:42,637 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-15 11:14:42,637 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-15 11:14:42,637 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-15 11:14:42,638 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-15 11:14:42,638 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-15 11:14:42,638 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-15 11:14:42,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} assume true; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:42,639 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-15 11:14:42,639 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-15 11:14:42,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {8397#true} assume !(0 == ~irpStack__MinorFunction~0); {8397#true} is VALID [2022-04-15 11:14:42,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {8397#true} assume 23 == ~irpStack__MinorFunction~0; {8397#true} is VALID [2022-04-15 11:14:42,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {8397#true} ~devExt__SurpriseRemoved~0 := 1; {8397#true} is VALID [2022-04-15 11:14:42,640 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-15 11:14:42,641 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-15 11:14:42,641 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-15 11:14:42,642 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-15 11:14:42,642 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-15 11:14:42,643 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-15 11:14:42,643 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-15 11:14:42,643 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-15 11:14:42,643 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-15 11:14:42,644 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-15 11:14:42,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} assume true; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:42,644 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-15 11:14:42,645 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-15 11:14:42,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} #res := ~status~0; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:14:42,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} assume true; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:14:42,646 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-15 11:14:42,647 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-15 11:14:42,647 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-15 11:14:42,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {8397#true} assume true; {8397#true} is VALID [2022-04-15 11:14:42,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8397#true} {8397#true} #462#return; {8397#true} is VALID [2022-04-15 11:14:42,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {8397#true} call #t~ret35 := main(); {8397#true} is VALID [2022-04-15 11:14:42,647 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-15 11:14:42,648 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-15 11:14:42,648 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-15 11:14:42,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume true; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:14:42,649 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-15 11:14:42,649 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-15 11:14:42,649 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-15 11:14:42,650 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-15 11:14:42,650 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-15 11:14:42,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {8397#true} assume true; {8397#true} is VALID [2022-04-15 11:14:42,650 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-15 11:14:42,651 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-15 11:14:42,651 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-15 11:14:42,651 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-15 11:14:42,652 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-15 11:14:42,652 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-15 11:14:42,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {8397#true} assume !(0 == ~irpStack__MinorFunction~0); {8397#true} is VALID [2022-04-15 11:14:42,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {8397#true} assume 23 == ~irpStack__MinorFunction~0; {8397#true} is VALID [2022-04-15 11:14:42,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {8397#true} ~devExt__SurpriseRemoved~0 := 1; {8397#true} is VALID [2022-04-15 11:14:42,652 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-15 11:14:42,653 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-15 11:14:42,653 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-15 11:14:42,653 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-15 11:14:42,654 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-15 11:14:42,654 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-15 11:14:42,654 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-15 11:14:42,655 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-15 11:14:42,655 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-15 11:14:42,655 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-15 11:14:42,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} assume true; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:42,656 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-15 11:14:42,656 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-15 11:14:42,657 INFO L290 TraceCheckUtils]: 37: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} #res := ~status~0; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:14:42,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} assume true; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:14:42,657 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-15 11:14:42,658 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-15 11:14:42,658 INFO L290 TraceCheckUtils]: 41: Hoare triple {8398#false} assume !(1 == ~pended~0); {8398#false} is VALID [2022-04-15 11:14:42,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {8398#false} assume !(1 == ~pended~0); {8398#false} is VALID [2022-04-15 11:14:42,658 INFO L290 TraceCheckUtils]: 43: Hoare triple {8398#false} assume ~s~0 != ~UNLOADED~0; {8398#false} is VALID [2022-04-15 11:14:42,658 INFO L290 TraceCheckUtils]: 44: Hoare triple {8398#false} assume -1 != ~status~1; {8398#false} is VALID [2022-04-15 11:14:42,658 INFO L290 TraceCheckUtils]: 45: Hoare triple {8398#false} assume !(~s~0 != ~SKIP2~0); {8398#false} is VALID [2022-04-15 11:14:42,658 INFO L290 TraceCheckUtils]: 46: Hoare triple {8398#false} assume 1 == ~pended~0; {8398#false} is VALID [2022-04-15 11:14:42,658 INFO L290 TraceCheckUtils]: 47: Hoare triple {8398#false} assume 259 != ~status~1; {8398#false} is VALID [2022-04-15 11:14:42,658 INFO L272 TraceCheckUtils]: 48: Hoare triple {8398#false} call errorFn(); {8398#false} is VALID [2022-04-15 11:14:42,658 INFO L290 TraceCheckUtils]: 49: Hoare triple {8398#false} assume !false; {8398#false} is VALID [2022-04-15 11:14:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:42,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:42,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489508988] [2022-04-15 11:14:42,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489508988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:42,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:42,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:14:42,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:42,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [826972088] [2022-04-15 11:14:42,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [826972088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:42,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:42,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:14:42,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818618334] [2022-04-15 11:14:42,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:42,660 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-15 11:14:42,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:42,660 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-15 11:14:42,687 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-15 11:14:42,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 11:14:42,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:42,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 11:14:42,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:14:42,688 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-15 11:14:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:44,713 INFO L93 Difference]: Finished difference Result 234 states and 300 transitions. [2022-04-15 11:14:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:14:44,713 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-15 11:14:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:44,714 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-15 11:14:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 277 transitions. [2022-04-15 11:14:44,716 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-15 11:14:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 277 transitions. [2022-04-15 11:14:44,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 277 transitions. [2022-04-15 11:14:44,943 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-15 11:14:44,946 INFO L225 Difference]: With dead ends: 234 [2022-04-15 11:14:44,946 INFO L226 Difference]: Without dead ends: 210 [2022-04-15 11:14:44,947 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-15 11:14:44,947 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-15 11:14:44,947 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-15 11:14:44,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-15 11:14:44,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2022-04-15 11:14:44,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:44,960 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-15 11:14:44,961 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-15 11:14:44,961 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-15 11:14:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:44,964 INFO L93 Difference]: Finished difference Result 210 states and 270 transitions. [2022-04-15 11:14:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 270 transitions. [2022-04-15 11:14:44,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:44,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:44,965 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-15 11:14:44,966 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-15 11:14:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:44,969 INFO L93 Difference]: Finished difference Result 210 states and 270 transitions. [2022-04-15 11:14:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 270 transitions. [2022-04-15 11:14:44,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:44,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:44,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:44,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:44,970 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-15 11:14:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2022-04-15 11:14:44,972 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 50 [2022-04-15 11:14:44,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:44,973 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2022-04-15 11:14:44,973 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-15 11:14:44,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 244 transitions. [2022-04-15 11:14:45,189 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-15 11:14:45,190 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2022-04-15 11:14:45,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 11:14:45,190 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:45,190 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-15 11:14:45,190 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:14:45,191 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:45,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:45,191 INFO L85 PathProgramCache]: Analyzing trace with hash -957846954, now seen corresponding path program 1 times [2022-04-15 11:14:45,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:45,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [548211908] [2022-04-15 11:14:45,191 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:45,191 INFO L85 PathProgramCache]: Analyzing trace with hash -957846954, now seen corresponding path program 2 times [2022-04-15 11:14:45,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:45,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259718149] [2022-04-15 11:14:45,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:45,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:45,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:45,273 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-15 11:14:45,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-15 11:14:45,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9733#true} {9733#true} #462#return; {9733#true} is VALID [2022-04-15 11:14:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:45,294 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-15 11:14:45,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-15 11:14:45,294 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9733#true} {9733#true} #442#return; {9733#true} is VALID [2022-04-15 11:14:45,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:45,308 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-15 11:14:45,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {9744#(= ~pended~0 0)} assume true; {9744#(= ~pended~0 0)} is VALID [2022-04-15 11:14:45,308 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9744#(= ~pended~0 0)} {9733#true} #444#return; {9744#(= ~pended~0 0)} is VALID [2022-04-15 11:14:45,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-15 11:14:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:45,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:45,339 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-15 11:14:45,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {9733#true} assume !(0 != ~compRegistered~0); {9733#true} is VALID [2022-04-15 11:14:45,339 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-15 11:14:45,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {9733#true} assume 0 == ~tmp_ndt_2~0; {9733#true} is VALID [2022-04-15 11:14:45,340 INFO L290 TraceCheckUtils]: 4: Hoare triple {9733#true} ~returnVal2~0 := 0; {9733#true} is VALID [2022-04-15 11:14:45,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {9733#true} assume !(~s~0 == ~NP~0); {9733#true} is VALID [2022-04-15 11:14:45,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {9733#true} assume !(~s~0 == ~MPR1~0); {9733#true} is VALID [2022-04-15 11:14:45,340 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-15 11:14:45,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {9733#true} #res := ~returnVal2~0; {9733#true} is VALID [2022-04-15 11:14:45,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-15 11:14:45,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9733#true} {9733#true} #478#return; {9733#true} is VALID [2022-04-15 11:14:45,340 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-15 11:14:45,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {9733#true} assume !(0 == ~irpStack__MinorFunction~0); {9733#true} is VALID [2022-04-15 11:14:45,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {9733#true} assume 23 == ~irpStack__MinorFunction~0; {9733#true} is VALID [2022-04-15 11:14:45,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {9733#true} ~devExt__SurpriseRemoved~0 := 1; {9733#true} is VALID [2022-04-15 11:14:45,340 INFO L290 TraceCheckUtils]: 4: Hoare triple {9733#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {9733#true} is VALID [2022-04-15 11:14:45,340 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-15 11:14:45,341 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-15 11:14:45,341 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-15 11:14:45,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {9733#true} assume !(0 != ~compRegistered~0); {9733#true} is VALID [2022-04-15 11:14:45,341 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-15 11:14:45,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {9733#true} assume 0 == ~tmp_ndt_2~0; {9733#true} is VALID [2022-04-15 11:14:45,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {9733#true} ~returnVal2~0 := 0; {9733#true} is VALID [2022-04-15 11:14:45,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {9733#true} assume !(~s~0 == ~NP~0); {9733#true} is VALID [2022-04-15 11:14:45,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {9733#true} assume !(~s~0 == ~MPR1~0); {9733#true} is VALID [2022-04-15 11:14:45,342 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-15 11:14:45,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {9733#true} #res := ~returnVal2~0; {9733#true} is VALID [2022-04-15 11:14:45,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-15 11:14:45,342 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9733#true} {9733#true} #478#return; {9733#true} is VALID [2022-04-15 11:14:45,342 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-15 11:14:45,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {9733#true} #res := ~status~0; {9733#true} is VALID [2022-04-15 11:14:45,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-15 11:14:45,342 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9733#true} {9746#(not (= ~pended~0 1))} #446#return; {9746#(not (= ~pended~0 1))} is VALID [2022-04-15 11:14:45,343 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-15 11:14:45,343 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-15 11:14:45,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-15 11:14:45,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9733#true} {9733#true} #462#return; {9733#true} is VALID [2022-04-15 11:14:45,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {9733#true} call #t~ret35 := main(); {9733#true} is VALID [2022-04-15 11:14:45,344 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-15 11:14:45,344 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-15 11:14:45,345 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-15 11:14:45,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-15 11:14:45,345 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {9733#true} {9733#true} #442#return; {9733#true} is VALID [2022-04-15 11:14:45,345 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-15 11:14:45,345 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-15 11:14:45,345 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-15 11:14:45,345 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-15 11:14:45,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {9744#(= ~pended~0 0)} assume true; {9744#(= ~pended~0 0)} is VALID [2022-04-15 11:14:45,346 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9744#(= ~pended~0 0)} {9733#true} #444#return; {9744#(= ~pended~0 0)} is VALID [2022-04-15 11:14:45,346 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-15 11:14:45,347 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-15 11:14:45,347 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-15 11:14:45,348 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-15 11:14:45,348 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-15 11:14:45,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {9733#true} assume !(0 == ~irpStack__MinorFunction~0); {9733#true} is VALID [2022-04-15 11:14:45,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {9733#true} assume 23 == ~irpStack__MinorFunction~0; {9733#true} is VALID [2022-04-15 11:14:45,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {9733#true} ~devExt__SurpriseRemoved~0 := 1; {9733#true} is VALID [2022-04-15 11:14:45,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {9733#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {9733#true} is VALID [2022-04-15 11:14:45,348 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-15 11:14:45,349 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-15 11:14:45,349 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-15 11:14:45,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {9733#true} assume !(0 != ~compRegistered~0); {9733#true} is VALID [2022-04-15 11:14:45,349 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-15 11:14:45,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {9733#true} assume 0 == ~tmp_ndt_2~0; {9733#true} is VALID [2022-04-15 11:14:45,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {9733#true} ~returnVal2~0 := 0; {9733#true} is VALID [2022-04-15 11:14:45,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {9733#true} assume !(~s~0 == ~NP~0); {9733#true} is VALID [2022-04-15 11:14:45,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {9733#true} assume !(~s~0 == ~MPR1~0); {9733#true} is VALID [2022-04-15 11:14:45,349 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-15 11:14:45,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {9733#true} #res := ~returnVal2~0; {9733#true} is VALID [2022-04-15 11:14:45,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-15 11:14:45,349 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9733#true} {9733#true} #478#return; {9733#true} is VALID [2022-04-15 11:14:45,349 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-15 11:14:45,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {9733#true} #res := ~status~0; {9733#true} is VALID [2022-04-15 11:14:45,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-15 11:14:45,350 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9733#true} {9746#(not (= ~pended~0 1))} #446#return; {9746#(not (= ~pended~0 1))} is VALID [2022-04-15 11:14:45,350 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-15 11:14:45,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {9746#(not (= ~pended~0 1))} assume !(1 == ~pended~0); {9746#(not (= ~pended~0 1))} is VALID [2022-04-15 11:14:45,351 INFO L290 TraceCheckUtils]: 44: Hoare triple {9746#(not (= ~pended~0 1))} assume !(1 == ~pended~0); {9746#(not (= ~pended~0 1))} is VALID [2022-04-15 11:14:45,351 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-15 11:14:45,351 INFO L290 TraceCheckUtils]: 46: Hoare triple {9746#(not (= ~pended~0 1))} assume -1 != ~status~1; {9746#(not (= ~pended~0 1))} is VALID [2022-04-15 11:14:45,351 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-15 11:14:45,352 INFO L290 TraceCheckUtils]: 48: Hoare triple {9746#(not (= ~pended~0 1))} assume 1 == ~pended~0; {9734#false} is VALID [2022-04-15 11:14:45,352 INFO L290 TraceCheckUtils]: 49: Hoare triple {9734#false} assume 259 != ~status~1; {9734#false} is VALID [2022-04-15 11:14:45,352 INFO L272 TraceCheckUtils]: 50: Hoare triple {9734#false} call errorFn(); {9734#false} is VALID [2022-04-15 11:14:45,352 INFO L290 TraceCheckUtils]: 51: Hoare triple {9734#false} assume !false; {9734#false} is VALID [2022-04-15 11:14:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:45,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:45,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259718149] [2022-04-15 11:14:45,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259718149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:45,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:45,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:14:45,353 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:45,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [548211908] [2022-04-15 11:14:45,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [548211908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:45,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:45,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:14:45,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085633641] [2022-04-15 11:14:45,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:45,354 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-15 11:14:45,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:45,354 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-15 11:14:45,382 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-15 11:14:45,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 11:14:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:45,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 11:14:45,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:14:45,383 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-15 11:14:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:46,384 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2022-04-15 11:14:46,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 11:14:46,384 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-15 11:14:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:46,384 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-15 11:14:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2022-04-15 11:14:46,386 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-15 11:14:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2022-04-15 11:14:46,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 206 transitions. [2022-04-15 11:14:46,559 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-15 11:14:46,561 INFO L225 Difference]: With dead ends: 203 [2022-04-15 11:14:46,561 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 11:14:46,561 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-15 11:14:46,562 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-15 11:14:46,562 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-15 11:14:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 11:14:46,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-15 11:14:46,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:46,568 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-15 11:14:46,568 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-15 11:14:46,569 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-15 11:14:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:46,570 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-04-15 11:14:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-04-15 11:14:46,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:46,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:46,570 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-15 11:14:46,570 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-15 11:14:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:46,572 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-04-15 11:14:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-04-15 11:14:46,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:46,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:46,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:46,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:46,572 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-15 11:14:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-04-15 11:14:46,573 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2022-04-15 11:14:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:46,573 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-04-15 11:14:46,574 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-15 11:14:46,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 102 transitions. [2022-04-15 11:14:46,664 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-15 11:14:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-04-15 11:14:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 11:14:46,665 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:46,665 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-15 11:14:46,665 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:14:46,665 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:46,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:46,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1066997237, now seen corresponding path program 1 times [2022-04-15 11:14:46,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:46,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1433552639] [2022-04-15 11:14:46,666 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:46,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1066997237, now seen corresponding path program 2 times [2022-04-15 11:14:46,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:46,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403893243] [2022-04-15 11:14:46,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:46,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:46,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:46,736 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-15 11:14:46,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-15 11:14:46,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10562#true} {10562#true} #462#return; {10562#true} is VALID [2022-04-15 11:14:46,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:46,765 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-15 11:14:46,766 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-15 11:14:46,766 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-15 11:14:46,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:46,790 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-15 11:14:46,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-15 11:14:46,790 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-15 11:14:46,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 11:14:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:46,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:14:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:46,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:14:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:46,851 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-15 11:14:46,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-15 11:14:46,851 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10562#true} {10562#true} #440#return; {10562#true} is VALID [2022-04-15 11:14:46,851 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-15 11:14:46,852 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-15 11:14:46,852 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-15 11:14:46,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-15 11:14:46,852 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10562#true} {10562#true} #440#return; {10562#true} is VALID [2022-04-15 11:14:46,852 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-15 11:14:46,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-15 11:14:46,852 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10562#true} {10562#true} #450#return; {10562#true} is VALID [2022-04-15 11:14:46,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:46,866 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-15 11:14:46,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {10619#(= ~MPR1~0 ~s~0)} assume true; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 11:14:46,867 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-15 11:14:46,867 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-15 11:14:46,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {10562#true} assume 0 != ~compRegistered~0; {10562#true} is VALID [2022-04-15 11:14:46,868 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-15 11:14:46,868 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-15 11:14:46,868 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-15 11:14:46,868 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-15 11:14:46,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-15 11:14:46,869 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10562#true} {10562#true} #440#return; {10562#true} is VALID [2022-04-15 11:14:46,869 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-15 11:14:46,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-15 11:14:46,869 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10562#true} {10562#true} #450#return; {10562#true} is VALID [2022-04-15 11:14:46,869 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-15 11:14:46,870 INFO L272 TraceCheckUtils]: 12: Hoare triple {10562#true} call stubMoreProcessingRequired(); {10618#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:46,870 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-15 11:14:46,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {10619#(= ~MPR1~0 ~s~0)} assume true; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 11:14:46,872 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-15 11:14:46,872 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-15 11:14:46,873 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-15 11:14:46,873 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-15 11:14:46,873 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-15 11:14:46,873 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-15 11:14:46,874 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-15 11:14:46,874 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-15 11:14:46,876 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-15 11:14:46,876 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-15 11:14:46,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-15 11:14:46,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10562#true} {10562#true} #462#return; {10562#true} is VALID [2022-04-15 11:14:46,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {10562#true} call #t~ret35 := main(); {10562#true} is VALID [2022-04-15 11:14:46,876 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-15 11:14:46,877 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-15 11:14:46,877 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-15 11:14:46,878 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-15 11:14:46,878 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-15 11:14:46,878 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-15 11:14:46,879 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-15 11:14:46,879 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-15 11:14:46,879 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-15 11:14:46,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-15 11:14:46,880 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-15 11:14:46,880 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-15 11:14:46,881 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-15 11:14:46,881 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-15 11:14:46,881 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-15 11:14:46,882 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-15 11:14:46,882 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-15 11:14:46,882 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-15 11:14:46,883 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-15 11:14:46,883 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-15 11:14:46,883 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-15 11:14:46,884 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-15 11:14:46,884 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-15 11:14:46,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {10562#true} assume 0 != ~compRegistered~0; {10562#true} is VALID [2022-04-15 11:14:46,885 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-15 11:14:46,885 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-15 11:14:46,885 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-15 11:14:46,885 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-15 11:14:46,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-15 11:14:46,885 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10562#true} {10562#true} #440#return; {10562#true} is VALID [2022-04-15 11:14:46,885 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-15 11:14:46,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-15 11:14:46,885 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10562#true} {10562#true} #450#return; {10562#true} is VALID [2022-04-15 11:14:46,885 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-15 11:14:46,887 INFO L272 TraceCheckUtils]: 39: Hoare triple {10562#true} call stubMoreProcessingRequired(); {10618#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:46,887 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-15 11:14:46,887 INFO L290 TraceCheckUtils]: 41: Hoare triple {10619#(= ~MPR1~0 ~s~0)} assume true; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 11:14:46,887 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-15 11:14:46,888 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-15 11:14:46,888 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-15 11:14:46,888 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-15 11:14:46,889 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-15 11:14:46,889 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-15 11:14:46,889 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-15 11:14:46,890 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-15 11:14:46,890 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-15 11:14:46,890 INFO L290 TraceCheckUtils]: 51: Hoare triple {10563#false} assume 259 == ~__cil_tmp23~0; {10563#false} is VALID [2022-04-15 11:14:46,890 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-15 11:14:46,890 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-15 11:14:46,890 INFO L290 TraceCheckUtils]: 54: Hoare triple {10563#false} assume !(~s~0 == ~MPR3~0); {10563#false} is VALID [2022-04-15 11:14:46,890 INFO L290 TraceCheckUtils]: 55: Hoare triple {10563#false} assume !(1 == ~customIrp~0); {10563#false} is VALID [2022-04-15 11:14:46,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {10563#false} assume ~s~0 == ~MPR3~0; {10563#false} is VALID [2022-04-15 11:14:46,890 INFO L272 TraceCheckUtils]: 57: Hoare triple {10563#false} call errorFn(); {10563#false} is VALID [2022-04-15 11:14:46,890 INFO L290 TraceCheckUtils]: 58: Hoare triple {10563#false} assume !false; {10563#false} is VALID [2022-04-15 11:14:46,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:46,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:46,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403893243] [2022-04-15 11:14:46,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403893243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:46,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:46,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:14:46,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:46,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1433552639] [2022-04-15 11:14:46,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1433552639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:46,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:46,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:14:46,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064711149] [2022-04-15 11:14:46,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:46,892 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-15 11:14:46,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:46,892 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-15 11:14:46,932 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-15 11:14:46,933 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 11:14:46,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:46,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 11:14:46,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:14:46,933 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-15 11:14:47,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:47,800 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-04-15 11:14:47,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 11:14:47,800 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-15 11:14:47,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:47,801 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-15 11:14:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2022-04-15 11:14:47,802 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-15 11:14:47,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2022-04-15 11:14:47,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 123 transitions. [2022-04-15 11:14:47,913 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-15 11:14:47,914 INFO L225 Difference]: With dead ends: 119 [2022-04-15 11:14:47,914 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 11:14:47,915 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-15 11:14:47,917 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-15 11:14:47,918 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-15 11:14:47,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 11:14:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-15 11:14:47,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:47,969 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-15 11:14:47,969 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-15 11:14:47,969 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-15 11:14:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:47,971 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-04-15 11:14:47,971 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-04-15 11:14:47,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:47,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:47,971 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-15 11:14:47,971 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-15 11:14:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:47,972 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-04-15 11:14:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-04-15 11:14:47,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:47,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:47,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:47,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:47,973 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-15 11:14:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-04-15 11:14:47,974 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2022-04-15 11:14:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:47,974 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-04-15 11:14:47,974 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-15 11:14:47,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 101 transitions. [2022-04-15 11:14:48,082 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-15 11:14:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-04-15 11:14:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 11:14:48,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:48,083 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-15 11:14:48,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:14:48,083 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:48,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash 438062746, now seen corresponding path program 1 times [2022-04-15 11:14:48,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:48,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1368667682] [2022-04-15 11:14:48,084 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash 438062746, now seen corresponding path program 2 times [2022-04-15 11:14:48,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:48,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358018397] [2022-04-15 11:14:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:48,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:48,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:48,146 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-15 11:14:48,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #462#return; {11240#true} is VALID [2022-04-15 11:14:48,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:48,167 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-15 11:14:48,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #442#return; {11240#true} is VALID [2022-04-15 11:14:48,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:48,180 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-15 11:14:48,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #444#return; {11240#true} is VALID [2022-04-15 11:14:48,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 11:14:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:48,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:14:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:48,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:14:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:48,216 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-15 11:14:48,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #440#return; {11240#true} is VALID [2022-04-15 11:14:48,216 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-15 11:14:48,217 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-15 11:14:48,217 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-15 11:14:48,217 INFO L290 TraceCheckUtils]: 3: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,217 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11240#true} {11240#true} #440#return; {11240#true} is VALID [2022-04-15 11:14:48,217 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-15 11:14:48,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,217 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11240#true} {11240#true} #450#return; {11240#true} is VALID [2022-04-15 11:14:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:48,227 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-15 11:14:48,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #452#return; {11240#true} is VALID [2022-04-15 11:14:48,227 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-15 11:14:48,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume 0 != ~compRegistered~0; {11240#true} is VALID [2022-04-15 11:14:48,228 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-15 11:14:48,228 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-15 11:14:48,228 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-15 11:14:48,229 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-15 11:14:48,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,229 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11240#true} {11240#true} #440#return; {11240#true} is VALID [2022-04-15 11:14:48,229 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-15 11:14:48,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,229 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11240#true} {11240#true} #450#return; {11240#true} is VALID [2022-04-15 11:14:48,229 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-15 11:14:48,229 INFO L272 TraceCheckUtils]: 12: Hoare triple {11240#true} call stubMoreProcessingRequired(); {11296#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:48,229 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-15 11:14:48,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,229 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11240#true} {11240#true} #452#return; {11240#true} is VALID [2022-04-15 11:14:48,229 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-15 11:14:48,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {11240#true} assume 0 == ~tmp_ndt_2~0; {11240#true} is VALID [2022-04-15 11:14:48,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {11240#true} ~returnVal2~0 := 0; {11291#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-15 11:14:48,230 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-15 11:14:48,230 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-15 11:14:48,231 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-15 11:14:48,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {11241#false} #res := ~returnVal2~0; {11241#false} is VALID [2022-04-15 11:14:48,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {11241#false} assume true; {11241#false} is VALID [2022-04-15 11:14:48,231 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11241#false} {11240#true} #470#return; {11241#false} is VALID [2022-04-15 11:14:48,232 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-15 11:14:48,232 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-15 11:14:48,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11240#true} {11240#true} #462#return; {11240#true} is VALID [2022-04-15 11:14:48,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {11240#true} call #t~ret35 := main(); {11240#true} is VALID [2022-04-15 11:14:48,233 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-15 11:14:48,234 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-15 11:14:48,234 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-15 11:14:48,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,234 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {11240#true} {11240#true} #442#return; {11240#true} is VALID [2022-04-15 11:14:48,234 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-15 11:14:48,234 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-15 11:14:48,234 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-15 11:14:48,235 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-15 11:14:48,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,235 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11240#true} {11240#true} #444#return; {11240#true} is VALID [2022-04-15 11:14:48,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {11240#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {11240#true} is VALID [2022-04-15 11:14:48,235 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-15 11:14:48,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {11240#true} assume 3 == ~tmp_ndt_1~0; {11240#true} is VALID [2022-04-15 11:14:48,235 INFO L272 TraceCheckUtils]: 19: Hoare triple {11240#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {11240#true} is VALID [2022-04-15 11:14:48,235 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-15 11:14:48,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {11240#true} assume 0 == ~irpStack__MinorFunction~0; {11240#true} is VALID [2022-04-15 11:14:48,235 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-15 11:14:48,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {11240#true} assume !(~s~0 != ~NP~0); {11240#true} is VALID [2022-04-15 11:14:48,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {11240#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {11240#true} is VALID [2022-04-15 11:14:48,235 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-15 11:14:48,236 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-15 11:14:48,236 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-15 11:14:48,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {11240#true} assume 0 != ~compRegistered~0; {11240#true} is VALID [2022-04-15 11:14:48,237 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-15 11:14:48,237 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-15 11:14:48,237 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-15 11:14:48,237 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-15 11:14:48,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,237 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11240#true} {11240#true} #440#return; {11240#true} is VALID [2022-04-15 11:14:48,237 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-15 11:14:48,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,237 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11240#true} {11240#true} #450#return; {11240#true} is VALID [2022-04-15 11:14:48,237 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-15 11:14:48,238 INFO L272 TraceCheckUtils]: 39: Hoare triple {11240#true} call stubMoreProcessingRequired(); {11296#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:48,238 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-15 11:14:48,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-15 11:14:48,238 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11240#true} {11240#true} #452#return; {11240#true} is VALID [2022-04-15 11:14:48,238 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-15 11:14:48,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {11240#true} assume 0 == ~tmp_ndt_2~0; {11240#true} is VALID [2022-04-15 11:14:48,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {11240#true} ~returnVal2~0 := 0; {11291#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-15 11:14:48,239 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-15 11:14:48,239 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-15 11:14:48,239 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-15 11:14:48,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {11241#false} #res := ~returnVal2~0; {11241#false} is VALID [2022-04-15 11:14:48,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {11241#false} assume true; {11241#false} is VALID [2022-04-15 11:14:48,239 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11241#false} {11240#true} #470#return; {11241#false} is VALID [2022-04-15 11:14:48,239 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-15 11:14:48,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {11241#false} assume 259 == ~__cil_tmp23~0; {11241#false} is VALID [2022-04-15 11:14:48,239 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-15 11:14:48,239 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-15 11:14:48,240 INFO L290 TraceCheckUtils]: 56: Hoare triple {11241#false} assume !(~s~0 == ~MPR3~0); {11241#false} is VALID [2022-04-15 11:14:48,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {11241#false} assume !(1 == ~customIrp~0); {11241#false} is VALID [2022-04-15 11:14:48,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {11241#false} assume ~s~0 == ~MPR3~0; {11241#false} is VALID [2022-04-15 11:14:48,240 INFO L272 TraceCheckUtils]: 59: Hoare triple {11241#false} call errorFn(); {11241#false} is VALID [2022-04-15 11:14:48,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {11241#false} assume !false; {11241#false} is VALID [2022-04-15 11:14:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:48,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:48,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358018397] [2022-04-15 11:14:48,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358018397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:48,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:48,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:14:48,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:48,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1368667682] [2022-04-15 11:14:48,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1368667682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:48,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:48,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:14:48,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234831791] [2022-04-15 11:14:48,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:48,241 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-15 11:14:48,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:48,241 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-15 11:14:48,278 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-15 11:14:48,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 11:14:48,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:48,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 11:14:48,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-15 11:14:48,279 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-15 11:14:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:48,708 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-04-15 11:14:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 11:14:48,708 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-15 11:14:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:48,709 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-15 11:14:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-04-15 11:14:48,710 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-15 11:14:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-04-15 11:14:48,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 129 transitions. [2022-04-15 11:14:48,823 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-15 11:14:48,824 INFO L225 Difference]: With dead ends: 125 [2022-04-15 11:14:48,824 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 11:14:48,825 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-15 11:14:48,825 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-15 11:14:48,825 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-15 11:14:48,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 11:14:48,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-04-15 11:14:48,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:48,878 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-15 11:14:48,878 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-15 11:14:48,879 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-15 11:14:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:48,880 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-04-15 11:14:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-04-15 11:14:48,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:48,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:48,880 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-15 11:14:48,880 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-15 11:14:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:48,881 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-04-15 11:14:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-04-15 11:14:48,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:48,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:48,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:48,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:48,882 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-15 11:14:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-04-15 11:14:48,883 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2022-04-15 11:14:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:48,883 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-04-15 11:14:48,883 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-15 11:14:48,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 104 transitions. [2022-04-15 11:14:48,994 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-15 11:14:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-04-15 11:14:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 11:14:48,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:48,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] [2022-04-15 11:14:48,994 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:14:48,995 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:48,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash -148743268, now seen corresponding path program 1 times [2022-04-15 11:14:48,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:48,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2076033902] [2022-04-15 11:14:48,995 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash -148743268, now seen corresponding path program 2 times [2022-04-15 11:14:48,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:48,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869539532] [2022-04-15 11:14:48,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:48,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:49,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:49,070 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-15 11:14:49,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #462#return; {11931#true} is VALID [2022-04-15 11:14:49,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:49,094 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-15 11:14:49,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #442#return; {11931#true} is VALID [2022-04-15 11:14:49,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:49,108 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-15 11:14:49,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #444#return; {11931#true} is VALID [2022-04-15 11:14:49,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 11:14:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:14:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:49,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:14:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:49,155 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-15 11:14:49,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #440#return; {11931#true} is VALID [2022-04-15 11:14:49,155 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-15 11:14:49,156 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-15 11:14:49,156 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-15 11:14:49,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,156 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11931#true} {11931#true} #440#return; {11931#true} is VALID [2022-04-15 11:14:49,156 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-15 11:14:49,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,156 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11931#true} {11931#true} #450#return; {11931#true} is VALID [2022-04-15 11:14:49,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:49,165 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-15 11:14:49,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #452#return; {11931#true} is VALID [2022-04-15 11:14:49,165 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-15 11:14:49,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume 0 != ~compRegistered~0; {11931#true} is VALID [2022-04-15 11:14:49,166 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-15 11:14:49,166 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-15 11:14:49,166 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-15 11:14:49,166 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-15 11:14:49,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,166 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11931#true} {11931#true} #440#return; {11931#true} is VALID [2022-04-15 11:14:49,166 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-15 11:14:49,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,166 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11931#true} {11931#true} #450#return; {11931#true} is VALID [2022-04-15 11:14:49,167 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-15 11:14:49,167 INFO L272 TraceCheckUtils]: 12: Hoare triple {11931#true} call stubMoreProcessingRequired(); {11990#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:49,167 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-15 11:14:49,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,167 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11931#true} {11931#true} #452#return; {11931#true} is VALID [2022-04-15 11:14:49,167 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-15 11:14:49,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {11931#true} assume 0 == ~tmp_ndt_2~0; {11931#true} is VALID [2022-04-15 11:14:49,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {11931#true} ~returnVal2~0 := 0; {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-15 11:14:49,168 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-15 11:14:49,168 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-15 11:14:49,168 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-15 11:14:49,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} #res := ~returnVal2~0; {11985#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-15 11:14:49,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {11985#(<= |IofCallDriver_#res| 0)} assume true; {11985#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-15 11:14:49,169 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-15 11:14:49,170 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-15 11:14:49,170 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-15 11:14:49,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11931#true} {11931#true} #462#return; {11931#true} is VALID [2022-04-15 11:14:49,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {11931#true} call #t~ret35 := main(); {11931#true} is VALID [2022-04-15 11:14:49,171 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-15 11:14:49,172 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-15 11:14:49,172 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-15 11:14:49,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,172 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {11931#true} {11931#true} #442#return; {11931#true} is VALID [2022-04-15 11:14:49,172 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-15 11:14:49,172 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-15 11:14:49,172 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-15 11:14:49,172 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-15 11:14:49,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,173 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11931#true} {11931#true} #444#return; {11931#true} is VALID [2022-04-15 11:14:49,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {11931#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {11931#true} is VALID [2022-04-15 11:14:49,173 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-15 11:14:49,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {11931#true} assume 3 == ~tmp_ndt_1~0; {11931#true} is VALID [2022-04-15 11:14:49,173 INFO L272 TraceCheckUtils]: 19: Hoare triple {11931#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {11931#true} is VALID [2022-04-15 11:14:49,173 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-15 11:14:49,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {11931#true} assume 0 == ~irpStack__MinorFunction~0; {11931#true} is VALID [2022-04-15 11:14:49,173 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-15 11:14:49,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {11931#true} assume !(~s~0 != ~NP~0); {11931#true} is VALID [2022-04-15 11:14:49,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {11931#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {11931#true} is VALID [2022-04-15 11:14:49,173 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-15 11:14:49,174 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-15 11:14:49,174 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-15 11:14:49,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {11931#true} assume 0 != ~compRegistered~0; {11931#true} is VALID [2022-04-15 11:14:49,174 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-15 11:14:49,174 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-15 11:14:49,175 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-15 11:14:49,175 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-15 11:14:49,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,175 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11931#true} {11931#true} #440#return; {11931#true} is VALID [2022-04-15 11:14:49,175 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-15 11:14:49,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,175 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11931#true} {11931#true} #450#return; {11931#true} is VALID [2022-04-15 11:14:49,175 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-15 11:14:49,176 INFO L272 TraceCheckUtils]: 39: Hoare triple {11931#true} call stubMoreProcessingRequired(); {11990#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:49,176 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-15 11:14:49,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-15 11:14:49,176 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11931#true} {11931#true} #452#return; {11931#true} is VALID [2022-04-15 11:14:49,176 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-15 11:14:49,176 INFO L290 TraceCheckUtils]: 44: Hoare triple {11931#true} assume 0 == ~tmp_ndt_2~0; {11931#true} is VALID [2022-04-15 11:14:49,176 INFO L290 TraceCheckUtils]: 45: Hoare triple {11931#true} ~returnVal2~0 := 0; {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-15 11:14:49,176 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-15 11:14:49,177 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-15 11:14:49,177 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-15 11:14:49,177 INFO L290 TraceCheckUtils]: 49: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} #res := ~returnVal2~0; {11985#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-15 11:14:49,177 INFO L290 TraceCheckUtils]: 50: Hoare triple {11985#(<= |IofCallDriver_#res| 0)} assume true; {11985#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-15 11:14:49,178 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-15 11:14:49,178 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-15 11:14:49,179 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-15 11:14:49,179 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-15 11:14:49,179 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-15 11:14:49,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {11932#false} assume !(~s~0 == ~MPR3~0); {11932#false} is VALID [2022-04-15 11:14:49,179 INFO L290 TraceCheckUtils]: 57: Hoare triple {11932#false} assume !(1 == ~customIrp~0); {11932#false} is VALID [2022-04-15 11:14:49,179 INFO L290 TraceCheckUtils]: 58: Hoare triple {11932#false} assume ~s~0 == ~MPR3~0; {11932#false} is VALID [2022-04-15 11:14:49,179 INFO L272 TraceCheckUtils]: 59: Hoare triple {11932#false} call errorFn(); {11932#false} is VALID [2022-04-15 11:14:49,179 INFO L290 TraceCheckUtils]: 60: Hoare triple {11932#false} assume !false; {11932#false} is VALID [2022-04-15 11:14:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:49,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869539532] [2022-04-15 11:14:49,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869539532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:49,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:49,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:14:49,180 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:49,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2076033902] [2022-04-15 11:14:49,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2076033902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:49,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:49,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:14:49,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127140609] [2022-04-15 11:14:49,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:49,181 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-15 11:14:49,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:49,181 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-15 11:14:49,219 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-15 11:14:49,220 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 11:14:49,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:49,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 11:14:49,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:14:49,223 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-15 11:14:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:49,878 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-04-15 11:14:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 11:14:49,879 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-15 11:14:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:49,879 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-15 11:14:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-04-15 11:14:49,880 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-15 11:14:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-04-15 11:14:49,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 112 transitions. [2022-04-15 11:14:49,963 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-15 11:14:49,964 INFO L225 Difference]: With dead ends: 112 [2022-04-15 11:14:49,965 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 11:14:49,965 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-15 11:14:49,965 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-15 11:14:49,965 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-15 11:14:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 11:14:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2022-04-15 11:14:50,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:50,028 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-15 11:14:50,028 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-15 11:14:50,028 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-15 11:14:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:50,029 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-04-15 11:14:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-04-15 11:14:50,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:50,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:50,030 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-15 11:14:50,030 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-15 11:14:50,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:50,031 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-04-15 11:14:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-04-15 11:14:50,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:50,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:50,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:50,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:50,031 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-15 11:14:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-04-15 11:14:50,032 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2022-04-15 11:14:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:50,032 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-04-15 11:14:50,033 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-15 11:14:50,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 97 transitions. [2022-04-15 11:14:50,133 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-15 11:14:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-15 11:14:50,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 11:14:50,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:50,134 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-15 11:14:50,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:14:50,134 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:50,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:50,134 INFO L85 PathProgramCache]: Analyzing trace with hash 457949083, now seen corresponding path program 1 times [2022-04-15 11:14:50,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:50,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [227734947] [2022-04-15 11:14:50,135 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:50,135 INFO L85 PathProgramCache]: Analyzing trace with hash 457949083, now seen corresponding path program 2 times [2022-04-15 11:14:50,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:50,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412397663] [2022-04-15 11:14:50,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:50,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:50,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:50,219 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-15 11:14:50,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,220 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #462#return; {12583#true} is VALID [2022-04-15 11:14:50,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:50,238 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-15 11:14:50,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #442#return; {12583#true} is VALID [2022-04-15 11:14:50,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:50,250 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-15 11:14:50,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #444#return; {12583#true} is VALID [2022-04-15 11:14:50,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 11:14:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:50,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:14:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:50,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:14:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:50,280 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-15 11:14:50,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #440#return; {12583#true} is VALID [2022-04-15 11:14:50,280 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-15 11:14:50,281 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-15 11:14:50,281 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-15 11:14:50,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,281 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12583#true} {12583#true} #440#return; {12583#true} is VALID [2022-04-15 11:14:50,281 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-15 11:14:50,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,281 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12583#true} {12583#true} #450#return; {12583#true} is VALID [2022-04-15 11:14:50,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:50,289 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-15 11:14:50,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #452#return; {12583#true} is VALID [2022-04-15 11:14:50,289 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-15 11:14:50,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume 0 != ~compRegistered~0; {12583#true} is VALID [2022-04-15 11:14:50,289 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-15 11:14:50,290 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-15 11:14:50,290 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-15 11:14:50,290 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-15 11:14:50,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,290 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12583#true} {12583#true} #440#return; {12583#true} is VALID [2022-04-15 11:14:50,290 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-15 11:14:50,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,290 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12583#true} {12583#true} #450#return; {12583#true} is VALID [2022-04-15 11:14:50,290 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-15 11:14:50,291 INFO L272 TraceCheckUtils]: 12: Hoare triple {12583#true} call stubMoreProcessingRequired(); {12640#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:50,291 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-15 11:14:50,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,291 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12583#true} {12583#true} #452#return; {12583#true} is VALID [2022-04-15 11:14:50,291 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-15 11:14:50,291 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-15 11:14:50,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {12583#true} assume !(1 == ~tmp_ndt_3~0); {12583#true} is VALID [2022-04-15 11:14:50,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {12583#true} ~returnVal2~0 := 259; {12583#true} is VALID [2022-04-15 11:14:50,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {12583#true} assume !(~s~0 == ~NP~0); {12583#true} is VALID [2022-04-15 11:14:50,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {12583#true} assume ~s~0 == ~MPR1~0; {12583#true} is VALID [2022-04-15 11:14:50,291 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-15 11:14:50,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {12583#true} #res := ~returnVal2~0; {12583#true} is VALID [2022-04-15 11:14:50,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,292 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12583#true} {12583#true} #470#return; {12583#true} is VALID [2022-04-15 11:14:50,293 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-15 11:14:50,293 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-15 11:14:50,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12583#true} {12583#true} #462#return; {12583#true} is VALID [2022-04-15 11:14:50,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {12583#true} call #t~ret35 := main(); {12583#true} is VALID [2022-04-15 11:14:50,293 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-15 11:14:50,294 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-15 11:14:50,294 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-15 11:14:50,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,294 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {12583#true} {12583#true} #442#return; {12583#true} is VALID [2022-04-15 11:14:50,294 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-15 11:14:50,294 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-15 11:14:50,295 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-15 11:14:50,295 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-15 11:14:50,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,295 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12583#true} {12583#true} #444#return; {12583#true} is VALID [2022-04-15 11:14:50,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {12583#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {12583#true} is VALID [2022-04-15 11:14:50,295 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-15 11:14:50,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {12583#true} assume 3 == ~tmp_ndt_1~0; {12583#true} is VALID [2022-04-15 11:14:50,295 INFO L272 TraceCheckUtils]: 19: Hoare triple {12583#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {12583#true} is VALID [2022-04-15 11:14:50,295 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-15 11:14:50,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {12583#true} assume 0 == ~irpStack__MinorFunction~0; {12583#true} is VALID [2022-04-15 11:14:50,295 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-15 11:14:50,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {12583#true} assume !(~s~0 != ~NP~0); {12583#true} is VALID [2022-04-15 11:14:50,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {12583#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {12583#true} is VALID [2022-04-15 11:14:50,296 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-15 11:14:50,296 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-15 11:14:50,296 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-15 11:14:50,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {12583#true} assume 0 != ~compRegistered~0; {12583#true} is VALID [2022-04-15 11:14:50,308 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-15 11:14:50,308 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-15 11:14:50,308 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-15 11:14:50,308 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-15 11:14:50,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,308 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12583#true} {12583#true} #440#return; {12583#true} is VALID [2022-04-15 11:14:50,308 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-15 11:14:50,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,309 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12583#true} {12583#true} #450#return; {12583#true} is VALID [2022-04-15 11:14:50,309 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-15 11:14:50,309 INFO L272 TraceCheckUtils]: 39: Hoare triple {12583#true} call stubMoreProcessingRequired(); {12640#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:50,309 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-15 11:14:50,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,309 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12583#true} {12583#true} #452#return; {12583#true} is VALID [2022-04-15 11:14:50,309 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-15 11:14:50,309 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-15 11:14:50,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {12583#true} assume !(1 == ~tmp_ndt_3~0); {12583#true} is VALID [2022-04-15 11:14:50,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {12583#true} ~returnVal2~0 := 259; {12583#true} is VALID [2022-04-15 11:14:50,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {12583#true} assume !(~s~0 == ~NP~0); {12583#true} is VALID [2022-04-15 11:14:50,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {12583#true} assume ~s~0 == ~MPR1~0; {12583#true} is VALID [2022-04-15 11:14:50,309 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-15 11:14:50,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {12583#true} #res := ~returnVal2~0; {12583#true} is VALID [2022-04-15 11:14:50,310 INFO L290 TraceCheckUtils]: 51: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-15 11:14:50,310 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12583#true} {12583#true} #470#return; {12583#true} is VALID [2022-04-15 11:14:50,310 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-15 11:14:50,310 INFO L290 TraceCheckUtils]: 54: Hoare triple {12583#true} assume 259 == ~__cil_tmp23~0; {12583#true} is VALID [2022-04-15 11:14:50,310 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-15 11:14:50,310 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-15 11:14:50,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {12583#true} assume !(~s~0 == ~MPR3~0); {12620#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:14:50,310 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-15 11:14:50,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {12620#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {12584#false} is VALID [2022-04-15 11:14:50,311 INFO L272 TraceCheckUtils]: 60: Hoare triple {12584#false} call errorFn(); {12584#false} is VALID [2022-04-15 11:14:50,311 INFO L290 TraceCheckUtils]: 61: Hoare triple {12584#false} assume !false; {12584#false} is VALID [2022-04-15 11:14:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:50,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:50,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412397663] [2022-04-15 11:14:50,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412397663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:50,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:50,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:14:50,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:50,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [227734947] [2022-04-15 11:14:50,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [227734947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:50,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:50,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:14:50,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875490555] [2022-04-15 11:14:50,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:50,312 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-15 11:14:50,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:50,313 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-15 11:14:50,343 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-15 11:14:50,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 11:14:50,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:50,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 11:14:50,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-15 11:14:50,344 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-15 11:14:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:50,766 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-04-15 11:14:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 11:14:50,767 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-15 11:14:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:50,767 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-15 11:14:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-04-15 11:14:50,768 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-15 11:14:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-04-15 11:14:50,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 100 transitions. [2022-04-15 11:14:50,856 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-15 11:14:50,857 INFO L225 Difference]: With dead ends: 105 [2022-04-15 11:14:50,857 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 11:14:50,858 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-15 11:14:50,858 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-15 11:14:50,858 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-15 11:14:50,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 11:14:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2022-04-15 11:14:50,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:50,913 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-15 11:14:50,913 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-15 11:14:50,913 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-15 11:14:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:50,914 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-04-15 11:14:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-04-15 11:14:50,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:50,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:50,915 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-15 11:14:50,915 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-15 11:14:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:50,916 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-04-15 11:14:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-04-15 11:14:50,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:50,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:50,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:50,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:50,917 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-15 11:14:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-04-15 11:14:50,918 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2022-04-15 11:14:50,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:50,918 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-04-15 11:14:50,918 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-15 11:14:50,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 98 transitions. [2022-04-15 11:14:51,017 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-15 11:14:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-04-15 11:14:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 11:14:51,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:51,017 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-15 11:14:51,018 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:14:51,018 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:51,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:51,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1607349772, now seen corresponding path program 1 times [2022-04-15 11:14:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:51,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2118931445] [2022-04-15 11:14:51,018 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:51,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1607349772, now seen corresponding path program 2 times [2022-04-15 11:14:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:51,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862584969] [2022-04-15 11:14:51,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:51,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:51,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:51,086 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-15 11:14:51,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,086 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #462#return; {13237#true} is VALID [2022-04-15 11:14:51,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:51,108 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-15 11:14:51,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #442#return; {13237#true} is VALID [2022-04-15 11:14:51,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:51,128 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-15 11:14:51,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #444#return; {13237#true} is VALID [2022-04-15 11:14:51,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 11:14:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:51,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:14:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:51,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:14:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:51,176 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-15 11:14:51,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #440#return; {13237#true} is VALID [2022-04-15 11:14:51,176 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-15 11:14:51,176 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-15 11:14:51,176 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-15 11:14:51,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,177 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13237#true} {13237#true} #440#return; {13237#true} is VALID [2022-04-15 11:14:51,177 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-15 11:14:51,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,177 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13237#true} {13237#true} #450#return; {13237#true} is VALID [2022-04-15 11:14:51,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:51,192 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-15 11:14:51,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #452#return; {13237#true} is VALID [2022-04-15 11:14:51,192 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-15 11:14:51,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume 0 != ~compRegistered~0; {13237#true} is VALID [2022-04-15 11:14:51,193 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-15 11:14:51,193 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-15 11:14:51,193 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-15 11:14:51,193 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-15 11:14:51,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,193 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13237#true} {13237#true} #440#return; {13237#true} is VALID [2022-04-15 11:14:51,193 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-15 11:14:51,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,193 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13237#true} {13237#true} #450#return; {13237#true} is VALID [2022-04-15 11:14:51,193 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-15 11:14:51,194 INFO L272 TraceCheckUtils]: 12: Hoare triple {13237#true} call stubMoreProcessingRequired(); {13297#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:51,194 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-15 11:14:51,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,194 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13237#true} {13237#true} #452#return; {13237#true} is VALID [2022-04-15 11:14:51,194 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-15 11:14:51,194 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-15 11:14:51,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {13237#true} assume !(1 == ~tmp_ndt_3~0); {13237#true} is VALID [2022-04-15 11:14:51,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {13237#true} ~returnVal2~0 := 259; {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 11:14:51,195 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-15 11:14:51,195 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-15 11:14:51,195 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-15 11:14:51,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} #res := ~returnVal2~0; {13292#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-15 11:14:51,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {13292#(<= 259 |IofCallDriver_#res|)} assume true; {13292#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-15 11:14:51,196 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13292#(<= 259 |IofCallDriver_#res|)} {13237#true} #470#return; {13274#(<= 259 |KbFilter_PnP_#t~ret12|)} is VALID [2022-04-15 11:14:51,197 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-15 11:14:51,197 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-15 11:14:51,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13237#true} {13237#true} #462#return; {13237#true} is VALID [2022-04-15 11:14:51,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {13237#true} call #t~ret35 := main(); {13237#true} is VALID [2022-04-15 11:14:51,198 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-15 11:14:51,198 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-15 11:14:51,198 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-15 11:14:51,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,198 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {13237#true} {13237#true} #442#return; {13237#true} is VALID [2022-04-15 11:14:51,199 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-15 11:14:51,199 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-15 11:14:51,199 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-15 11:14:51,199 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-15 11:14:51,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,199 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13237#true} {13237#true} #444#return; {13237#true} is VALID [2022-04-15 11:14:51,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {13237#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {13237#true} is VALID [2022-04-15 11:14:51,199 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-15 11:14:51,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {13237#true} assume 3 == ~tmp_ndt_1~0; {13237#true} is VALID [2022-04-15 11:14:51,200 INFO L272 TraceCheckUtils]: 19: Hoare triple {13237#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {13237#true} is VALID [2022-04-15 11:14:51,200 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-15 11:14:51,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {13237#true} assume 0 == ~irpStack__MinorFunction~0; {13237#true} is VALID [2022-04-15 11:14:51,200 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-15 11:14:51,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {13237#true} assume !(~s~0 != ~NP~0); {13237#true} is VALID [2022-04-15 11:14:51,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {13237#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {13237#true} is VALID [2022-04-15 11:14:51,200 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-15 11:14:51,200 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-15 11:14:51,201 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-15 11:14:51,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {13237#true} assume 0 != ~compRegistered~0; {13237#true} is VALID [2022-04-15 11:14:51,201 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-15 11:14:51,201 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-15 11:14:51,202 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-15 11:14:51,202 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-15 11:14:51,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,202 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13237#true} {13237#true} #440#return; {13237#true} is VALID [2022-04-15 11:14:51,202 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-15 11:14:51,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,202 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13237#true} {13237#true} #450#return; {13237#true} is VALID [2022-04-15 11:14:51,202 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-15 11:14:51,202 INFO L272 TraceCheckUtils]: 39: Hoare triple {13237#true} call stubMoreProcessingRequired(); {13297#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:51,202 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-15 11:14:51,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-15 11:14:51,202 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13237#true} {13237#true} #452#return; {13237#true} is VALID [2022-04-15 11:14:51,203 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-15 11:14:51,203 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-15 11:14:51,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {13237#true} assume !(1 == ~tmp_ndt_3~0); {13237#true} is VALID [2022-04-15 11:14:51,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {13237#true} ~returnVal2~0 := 259; {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 11:14:51,203 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-15 11:14:51,203 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-15 11:14:51,203 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-15 11:14:51,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} #res := ~returnVal2~0; {13292#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-15 11:14:51,204 INFO L290 TraceCheckUtils]: 51: Hoare triple {13292#(<= 259 |IofCallDriver_#res|)} assume true; {13292#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-15 11:14:51,204 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13292#(<= 259 |IofCallDriver_#res|)} {13237#true} #470#return; {13274#(<= 259 |KbFilter_PnP_#t~ret12|)} is VALID [2022-04-15 11:14:51,205 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-15 11:14:51,205 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-15 11:14:51,205 INFO L290 TraceCheckUtils]: 55: Hoare triple {13275#(<= 259 KbFilter_PnP_~status~0)} assume !(~status~0 >= 0); {13238#false} is VALID [2022-04-15 11:14:51,205 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-15 11:14:51,205 INFO L272 TraceCheckUtils]: 57: Hoare triple {13238#false} call IofCompleteRequest(~Irp, 0); {13238#false} is VALID [2022-04-15 11:14:51,206 INFO L290 TraceCheckUtils]: 58: Hoare triple {13238#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {13238#false} is VALID [2022-04-15 11:14:51,206 INFO L290 TraceCheckUtils]: 59: Hoare triple {13238#false} assume !(~s~0 == ~NP~0); {13238#false} is VALID [2022-04-15 11:14:51,206 INFO L272 TraceCheckUtils]: 60: Hoare triple {13238#false} call errorFn(); {13238#false} is VALID [2022-04-15 11:14:51,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {13238#false} assume !false; {13238#false} is VALID [2022-04-15 11:14:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:51,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:51,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862584969] [2022-04-15 11:14:51,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862584969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:51,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:51,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:14:51,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:51,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2118931445] [2022-04-15 11:14:51,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2118931445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:51,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:51,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:14:51,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962445429] [2022-04-15 11:14:51,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:51,207 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-15 11:14:51,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:51,207 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-15 11:14:51,238 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-15 11:14:51,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 11:14:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:51,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 11:14:51,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:14:51,239 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-15 11:14:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:51,924 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-04-15 11:14:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 11:14:51,924 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-15 11:14:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:51,924 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-15 11:14:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-15 11:14:51,926 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-15 11:14:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-15 11:14:51,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2022-04-15 11:14:52,000 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-15 11:14:52,001 INFO L225 Difference]: With dead ends: 98 [2022-04-15 11:14:52,001 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 11:14:52,001 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-15 11:14:52,001 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 85 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-15 11:14:52,001 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-15 11:14:52,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 11:14:52,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-15 11:14:52,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:52,056 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-15 11:14:52,056 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-15 11:14:52,056 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-15 11:14:52,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:52,057 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-04-15 11:14:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-04-15 11:14:52,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:52,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:52,058 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-15 11:14:52,058 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-15 11:14:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:52,059 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-04-15 11:14:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-04-15 11:14:52,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:52,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:52,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:52,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:52,060 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-15 11:14:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-04-15 11:14:52,061 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2022-04-15 11:14:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:52,061 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-04-15 11:14:52,061 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-15 11:14:52,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 97 transitions. [2022-04-15 11:14:52,169 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-15 11:14:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-04-15 11:14:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 11:14:52,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:52,169 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-15 11:14:52,170 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:14:52,170 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:52,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1073874348, now seen corresponding path program 1 times [2022-04-15 11:14:52,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:52,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2066158483] [2022-04-15 11:14:52,170 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:52,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1073874348, now seen corresponding path program 2 times [2022-04-15 11:14:52,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:52,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082314139] [2022-04-15 11:14:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:52,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:52,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:52,250 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-15 11:14:52,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-15 11:14:52,251 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13862#true} {13862#true} #462#return; {13862#true} is VALID [2022-04-15 11:14:52,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:52,272 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-15 11:14:52,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-15 11:14:52,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13862#true} {13862#true} #442#return; {13862#true} is VALID [2022-04-15 11:14:52,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:52,285 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-15 11:14:52,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-15 11:14:52,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13862#true} {13862#true} #444#return; {13862#true} is VALID [2022-04-15 11:14:52,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 11:14:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:52,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:14:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:52,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:14:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:52,319 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-15 11:14:52,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #440#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,320 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-15 11:14:52,320 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-15 11:14:52,320 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-15 11:14:52,321 INFO L290 TraceCheckUtils]: 3: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,321 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #440#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,321 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-15 11:14:52,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,322 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #450#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:52,329 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-15 11:14:52,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-15 11:14:52,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13862#true} {13899#(= ~setEventCalled~0 1)} #452#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,330 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-15 11:14:52,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume 0 != ~compRegistered~0; {13862#true} is VALID [2022-04-15 11:14:52,330 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-15 11:14:52,330 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-15 11:14:52,331 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-15 11:14:52,331 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-15 11:14:52,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,332 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #440#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,332 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-15 11:14:52,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,333 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #450#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,333 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-15 11:14:52,334 INFO L272 TraceCheckUtils]: 12: Hoare triple {13899#(= ~setEventCalled~0 1)} call stubMoreProcessingRequired(); {13919#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:52,334 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-15 11:14:52,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-15 11:14:52,334 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13862#true} {13899#(= ~setEventCalled~0 1)} #452#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,334 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-15 11:14:52,334 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-15 11:14:52,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(1 == ~tmp_ndt_3~0); {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {13899#(= ~setEventCalled~0 1)} ~returnVal2~0 := 259; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(~s~0 == ~NP~0); {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {13899#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR1~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,336 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-15 11:14:52,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {13899#(= ~setEventCalled~0 1)} #res := ~returnVal2~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,337 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #470#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,338 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-15 11:14:52,338 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-15 11:14:52,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-15 11:14:52,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13862#true} {13862#true} #462#return; {13862#true} is VALID [2022-04-15 11:14:52,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {13862#true} call #t~ret35 := main(); {13862#true} is VALID [2022-04-15 11:14:52,338 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-15 11:14:52,339 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-15 11:14:52,339 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-15 11:14:52,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-15 11:14:52,339 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {13862#true} {13862#true} #442#return; {13862#true} is VALID [2022-04-15 11:14:52,340 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-15 11:14:52,340 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-15 11:14:52,340 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-15 11:14:52,340 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-15 11:14:52,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-15 11:14:52,340 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13862#true} {13862#true} #444#return; {13862#true} is VALID [2022-04-15 11:14:52,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {13862#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {13862#true} is VALID [2022-04-15 11:14:52,340 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-15 11:14:52,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {13862#true} assume 3 == ~tmp_ndt_1~0; {13862#true} is VALID [2022-04-15 11:14:52,341 INFO L272 TraceCheckUtils]: 19: Hoare triple {13862#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {13862#true} is VALID [2022-04-15 11:14:52,341 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-15 11:14:52,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {13862#true} assume 0 == ~irpStack__MinorFunction~0; {13862#true} is VALID [2022-04-15 11:14:52,341 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-15 11:14:52,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {13862#true} assume !(~s~0 != ~NP~0); {13862#true} is VALID [2022-04-15 11:14:52,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {13862#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {13862#true} is VALID [2022-04-15 11:14:52,341 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-15 11:14:52,341 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-15 11:14:52,342 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-15 11:14:52,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {13862#true} assume 0 != ~compRegistered~0; {13862#true} is VALID [2022-04-15 11:14:52,342 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-15 11:14:52,342 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-15 11:14:52,343 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-15 11:14:52,343 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-15 11:14:52,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,344 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #440#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,344 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-15 11:14:52,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,345 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #450#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,345 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-15 11:14:52,345 INFO L272 TraceCheckUtils]: 39: Hoare triple {13899#(= ~setEventCalled~0 1)} call stubMoreProcessingRequired(); {13919#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:52,345 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-15 11:14:52,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-15 11:14:52,346 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13862#true} {13899#(= ~setEventCalled~0 1)} #452#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,346 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-15 11:14:52,346 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-15 11:14:52,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(1 == ~tmp_ndt_3~0); {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,347 INFO L290 TraceCheckUtils]: 46: Hoare triple {13899#(= ~setEventCalled~0 1)} ~returnVal2~0 := 259; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(~s~0 == ~NP~0); {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {13899#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR1~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,347 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-15 11:14:52,348 INFO L290 TraceCheckUtils]: 50: Hoare triple {13899#(= ~setEventCalled~0 1)} #res := ~returnVal2~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,348 INFO L290 TraceCheckUtils]: 51: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,348 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #470#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,349 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-15 11:14:52,349 INFO L290 TraceCheckUtils]: 54: Hoare triple {13899#(= ~setEventCalled~0 1)} assume 259 == ~__cil_tmp23~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,349 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-15 11:14:52,350 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-15 11:14:52,350 INFO L290 TraceCheckUtils]: 57: Hoare triple {13899#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR3~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:14:52,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(1 == ~setEventCalled~0); {13863#false} is VALID [2022-04-15 11:14:52,350 INFO L290 TraceCheckUtils]: 59: Hoare triple {13863#false} assume !(1 == ~customIrp~0); {13863#false} is VALID [2022-04-15 11:14:52,350 INFO L290 TraceCheckUtils]: 60: Hoare triple {13863#false} assume ~s~0 == ~MPR3~0; {13863#false} is VALID [2022-04-15 11:14:52,350 INFO L272 TraceCheckUtils]: 61: Hoare triple {13863#false} call errorFn(); {13863#false} is VALID [2022-04-15 11:14:52,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {13863#false} assume !false; {13863#false} is VALID [2022-04-15 11:14:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:52,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:52,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082314139] [2022-04-15 11:14:52,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082314139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:52,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:52,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:14:52,351 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:52,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2066158483] [2022-04-15 11:14:52,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2066158483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:52,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:52,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:14:52,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180030260] [2022-04-15 11:14:52,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:52,352 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-15 11:14:52,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:52,352 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-15 11:14:52,393 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-15 11:14:52,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 11:14:52,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:52,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 11:14:52,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-15 11:14:52,394 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-15 11:14:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:52,736 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-04-15 11:14:52,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 11:14:52,737 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-15 11:14:52,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:52,737 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-15 11:14:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-15 11:14:52,738 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-15 11:14:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-15 11:14:52,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 103 transitions. [2022-04-15 11:14:52,813 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-15 11:14:52,814 INFO L225 Difference]: With dead ends: 107 [2022-04-15 11:14:52,814 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 11:14:52,814 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-15 11:14:52,815 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-15 11:14:52,815 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-15 11:14:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 11:14:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-15 11:14:52,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:52,882 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-15 11:14:52,882 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-15 11:14:52,882 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-15 11:14:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:52,883 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-15 11:14:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-15 11:14:52,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:52,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:52,883 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-15 11:14:52,883 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-15 11:14:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:52,884 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-15 11:14:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-15 11:14:52,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:52,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:52,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:52,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:52,885 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-15 11:14:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-15 11:14:52,885 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2022-04-15 11:14:52,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:52,886 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-15 11:14:52,886 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-15 11:14:52,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 79 transitions. [2022-04-15 11:14:52,970 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-15 11:14:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-15 11:14:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 11:14:52,971 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:52,971 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-15 11:14:52,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:14:52,971 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:52,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:52,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1942054886, now seen corresponding path program 1 times [2022-04-15 11:14:52,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:52,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2061498711] [2022-04-15 11:14:52,972 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:52,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1942054886, now seen corresponding path program 2 times [2022-04-15 11:14:52,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:52,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245167756] [2022-04-15 11:14:52,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:52,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:53,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:53,056 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-15 11:14:53,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14446#true} #462#return; {14446#true} is VALID [2022-04-15 11:14:53,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:53,082 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-15 11:14:53,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14446#true} #442#return; {14446#true} is VALID [2022-04-15 11:14:53,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:53,102 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-15 11:14:53,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14454#(<= (+ ~myStatus~0 1073741637) 0)} #444#return; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-15 11:14:53,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 11:14:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:53,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:14:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:53,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:14:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:53,127 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-15 11:14:53,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14446#true} #440#return; {14446#true} is VALID [2022-04-15 11:14:53,128 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-15 11:14:53,128 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-15 11:14:53,128 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-15 11:14:53,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,128 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14446#true} {14446#true} #440#return; {14446#true} is VALID [2022-04-15 11:14:53,128 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-15 11:14:53,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,128 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14446#true} {14446#true} #450#return; {14446#true} is VALID [2022-04-15 11:14:53,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:53,135 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-15 11:14:53,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,135 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14446#true} #452#return; {14446#true} is VALID [2022-04-15 11:14:53,135 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-15 11:14:53,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume 0 != ~compRegistered~0; {14446#true} is VALID [2022-04-15 11:14:53,136 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-15 11:14:53,136 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-15 11:14:53,137 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-15 11:14:53,137 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-15 11:14:53,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,137 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14446#true} {14446#true} #440#return; {14446#true} is VALID [2022-04-15 11:14:53,137 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-15 11:14:53,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,137 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14446#true} {14446#true} #450#return; {14446#true} is VALID [2022-04-15 11:14:53,137 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-15 11:14:53,137 INFO L272 TraceCheckUtils]: 12: Hoare triple {14446#true} call stubMoreProcessingRequired(); {14503#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:53,138 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-15 11:14:53,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,138 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14446#true} {14446#true} #452#return; {14446#true} is VALID [2022-04-15 11:14:53,138 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-15 11:14:53,138 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-15 11:14:53,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {14446#true} assume !(1 == ~tmp_ndt_3~0); {14446#true} is VALID [2022-04-15 11:14:53,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {14446#true} ~returnVal2~0 := 259; {14446#true} is VALID [2022-04-15 11:14:53,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {14446#true} assume !(~s~0 == ~NP~0); {14446#true} is VALID [2022-04-15 11:14:53,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {14446#true} assume ~s~0 == ~MPR1~0; {14446#true} is VALID [2022-04-15 11:14:53,138 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-15 11:14:53,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {14446#true} #res := ~returnVal2~0; {14446#true} is VALID [2022-04-15 11:14:53,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,139 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14446#true} {14454#(<= (+ ~myStatus~0 1073741637) 0)} #470#return; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-15 11:14:53,140 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-15 11:14:53,140 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-15 11:14:53,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14446#true} {14446#true} #462#return; {14446#true} is VALID [2022-04-15 11:14:53,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {14446#true} call #t~ret35 := main(); {14446#true} is VALID [2022-04-15 11:14:53,141 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-15 11:14:53,141 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-15 11:14:53,142 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-15 11:14:53,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,142 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {14446#true} {14446#true} #442#return; {14446#true} is VALID [2022-04-15 11:14:53,142 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-15 11:14:53,142 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-15 11:14:53,143 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-15 11:14:53,143 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-15 11:14:53,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,143 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14446#true} {14454#(<= (+ ~myStatus~0 1073741637) 0)} #444#return; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-15 11:14:53,143 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-15 11:14:53,144 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-15 11:14:53,144 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-15 11:14:53,144 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-15 11:14:53,145 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-15 11:14:53,145 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-15 11:14:53,145 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-15 11:14:53,146 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-15 11:14:53,146 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-15 11:14:53,146 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-15 11:14:53,147 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-15 11:14:53,147 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-15 11:14:53,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {14446#true} assume 0 != ~compRegistered~0; {14446#true} is VALID [2022-04-15 11:14:53,148 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-15 11:14:53,148 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-15 11:14:53,148 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-15 11:14:53,148 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-15 11:14:53,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,148 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14446#true} {14446#true} #440#return; {14446#true} is VALID [2022-04-15 11:14:53,148 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-15 11:14:53,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,149 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14446#true} {14446#true} #450#return; {14446#true} is VALID [2022-04-15 11:14:53,149 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-15 11:14:53,149 INFO L272 TraceCheckUtils]: 39: Hoare triple {14446#true} call stubMoreProcessingRequired(); {14503#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:53,149 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-15 11:14:53,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,149 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {14446#true} {14446#true} #452#return; {14446#true} is VALID [2022-04-15 11:14:53,149 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-15 11:14:53,149 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-15 11:14:53,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {14446#true} assume !(1 == ~tmp_ndt_3~0); {14446#true} is VALID [2022-04-15 11:14:53,149 INFO L290 TraceCheckUtils]: 46: Hoare triple {14446#true} ~returnVal2~0 := 259; {14446#true} is VALID [2022-04-15 11:14:53,149 INFO L290 TraceCheckUtils]: 47: Hoare triple {14446#true} assume !(~s~0 == ~NP~0); {14446#true} is VALID [2022-04-15 11:14:53,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {14446#true} assume ~s~0 == ~MPR1~0; {14446#true} is VALID [2022-04-15 11:14:53,150 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-15 11:14:53,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {14446#true} #res := ~returnVal2~0; {14446#true} is VALID [2022-04-15 11:14:53,150 INFO L290 TraceCheckUtils]: 51: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-15 11:14:53,150 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14446#true} {14454#(<= (+ ~myStatus~0 1073741637) 0)} #470#return; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-15 11:14:53,150 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-15 11:14:53,151 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-15 11:14:53,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume ~status~0 >= 0; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-15 11:14:53,151 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-15 11:14:53,151 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-15 11:14:53,152 INFO L272 TraceCheckUtils]: 58: Hoare triple {14447#false} call IofCompleteRequest(~Irp, 0); {14447#false} is VALID [2022-04-15 11:14:53,152 INFO L290 TraceCheckUtils]: 59: Hoare triple {14447#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {14447#false} is VALID [2022-04-15 11:14:53,152 INFO L290 TraceCheckUtils]: 60: Hoare triple {14447#false} assume !(~s~0 == ~NP~0); {14447#false} is VALID [2022-04-15 11:14:53,152 INFO L272 TraceCheckUtils]: 61: Hoare triple {14447#false} call errorFn(); {14447#false} is VALID [2022-04-15 11:14:53,152 INFO L290 TraceCheckUtils]: 62: Hoare triple {14447#false} assume !false; {14447#false} is VALID [2022-04-15 11:14:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:53,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:53,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245167756] [2022-04-15 11:14:53,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245167756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:53,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:53,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:14:53,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:53,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2061498711] [2022-04-15 11:14:53,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2061498711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:53,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:53,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:14:53,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465352693] [2022-04-15 11:14:53,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:53,153 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-15 11:14:53,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:53,153 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-15 11:14:53,194 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-15 11:14:53,194 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 11:14:53,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:53,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 11:14:53,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-15 11:14:53,195 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-15 11:14:53,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:53,838 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2022-04-15 11:14:53,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 11:14:53,838 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-15 11:14:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:53,839 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-15 11:14:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2022-04-15 11:14:53,840 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-15 11:14:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2022-04-15 11:14:53,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 146 transitions. [2022-04-15 11:14:53,970 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-15 11:14:53,972 INFO L225 Difference]: With dead ends: 141 [2022-04-15 11:14:53,972 INFO L226 Difference]: Without dead ends: 134 [2022-04-15 11:14:53,972 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-15 11:14:53,973 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-15 11:14:53,973 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-15 11:14:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-15 11:14:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-04-15 11:14:54,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:54,087 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-15 11:14:54,087 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-15 11:14:54,088 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-15 11:14:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:54,089 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-04-15 11:14:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2022-04-15 11:14:54,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:54,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:54,090 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-15 11:14:54,090 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-15 11:14:54,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:54,091 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-04-15 11:14:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2022-04-15 11:14:54,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:54,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:54,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:54,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:54,092 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-15 11:14:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2022-04-15 11:14:54,093 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2022-04-15 11:14:54,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:54,094 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2022-04-15 11:14:54,094 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-15 11:14:54,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 138 transitions. [2022-04-15 11:14:54,238 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-15 11:14:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2022-04-15 11:14:54,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 11:14:54,240 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:54,240 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-15 11:14:54,240 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:14:54,240 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:54,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash -577905048, now seen corresponding path program 1 times [2022-04-15 11:14:54,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:54,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1816928763] [2022-04-15 11:14:54,241 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:54,241 INFO L85 PathProgramCache]: Analyzing trace with hash -577905048, now seen corresponding path program 2 times [2022-04-15 11:14:54,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:54,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864783212] [2022-04-15 11:14:54,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:54,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:54,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:54,333 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-15 11:14:54,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,333 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #462#return; {15331#true} is VALID [2022-04-15 11:14:54,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:54,357 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-15 11:14:54,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,358 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #442#return; {15331#true} is VALID [2022-04-15 11:14:54,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:54,372 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-15 11:14:54,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #444#return; {15331#true} is VALID [2022-04-15 11:14:54,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 11:14:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:54,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:14:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:54,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:14:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:54,433 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-15 11:14:54,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #440#return; {15331#true} is VALID [2022-04-15 11:14:54,433 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-15 11:14:54,434 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-15 11:14:54,434 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-15 11:14:54,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,434 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15331#true} {15331#true} #440#return; {15331#true} is VALID [2022-04-15 11:14:54,434 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-15 11:14:54,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,434 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15331#true} {15331#true} #450#return; {15331#true} is VALID [2022-04-15 11:14:54,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:54,443 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-15 11:14:54,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #452#return; {15331#true} is VALID [2022-04-15 11:14:54,443 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-15 11:14:54,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume 0 != ~compRegistered~0; {15331#true} is VALID [2022-04-15 11:14:54,444 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-15 11:14:54,444 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-15 11:14:54,445 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-15 11:14:54,445 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-15 11:14:54,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,445 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15331#true} {15331#true} #440#return; {15331#true} is VALID [2022-04-15 11:14:54,445 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-15 11:14:54,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,445 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15331#true} {15331#true} #450#return; {15331#true} is VALID [2022-04-15 11:14:54,445 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-15 11:14:54,445 INFO L272 TraceCheckUtils]: 12: Hoare triple {15331#true} call stubMoreProcessingRequired(); {15391#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:54,445 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-15 11:14:54,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,445 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15331#true} {15331#true} #452#return; {15331#true} is VALID [2022-04-15 11:14:54,446 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-15 11:14:54,446 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-15 11:14:54,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {15331#true} assume !(1 == ~tmp_ndt_3~0); {15331#true} is VALID [2022-04-15 11:14:54,446 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-15 11:14:54,446 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-15 11:14:54,447 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-15 11:14:54,447 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-15 11:14:54,447 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-15 11:14:54,447 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-15 11:14:54,448 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-15 11:14:54,450 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-15 11:14:54,450 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-15 11:14:54,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15331#true} {15331#true} #462#return; {15331#true} is VALID [2022-04-15 11:14:54,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {15331#true} call #t~ret35 := main(); {15331#true} is VALID [2022-04-15 11:14:54,450 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-15 11:14:54,451 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-15 11:14:54,451 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-15 11:14:54,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,451 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {15331#true} {15331#true} #442#return; {15331#true} is VALID [2022-04-15 11:14:54,451 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-15 11:14:54,451 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-15 11:14:54,452 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-15 11:14:54,452 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-15 11:14:54,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,452 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15331#true} {15331#true} #444#return; {15331#true} is VALID [2022-04-15 11:14:54,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {15331#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {15331#true} is VALID [2022-04-15 11:14:54,452 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-15 11:14:54,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {15331#true} assume 3 == ~tmp_ndt_1~0; {15331#true} is VALID [2022-04-15 11:14:54,452 INFO L272 TraceCheckUtils]: 19: Hoare triple {15331#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {15331#true} is VALID [2022-04-15 11:14:54,452 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-15 11:14:54,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {15331#true} assume 0 == ~irpStack__MinorFunction~0; {15331#true} is VALID [2022-04-15 11:14:54,452 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-15 11:14:54,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {15331#true} assume !(~s~0 != ~NP~0); {15331#true} is VALID [2022-04-15 11:14:54,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {15331#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {15331#true} is VALID [2022-04-15 11:14:54,452 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-15 11:14:54,453 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-15 11:14:54,453 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-15 11:14:54,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {15331#true} assume 0 != ~compRegistered~0; {15331#true} is VALID [2022-04-15 11:14:54,454 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-15 11:14:54,454 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-15 11:14:54,454 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-15 11:14:54,454 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-15 11:14:54,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,454 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15331#true} {15331#true} #440#return; {15331#true} is VALID [2022-04-15 11:14:54,454 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-15 11:14:54,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,455 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {15331#true} {15331#true} #450#return; {15331#true} is VALID [2022-04-15 11:14:54,455 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-15 11:14:54,455 INFO L272 TraceCheckUtils]: 39: Hoare triple {15331#true} call stubMoreProcessingRequired(); {15391#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:54,455 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-15 11:14:54,455 INFO L290 TraceCheckUtils]: 41: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-15 11:14:54,455 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15331#true} {15331#true} #452#return; {15331#true} is VALID [2022-04-15 11:14:54,455 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-15 11:14:54,455 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-15 11:14:54,455 INFO L290 TraceCheckUtils]: 45: Hoare triple {15331#true} assume !(1 == ~tmp_ndt_3~0); {15331#true} is VALID [2022-04-15 11:14:54,456 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-15 11:14:54,456 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-15 11:14:54,456 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-15 11:14:54,456 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-15 11:14:54,457 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-15 11:14:54,457 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-15 11:14:54,458 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-15 11:14:54,458 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-15 11:14:54,458 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-15 11:14:54,458 INFO L290 TraceCheckUtils]: 55: Hoare triple {15332#false} assume ~status~0 >= 0; {15332#false} is VALID [2022-04-15 11:14:54,459 INFO L290 TraceCheckUtils]: 56: Hoare triple {15332#false} assume !(~myStatus~0 >= 0); {15332#false} is VALID [2022-04-15 11:14:54,459 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-15 11:14:54,459 INFO L272 TraceCheckUtils]: 58: Hoare triple {15332#false} call IofCompleteRequest(~Irp, 0); {15332#false} is VALID [2022-04-15 11:14:54,459 INFO L290 TraceCheckUtils]: 59: Hoare triple {15332#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {15332#false} is VALID [2022-04-15 11:14:54,459 INFO L290 TraceCheckUtils]: 60: Hoare triple {15332#false} assume !(~s~0 == ~NP~0); {15332#false} is VALID [2022-04-15 11:14:54,459 INFO L272 TraceCheckUtils]: 61: Hoare triple {15332#false} call errorFn(); {15332#false} is VALID [2022-04-15 11:14:54,459 INFO L290 TraceCheckUtils]: 62: Hoare triple {15332#false} assume !false; {15332#false} is VALID [2022-04-15 11:14:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:54,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:54,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864783212] [2022-04-15 11:14:54,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864783212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:54,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:54,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:14:54,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:54,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1816928763] [2022-04-15 11:14:54,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1816928763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:54,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:54,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:14:54,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700212944] [2022-04-15 11:14:54,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:54,462 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-15 11:14:54,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:54,462 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-15 11:14:54,501 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-15 11:14:54,501 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 11:14:54,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:54,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 11:14:54,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:14:54,502 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-15 11:14:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:55,224 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2022-04-15 11:14:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 11:14:55,224 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-15 11:14:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:55,225 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-15 11:14:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-04-15 11:14:55,225 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-15 11:14:55,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-04-15 11:14:55,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 88 transitions. [2022-04-15 11:14:55,304 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-15 11:14:55,305 INFO L225 Difference]: With dead ends: 144 [2022-04-15 11:14:55,305 INFO L226 Difference]: Without dead ends: 133 [2022-04-15 11:14:55,306 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-15 11:14:55,306 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-15 11:14:55,306 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-15 11:14:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-15 11:14:55,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-04-15 11:14:55,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:55,442 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-15 11:14:55,442 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-15 11:14:55,442 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-15 11:14:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:55,444 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-15 11:14:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-15 11:14:55,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:55,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:55,445 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-15 11:14:55,445 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-15 11:14:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:55,446 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-15 11:14:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-15 11:14:55,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:55,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:55,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:55,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:55,447 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-15 11:14:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2022-04-15 11:14:55,448 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2022-04-15 11:14:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:55,448 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2022-04-15 11:14:55,449 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-15 11:14:55,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 136 transitions. [2022-04-15 11:14:55,587 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-15 11:14:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-15 11:14:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 11:14:55,588 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:55,588 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-15 11:14:55,588 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:14:55,589 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:55,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1364815011, now seen corresponding path program 1 times [2022-04-15 11:14:55,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:55,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [727550094] [2022-04-15 11:14:55,589 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:14:55,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1364815011, now seen corresponding path program 2 times [2022-04-15 11:14:55,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:55,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697998698] [2022-04-15 11:14:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:55,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:55,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:14:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:55,656 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-15 11:14:55,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #462#return; {16216#true} is VALID [2022-04-15 11:14:55,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:14:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:55,674 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-15 11:14:55,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #442#return; {16216#true} is VALID [2022-04-15 11:14:55,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:55,684 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-15 11:14:55,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #444#return; {16216#true} is VALID [2022-04-15 11:14:55,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 11:14:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:55,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:14:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:14:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:55,715 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-15 11:14:55,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #440#return; {16216#true} is VALID [2022-04-15 11:14:55,715 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-15 11:14:55,715 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-15 11:14:55,715 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-15 11:14:55,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,715 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16216#true} {16216#true} #440#return; {16216#true} is VALID [2022-04-15 11:14:55,716 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-15 11:14:55,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,716 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16216#true} {16216#true} #450#return; {16216#true} is VALID [2022-04-15 11:14:55,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:14:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:55,723 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-15 11:14:55,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #452#return; {16216#true} is VALID [2022-04-15 11:14:55,723 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-15 11:14:55,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume 0 != ~compRegistered~0; {16216#true} is VALID [2022-04-15 11:14:55,724 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-15 11:14:55,724 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-15 11:14:55,724 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-15 11:14:55,724 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-15 11:14:55,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,724 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16216#true} {16216#true} #440#return; {16216#true} is VALID [2022-04-15 11:14:55,725 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-15 11:14:55,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,725 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16216#true} {16216#true} #450#return; {16216#true} is VALID [2022-04-15 11:14:55,725 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-15 11:14:55,725 INFO L272 TraceCheckUtils]: 12: Hoare triple {16216#true} call stubMoreProcessingRequired(); {16282#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:55,725 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-15 11:14:55,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,725 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16216#true} {16216#true} #452#return; {16216#true} is VALID [2022-04-15 11:14:55,725 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-15 11:14:55,725 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-15 11:14:55,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {16216#true} assume !(1 == ~tmp_ndt_3~0); {16216#true} is VALID [2022-04-15 11:14:55,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {16216#true} ~returnVal2~0 := 259; {16216#true} is VALID [2022-04-15 11:14:55,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {16216#true} assume !(~s~0 == ~NP~0); {16216#true} is VALID [2022-04-15 11:14:55,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {16216#true} assume ~s~0 == ~MPR1~0; {16216#true} is VALID [2022-04-15 11:14:55,726 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-15 11:14:55,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {16253#(= ~MPR3~0 ~s~0)} #res := ~returnVal2~0; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 11:14:55,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {16253#(= ~MPR3~0 ~s~0)} assume true; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 11:14:55,727 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16253#(= ~MPR3~0 ~s~0)} {16216#true} #470#return; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 11:14:55,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-15 11:14:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:55,744 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-15 11:14:55,744 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-15 11:14:55,745 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-15 11:14:55,745 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-15 11:14:55,745 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-15 11:14:55,745 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-15 11:14:55,745 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-15 11:14:55,746 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-15 11:14:55,746 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-15 11:14:55,748 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-15 11:14:55,748 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-15 11:14:55,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16216#true} {16216#true} #462#return; {16216#true} is VALID [2022-04-15 11:14:55,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {16216#true} call #t~ret35 := main(); {16216#true} is VALID [2022-04-15 11:14:55,748 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-15 11:14:55,749 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-15 11:14:55,749 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-15 11:14:55,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,749 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {16216#true} {16216#true} #442#return; {16216#true} is VALID [2022-04-15 11:14:55,749 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-15 11:14:55,749 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-15 11:14:55,749 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-15 11:14:55,750 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-15 11:14:55,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,750 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16216#true} {16216#true} #444#return; {16216#true} is VALID [2022-04-15 11:14:55,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {16216#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {16216#true} is VALID [2022-04-15 11:14:55,750 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-15 11:14:55,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {16216#true} assume 3 == ~tmp_ndt_1~0; {16216#true} is VALID [2022-04-15 11:14:55,750 INFO L272 TraceCheckUtils]: 19: Hoare triple {16216#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {16216#true} is VALID [2022-04-15 11:14:55,750 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-15 11:14:55,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {16216#true} assume 0 == ~irpStack__MinorFunction~0; {16216#true} is VALID [2022-04-15 11:14:55,750 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-15 11:14:55,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {16216#true} assume !(~s~0 != ~NP~0); {16216#true} is VALID [2022-04-15 11:14:55,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {16216#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {16216#true} is VALID [2022-04-15 11:14:55,750 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-15 11:14:55,751 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-15 11:14:55,751 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-15 11:14:55,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {16216#true} assume 0 != ~compRegistered~0; {16216#true} is VALID [2022-04-15 11:14:55,751 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-15 11:14:55,751 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-15 11:14:55,752 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-15 11:14:55,752 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-15 11:14:55,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,752 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16216#true} {16216#true} #440#return; {16216#true} is VALID [2022-04-15 11:14:55,752 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-15 11:14:55,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,752 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16216#true} {16216#true} #450#return; {16216#true} is VALID [2022-04-15 11:14:55,752 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-15 11:14:55,752 INFO L272 TraceCheckUtils]: 39: Hoare triple {16216#true} call stubMoreProcessingRequired(); {16282#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:14:55,753 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-15 11:14:55,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-15 11:14:55,753 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16216#true} {16216#true} #452#return; {16216#true} is VALID [2022-04-15 11:14:55,753 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-15 11:14:55,753 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-15 11:14:55,753 INFO L290 TraceCheckUtils]: 45: Hoare triple {16216#true} assume !(1 == ~tmp_ndt_3~0); {16216#true} is VALID [2022-04-15 11:14:55,753 INFO L290 TraceCheckUtils]: 46: Hoare triple {16216#true} ~returnVal2~0 := 259; {16216#true} is VALID [2022-04-15 11:14:55,753 INFO L290 TraceCheckUtils]: 47: Hoare triple {16216#true} assume !(~s~0 == ~NP~0); {16216#true} is VALID [2022-04-15 11:14:55,753 INFO L290 TraceCheckUtils]: 48: Hoare triple {16216#true} assume ~s~0 == ~MPR1~0; {16216#true} is VALID [2022-04-15 11:14:55,753 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-15 11:14:55,753 INFO L290 TraceCheckUtils]: 50: Hoare triple {16253#(= ~MPR3~0 ~s~0)} #res := ~returnVal2~0; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 11:14:55,754 INFO L290 TraceCheckUtils]: 51: Hoare triple {16253#(= ~MPR3~0 ~s~0)} assume true; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 11:14:55,754 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16253#(= ~MPR3~0 ~s~0)} {16216#true} #470#return; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 11:14:55,755 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-15 11:14:55,755 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-15 11:14:55,755 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-15 11:14:55,756 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-15 11:14:55,756 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-15 11:14:55,756 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-15 11:14:55,756 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-15 11:14:55,757 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-15 11:14:55,757 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-15 11:14:55,757 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-15 11:14:55,757 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-15 11:14:55,758 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-15 11:14:55,758 INFO L290 TraceCheckUtils]: 65: Hoare triple {16217#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;havoc #t~ret13; {16217#false} is VALID [2022-04-15 11:14:55,758 INFO L290 TraceCheckUtils]: 66: Hoare triple {16217#false} assume ~status~0 >= 0; {16217#false} is VALID [2022-04-15 11:14:55,758 INFO L290 TraceCheckUtils]: 67: Hoare triple {16217#false} assume !(~myStatus~0 >= 0); {16217#false} is VALID [2022-04-15 11:14:55,758 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-15 11:14:55,758 INFO L272 TraceCheckUtils]: 69: Hoare triple {16217#false} call IofCompleteRequest(~Irp, 0); {16217#false} is VALID [2022-04-15 11:14:55,758 INFO L290 TraceCheckUtils]: 70: Hoare triple {16217#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {16217#false} is VALID [2022-04-15 11:14:55,758 INFO L290 TraceCheckUtils]: 71: Hoare triple {16217#false} assume !(~s~0 == ~NP~0); {16217#false} is VALID [2022-04-15 11:14:55,758 INFO L272 TraceCheckUtils]: 72: Hoare triple {16217#false} call errorFn(); {16217#false} is VALID [2022-04-15 11:14:55,758 INFO L290 TraceCheckUtils]: 73: Hoare triple {16217#false} assume !false; {16217#false} is VALID [2022-04-15 11:14:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:14:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:55,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697998698] [2022-04-15 11:14:55,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697998698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:55,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:55,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:14:55,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:55,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [727550094] [2022-04-15 11:14:55,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [727550094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:55,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:55,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:14:55,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735759911] [2022-04-15 11:14:55,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:55,760 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-15 11:14:55,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:55,760 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-15 11:14:55,798 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-15 11:14:55,798 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:14:55,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:55,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:14:55,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:14:55,799 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-15 11:14:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:56,257 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-15 11:14:56,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 11:14:56,257 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-15 11:14:56,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:56,258 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-15 11:14:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-15 11:14:56,259 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-15 11:14:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-15 11:14:56,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 78 transitions. [2022-04-15 11:14:56,317 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-15 11:14:56,317 INFO L225 Difference]: With dead ends: 133 [2022-04-15 11:14:56,317 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 11:14:56,318 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-15 11:14:56,318 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-15 11:14:56,318 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-15 11:14:56,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 11:14:56,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 11:14:56,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:56,319 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-15 11:14:56,319 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-15 11:14:56,319 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-15 11:14:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:56,319 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 11:14:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:14:56,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:56,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:56,319 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-15 11:14:56,319 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-15 11:14:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:56,320 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 11:14:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:14:56,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:56,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:56,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:56,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:56,320 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-15 11:14:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 11:14:56,320 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2022-04-15 11:14:56,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:56,320 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 11:14:56,320 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-15 11:14:56,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 11:14:56,320 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-15 11:14:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:14:56,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:56,322 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 11:14:56,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:14:56,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 11:15:02,917 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 11:15:02,917 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 11:15:02,917 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 11:15:02,918 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-15 11:15:02,918 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-15 11:15:02,918 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-15 11:15:02,918 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-15 11:15:02,918 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-15 11:15:02,918 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-15 11:15:02,918 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-15 11:15:02,918 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-15 11:15:02,918 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-15 11:15:02,919 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-15 11:15:02,919 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-15 11:15:02,919 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-15 11:15:02,919 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-15 11:15:02,919 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-15 11:15:02,919 INFO L885 garLoopResultBuilder]: At program point errorFnENTRY(lines 577 584) the Hoare annotation is: true [2022-04-15 11:15:02,919 INFO L885 garLoopResultBuilder]: At program point errorFnFINAL(lines 577 584) the Hoare annotation is: true [2022-04-15 11:15:02,919 INFO L885 garLoopResultBuilder]: At program point errorFnEXIT(lines 577 584) the Hoare annotation is: true [2022-04-15 11:15:02,919 INFO L885 garLoopResultBuilder]: At program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) the Hoare annotation is: true [2022-04-15 11:15:02,919 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 288 422) the Hoare annotation is: true [2022-04-15 11:15:02,920 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-15 11:15:02,920 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-15 11:15:02,920 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-15 11:15:02,920 INFO L885 garLoopResultBuilder]: At program point L409(lines 409 411) the Hoare annotation is: true [2022-04-15 11:15:02,920 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-15 11:15:02,920 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 288 422) the Hoare annotation is: true [2022-04-15 11:15:02,920 INFO L885 garLoopResultBuilder]: At program point L385(lines 369 418) the Hoare annotation is: true [2022-04-15 11:15:02,920 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-15 11:15:02,920 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-15 11:15:02,920 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-15 11:15:02,921 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-15 11:15:02,921 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-15 11:15:02,921 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-15 11:15:02,921 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-15 11:15:02,921 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-15 11:15:02,921 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-15 11:15:02,921 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-15 11:15:02,921 INFO L885 garLoopResultBuilder]: At program point L404(lines 404 412) the Hoare annotation is: true [2022-04-15 11:15:02,921 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-15 11:15:02,921 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-15 11:15:02,922 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-15 11:15:02,922 INFO L885 garLoopResultBuilder]: At program point L405(lines 405 407) the Hoare annotation is: true [2022-04-15 11:15:02,922 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-15 11:15:02,922 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-15 11:15:02,922 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-15 11:15:02,922 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-15 11:15:02,922 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-15 11:15:02,922 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-15 11:15:02,922 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-15 11:15:02,923 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-15 11:15:02,923 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-15 11:15:02,923 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-15 11:15:02,923 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-15 11:15:02,923 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-15 11:15:02,923 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-15 11:15:02,923 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-15 11:15:02,923 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-15 11:15:02,924 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-15 11:15:02,924 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-15 11:15:02,924 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-15 11:15:02,924 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-15 11:15:02,924 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-15 11:15:02,924 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-15 11:15:02,924 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-15 11:15:02,924 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-15 11:15:02,925 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-15 11:15:02,925 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-15 11:15:02,925 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-15 11:15:02,925 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-15 11:15:02,925 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-15 11:15:02,925 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-15 11:15:02,925 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-15 11:15:02,925 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-15 11:15:02,925 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-15 11:15:02,925 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-15 11:15:02,926 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-15 11:15:02,926 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-15 11:15:02,926 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-15 11:15:02,926 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-15 11:15:02,926 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-15 11:15:02,926 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-15 11:15:02,926 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-15 11:15:02,926 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-15 11:15:02,927 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-15 11:15:02,927 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-15 11:15:02,927 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-15 11:15:02,927 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-15 11:15:02,927 INFO L885 garLoopResultBuilder]: At program point L509-1(lines 501 514) the Hoare annotation is: true [2022-04-15 11:15:02,927 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-15 11:15:02,927 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-15 11:15:02,927 INFO L885 garLoopResultBuilder]: At program point IofCompleteRequestEXIT(lines 501 514) the Hoare annotation is: true [2022-04-15 11:15:02,927 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 11:15:02,927 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-15 11:15:02,927 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 11:15:02,927 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 11:15:02,928 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-15 11:15:02,928 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-15 11:15:02,928 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-15 11:15:02,928 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-15 11:15:02,928 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-15 11:15:02,928 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-15 11:15:02,928 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-15 11:15:02,928 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-15 11:15:02,929 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-15 11:15:02,929 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-15 11:15:02,929 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-15 11:15:02,929 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-15 11:15:02,929 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-15 11:15:02,929 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-15 11:15:02,929 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-15 11:15:02,929 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-15 11:15:02,929 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-15 11:15:02,929 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-15 11:15:02,930 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-15 11:15:02,930 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-15 11:15:02,930 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-15 11:15:02,930 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-15 11:15:02,930 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-15 11:15:02,930 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-15 11:15:02,930 INFO L885 garLoopResultBuilder]: At program point KbFilter_PnPEXIT(lines 75 287) the Hoare annotation is: true [2022-04-15 11:15:02,930 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-15 11:15:02,930 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-15 11:15:02,930 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-15 11:15:02,931 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-15 11:15:02,931 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-15 11:15:02,931 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-15 11:15:02,931 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-15 11:15:02,931 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-15 11:15:02,931 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-15 11:15:02,931 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-15 11:15:02,931 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-15 11:15:02,931 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-15 11:15:02,932 INFO L885 garLoopResultBuilder]: At program point KbFilter_PnPFINAL(lines 75 287) the Hoare annotation is: true [2022-04-15 11:15:02,932 INFO L885 garLoopResultBuilder]: At program point L262(lines 166 263) the Hoare annotation is: true [2022-04-15 11:15:02,932 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-15 11:15:02,932 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-15 11:15:02,932 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-15 11:15:02,932 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-15 11:15:02,932 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-15 11:15:02,932 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-15 11:15:02,932 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-15 11:15:02,932 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-15 11:15:02,933 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-15 11:15:02,933 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-15 11:15:02,933 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-15 11:15:02,933 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-15 11:15:02,933 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-15 11:15:02,933 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-15 11:15:02,933 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-15 11:15:02,933 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-15 11:15:02,933 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-15 11:15:02,933 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-15 11:15:02,936 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-15 11:15:02,936 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 11:15:02,938 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 11:15:02,947 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 11:15:03,099 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-15 11:15:03,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 11:15:03 BoogieIcfgContainer [2022-04-15 11:15:03,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 11:15:03,144 INFO L158 Benchmark]: Toolchain (without parser) took 31449.86ms. Allocated memory was 191.9MB in the beginning and 442.5MB in the end (delta: 250.6MB). Free memory was 141.6MB in the beginning and 416.3MB in the end (delta: -274.8MB). Peak memory consumption was 238.9MB. Max. memory is 8.0GB. [2022-04-15 11:15:03,145 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory was 158.2MB in the beginning and 158.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:15:03,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.34ms. Allocated memory is still 191.9MB. Free memory was 141.3MB in the beginning and 163.0MB in the end (delta: -21.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 11:15:03,145 INFO L158 Benchmark]: Boogie Preprocessor took 46.05ms. Allocated memory is still 191.9MB. Free memory was 163.0MB in the beginning and 160.4MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-15 11:15:03,145 INFO L158 Benchmark]: RCFGBuilder took 616.18ms. Allocated memory is still 191.9MB. Free memory was 160.4MB in the beginning and 133.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-04-15 11:15:03,145 INFO L158 Benchmark]: TraceAbstraction took 30550.70ms. Allocated memory was 191.9MB in the beginning and 442.5MB in the end (delta: 250.6MB). Free memory was 132.8MB in the beginning and 416.3MB in the end (delta: -283.6MB). Peak memory consumption was 231.6MB. Max. memory is 8.0GB. [2022-04-15 11:15:03,146 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 191.9MB. Free memory was 158.2MB in the beginning and 158.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.34ms. Allocated memory is still 191.9MB. Free memory was 141.3MB in the beginning and 163.0MB in the end (delta: -21.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.05ms. Allocated memory is still 191.9MB. Free memory was 163.0MB in the beginning and 160.4MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 616.18ms. Allocated memory is still 191.9MB. Free memory was 160.4MB in the beginning and 133.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 30550.70ms. Allocated memory was 191.9MB in the beginning and 442.5MB in the end (delta: 250.6MB). Free memory was 132.8MB in the beginning and 416.3MB in the end (delta: -283.6MB). Peak memory consumption was 231.6MB. 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.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3477 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3469 mSDsluCounter, 4456 SdHoareTripleChecker+Invalid, 4.5s 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.4s HoareSimplificationTime, 151 FomulaSimplificationsInter, 11576 FormulaSimplificationTreeSizeReductionInter, 5.8s 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-15 11:15:03,189 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...