/usr/bin/java -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_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-19 06:47:46,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 06:47:46,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 06:47:46,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 06:47:46,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 06:47:46,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 06:47:46,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 06:47:46,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 06:47:46,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 06:47:46,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 06:47:46,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 06:47:46,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 06:47:46,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 06:47:46,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 06:47:46,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 06:47:46,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 06:47:46,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 06:47:46,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 06:47:46,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 06:47:46,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 06:47:46,883 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 06:47:46,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 06:47:46,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 06:47:46,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 06:47:46,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 06:47:46,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 06:47:46,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 06:47:46,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 06:47:46,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 06:47:46,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 06:47:46,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 06:47:46,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 06:47:46,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 06:47:46,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 06:47:46,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 06:47:46,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 06:47:46,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 06:47:46,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 06:47:46,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 06:47:46,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 06:47:46,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 06:47:46,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 06:47:46,902 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-19 06:47:46,910 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 06:47:46,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 06:47:46,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 06:47:46,912 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 06:47:46,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 06:47:46,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 06:47:46,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 06:47:46,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 06:47:46,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 06:47:46,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 06:47:46,914 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 06:47:46,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 06:47:46,914 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 06:47:46,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 06:47:46,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 06:47:46,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 06:47:46,914 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-19 06:47:46,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 06:47:46,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 06:47:46,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 06:47:46,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-19 06:47:46,915 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-19 06:47:46,915 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-19 06:47:46,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 06:47:46,915 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-19 06:47:46,915 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-03-19 06:47:47,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 06:47:47,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 06:47:47,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 06:47:47,138 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 06:47:47,142 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 06:47:47,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-03-19 06:47:47,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc8eec14/67e30fc507254cf79524e6f20de7f3c7/FLAG47ac6b59e [2022-03-19 06:47:47,618 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 06:47:47,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-03-19 06:47:47,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc8eec14/67e30fc507254cf79524e6f20de7f3c7/FLAG47ac6b59e [2022-03-19 06:47:47,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc8eec14/67e30fc507254cf79524e6f20de7f3c7 [2022-03-19 06:47:47,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 06:47:47,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 06:47:48,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 06:47:48,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 06:47:48,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 06:47:48,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 06:47:47" (1/1) ... [2022-03-19 06:47:48,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce66e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:47:48, skipping insertion in model container [2022-03-19 06:47:48,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 06:47:47" (1/1) ... [2022-03-19 06:47:48,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 06:47:48,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 06:47:48,279 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_simpl2.cil-1.c[29620,29633] [2022-03-19 06:47:48,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 06:47:48,286 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 06:47:48,334 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_simpl2.cil-1.c[29620,29633] [2022-03-19 06:47:48,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 06:47:48,346 INFO L208 MainTranslator]: Completed translation [2022-03-19 06:47:48,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:47:48 WrapperNode [2022-03-19 06:47:48,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 06:47:48,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 06:47:48,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 06:47:48,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 06:47:48,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:47:48" (1/1) ... [2022-03-19 06:47:48,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:47:48" (1/1) ... [2022-03-19 06:47:48,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:47:48" (1/1) ... [2022-03-19 06:47:48,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:47:48" (1/1) ... [2022-03-19 06:47:48,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:47:48" (1/1) ... [2022-03-19 06:47:48,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:47:48" (1/1) ... [2022-03-19 06:47:48,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:47:48" (1/1) ... [2022-03-19 06:47:48,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 06:47:48,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 06:47:48,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 06:47:48,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 06:47:48,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:47:48" (1/1) ... [2022-03-19 06:47:48,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 06:47:48,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 06:47:48,450 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-03-19 06:47:48,455 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-03-19 06:47:48,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 06:47:48,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 06:47:48,484 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 06:47:48,484 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-03-19 06:47:48,484 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-03-19 06:47:48,484 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-03-19 06:47:48,485 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 06:47:48,485 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-03-19 06:47:48,486 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-03-19 06:47:48,486 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-03-19 06:47:48,486 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-03-19 06:47:48,487 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-03-19 06:47:48,487 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-03-19 06:47:48,487 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-03-19 06:47:48,487 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-03-19 06:47:48,487 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2022-03-19 06:47:48,488 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-03-19 06:47:48,488 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2022-03-19 06:47:48,488 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-03-19 06:47:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 06:47:48,490 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 06:47:48,491 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 06:47:48,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 06:47:48,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-19 06:47:48,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-19 06:47:48,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-03-19 06:47:48,491 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-03-19 06:47:48,491 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-03-19 06:47:48,491 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-03-19 06:47:48,491 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-03-19 06:47:48,491 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-03-19 06:47:48,491 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-03-19 06:47:48,491 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-03-19 06:47:48,491 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-03-19 06:47:48,491 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2022-03-19 06:47:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2022-03-19 06:47:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-03-19 06:47:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-03-19 06:47:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-03-19 06:47:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-03-19 06:47:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 06:47:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-03-19 06:47:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 06:47:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 06:47:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 06:47:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 06:47:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 06:47:48,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 06:47:48,596 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 06:47:48,597 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 06:47:48,678 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 06:47:48,783 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-03-19 06:47:48,783 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-03-19 06:47:48,789 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 06:47:48,824 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-03-19 06:47:48,824 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-03-19 06:47:48,877 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 06:47:48,889 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-03-19 06:47:48,890 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-03-19 06:47:48,895 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 06:47:48,969 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-03-19 06:47:48,969 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-03-19 06:47:48,975 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 06:47:49,002 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-03-19 06:47:49,003 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-03-19 06:47:49,013 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 06:47:49,041 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-03-19 06:47:49,041 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-03-19 06:47:49,062 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 06:47:49,069 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 06:47:49,069 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-19 06:47:49,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 06:47:49 BoogieIcfgContainer [2022-03-19 06:47:49,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 06:47:49,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 06:47:49,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 06:47:49,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 06:47:49,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 06:47:47" (1/3) ... [2022-03-19 06:47:49,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c17302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 06:47:49, skipping insertion in model container [2022-03-19 06:47:49,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:47:48" (2/3) ... [2022-03-19 06:47:49,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c17302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 06:47:49, skipping insertion in model container [2022-03-19 06:47:49,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 06:47:49" (3/3) ... [2022-03-19 06:47:49,078 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2022-03-19 06:47:49,082 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-19 06:47:49,082 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 06:47:49,114 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 06:47:49,119 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-03-19 06:47:49,120 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 06:47:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 182 states have (on average 1.5604395604395604) internal successors, (284), 199 states have internal predecessors, (284), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-03-19 06:47:49,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-19 06:47:49,141 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:49,142 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 06:47:49,142 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:49,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:49,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1606654013, now seen corresponding path program 1 times [2022-03-19 06:47:49,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:49,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1211976919] [2022-03-19 06:47:49,161 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:49,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1606654013, now seen corresponding path program 2 times [2022-03-19 06:47:49,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:49,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715407146] [2022-03-19 06:47:49,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:49,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:49,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:49,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:49,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715407146] [2022-03-19 06:47:49,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715407146] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:49,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:49,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 06:47:49,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:49,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1211976919] [2022-03-19 06:47:49,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1211976919] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:49,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:49,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 06:47:49,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774536026] [2022-03-19 06:47:49,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:49,521 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 06:47:49,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:49,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 06:47:49,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:47:49,556 INFO L87 Difference]: Start difference. First operand has 239 states, 182 states have (on average 1.5604395604395604) internal successors, (284), 199 states have internal predecessors, (284), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) 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-03-19 06:47:50,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:50,300 INFO L93 Difference]: Finished difference Result 415 states and 624 transitions. [2022-03-19 06:47:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 06:47:50,302 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-03-19 06:47:50,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:50,310 INFO L225 Difference]: With dead ends: 415 [2022-03-19 06:47:50,310 INFO L226 Difference]: Without dead ends: 256 [2022-03-19 06:47:50,314 INFO L911 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-03-19 06:47:50,316 INFO L912 BasicCegarLoop]: 296 mSDtfsCounter, 173 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:50,317 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 446 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-19 06:47:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-03-19 06:47:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2022-03-19 06:47:50,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 174 states have (on average 1.4942528735632183) internal successors, (260), 189 states have internal predecessors, (260), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-03-19 06:47:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2022-03-19 06:47:50,369 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2022-03-19 06:47:50,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:50,369 INFO L478 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2022-03-19 06:47:50,369 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-03-19 06:47:50,369 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2022-03-19 06:47:50,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-19 06:47:50,370 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:50,370 INFO L500 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] [2022-03-19 06:47:50,370 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 06:47:50,370 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:50,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:50,371 INFO L85 PathProgramCache]: Analyzing trace with hash -584418248, now seen corresponding path program 1 times [2022-03-19 06:47:50,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:50,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [885626866] [2022-03-19 06:47:50,372 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash -584418248, now seen corresponding path program 2 times [2022-03-19 06:47:50,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:50,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343588716] [2022-03-19 06:47:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:50,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:50,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:50,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:50,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:50,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:50,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343588716] [2022-03-19 06:47:50,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343588716] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:50,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:50,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 06:47:50,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:50,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [885626866] [2022-03-19 06:47:50,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [885626866] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:50,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:50,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 06:47:50,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030498066] [2022-03-19 06:47:50,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:50,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 06:47:50,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:50,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 06:47:50,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-19 06:47:50,532 INFO L87 Difference]: Start difference. First operand 228 states and 322 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, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-19 06:47:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:51,006 INFO L93 Difference]: Finished difference Result 401 states and 553 transitions. [2022-03-19 06:47:51,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 06:47:51,006 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, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-03-19 06:47:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:51,008 INFO L225 Difference]: With dead ends: 401 [2022-03-19 06:47:51,008 INFO L226 Difference]: Without dead ends: 343 [2022-03-19 06:47:51,009 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-19 06:47:51,010 INFO L912 BasicCegarLoop]: 352 mSDtfsCounter, 533 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:51,010 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 461 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-19 06:47:51,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-03-19 06:47:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 301. [2022-03-19 06:47:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 237 states have (on average 1.3924050632911393) internal successors, (330), 240 states have internal predecessors, (330), 37 states have call successors, (37), 23 states have call predecessors, (37), 26 states have return successors, (44), 40 states have call predecessors, (44), 29 states have call successors, (44) [2022-03-19 06:47:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2022-03-19 06:47:51,042 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 28 [2022-03-19 06:47:51,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:51,043 INFO L478 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2022-03-19 06:47:51,043 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, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-19 06:47:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2022-03-19 06:47:51,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-19 06:47:51,044 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:51,044 INFO L500 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] [2022-03-19 06:47:51,044 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 06:47:51,044 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:51,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:51,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1124228951, now seen corresponding path program 1 times [2022-03-19 06:47:51,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:51,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1614656592] [2022-03-19 06:47:51,045 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:51,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1124228951, now seen corresponding path program 2 times [2022-03-19 06:47:51,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:51,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899693556] [2022-03-19 06:47:51,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:51,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:51,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:51,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:51,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:51,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:51,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899693556] [2022-03-19 06:47:51,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899693556] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:51,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:51,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 06:47:51,154 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:51,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1614656592] [2022-03-19 06:47:51,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1614656592] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:51,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:51,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 06:47:51,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367557113] [2022-03-19 06:47:51,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:51,156 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 06:47:51,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:51,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 06:47:51,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-19 06:47:51,158 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 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-03-19 06:47:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:51,623 INFO L93 Difference]: Finished difference Result 478 states and 635 transitions. [2022-03-19 06:47:51,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 06:47:51,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 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 28 [2022-03-19 06:47:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:51,625 INFO L225 Difference]: With dead ends: 478 [2022-03-19 06:47:51,625 INFO L226 Difference]: Without dead ends: 362 [2022-03-19 06:47:51,626 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-19 06:47:51,627 INFO L912 BasicCegarLoop]: 263 mSDtfsCounter, 406 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:51,627 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 358 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-19 06:47:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-03-19 06:47:51,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2022-03-19 06:47:51,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 278 states have (on average 1.3848920863309353) internal successors, (385), 279 states have internal predecessors, (385), 33 states have call successors, (33), 23 states have call predecessors, (33), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-03-19 06:47:51,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2022-03-19 06:47:51,651 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 28 [2022-03-19 06:47:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:51,651 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2022-03-19 06:47:51,651 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 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-03-19 06:47:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2022-03-19 06:47:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-19 06:47:51,652 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:51,653 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 06:47:51,653 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-19 06:47:51,653 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:51,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash 512919532, now seen corresponding path program 1 times [2022-03-19 06:47:51,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:51,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1318028507] [2022-03-19 06:47:51,654 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash 512919532, now seen corresponding path program 2 times [2022-03-19 06:47:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:51,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778358069] [2022-03-19 06:47:51,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:51,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:51,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:51,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:51,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:51,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:51,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778358069] [2022-03-19 06:47:51,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778358069] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:51,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:51,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 06:47:51,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:51,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1318028507] [2022-03-19 06:47:51,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1318028507] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:51,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:51,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 06:47:51,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007857373] [2022-03-19 06:47:51,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:51,760 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 06:47:51,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:51,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 06:47:51,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-19 06:47:51,760 INFO L87 Difference]: Start difference. First operand 341 states and 462 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, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-19 06:47:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:52,163 INFO L93 Difference]: Finished difference Result 344 states and 464 transitions. [2022-03-19 06:47:52,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 06:47:52,163 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, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-03-19 06:47:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:52,166 INFO L225 Difference]: With dead ends: 344 [2022-03-19 06:47:52,166 INFO L226 Difference]: Without dead ends: 340 [2022-03-19 06:47:52,167 INFO L911 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-03-19 06:47:52,170 INFO L912 BasicCegarLoop]: 264 mSDtfsCounter, 341 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:52,172 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 413 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 06:47:52,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-03-19 06:47:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2022-03-19 06:47:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 278 states have (on average 1.3776978417266188) internal successors, (383), 278 states have internal predecessors, (383), 32 states have call successors, (32), 23 states have call predecessors, (32), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-03-19 06:47:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 459 transitions. [2022-03-19 06:47:52,201 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 459 transitions. Word has length 38 [2022-03-19 06:47:52,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:52,202 INFO L478 AbstractCegarLoop]: Abstraction has 340 states and 459 transitions. [2022-03-19 06:47:52,202 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, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-19 06:47:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2022-03-19 06:47:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-19 06:47:52,208 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:52,209 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 06:47:52,209 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 06:47:52,209 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:52,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:52,209 INFO L85 PathProgramCache]: Analyzing trace with hash 708737618, now seen corresponding path program 1 times [2022-03-19 06:47:52,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:52,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2124209568] [2022-03-19 06:47:52,210 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:52,210 INFO L85 PathProgramCache]: Analyzing trace with hash 708737618, now seen corresponding path program 2 times [2022-03-19 06:47:52,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:52,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475771695] [2022-03-19 06:47:52,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:52,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:52,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:52,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:52,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:52,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 06:47:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:52,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:52,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475771695] [2022-03-19 06:47:52,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475771695] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:52,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:52,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 06:47:52,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:52,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2124209568] [2022-03-19 06:47:52,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2124209568] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:52,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:52,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 06:47:52,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393984863] [2022-03-19 06:47:52,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:52,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 06:47:52,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:52,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 06:47:52,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-19 06:47:52,388 INFO L87 Difference]: Start difference. First operand 340 states and 459 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 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-03-19 06:47:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:52,744 INFO L93 Difference]: Finished difference Result 385 states and 508 transitions. [2022-03-19 06:47:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 06:47:52,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 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 46 [2022-03-19 06:47:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:52,746 INFO L225 Difference]: With dead ends: 385 [2022-03-19 06:47:52,746 INFO L226 Difference]: Without dead ends: 319 [2022-03-19 06:47:52,747 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-03-19 06:47:52,749 INFO L912 BasicCegarLoop]: 298 mSDtfsCounter, 597 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:52,749 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 518 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 06:47:52,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-03-19 06:47:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 301. [2022-03-19 06:47:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 244 states have (on average 1.3688524590163935) internal successors, (334), 244 states have internal predecessors, (334), 29 states have call successors, (29), 21 states have call predecessors, (29), 27 states have return successors, (39), 36 states have call predecessors, (39), 24 states have call successors, (39) [2022-03-19 06:47:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 402 transitions. [2022-03-19 06:47:52,815 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 402 transitions. Word has length 46 [2022-03-19 06:47:52,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:52,815 INFO L478 AbstractCegarLoop]: Abstraction has 301 states and 402 transitions. [2022-03-19 06:47:52,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 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-03-19 06:47:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 402 transitions. [2022-03-19 06:47:52,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-19 06:47:52,817 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:52,817 INFO L500 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-03-19 06:47:52,817 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-19 06:47:52,818 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:52,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:52,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1153649594, now seen corresponding path program 1 times [2022-03-19 06:47:52,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:52,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1381992376] [2022-03-19 06:47:52,819 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:52,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1153649594, now seen corresponding path program 2 times [2022-03-19 06:47:52,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:52,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713623604] [2022-03-19 06:47:52,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:52,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:52,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:52,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:52,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:53,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-19 06:47:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:53,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 06:47:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:53,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:53,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713623604] [2022-03-19 06:47:53,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713623604] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:53,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:53,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 06:47:53,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:53,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1381992376] [2022-03-19 06:47:53,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1381992376] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:53,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:53,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 06:47:53,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217787151] [2022-03-19 06:47:53,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:53,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 06:47:53,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:53,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 06:47:53,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-19 06:47:53,081 INFO L87 Difference]: Start difference. First operand 301 states and 402 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 06:47:54,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:54,126 INFO L93 Difference]: Finished difference Result 327 states and 430 transitions. [2022-03-19 06:47:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 06:47:54,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2022-03-19 06:47:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:54,128 INFO L225 Difference]: With dead ends: 327 [2022-03-19 06:47:54,128 INFO L226 Difference]: Without dead ends: 322 [2022-03-19 06:47:54,128 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-03-19 06:47:54,129 INFO L912 BasicCegarLoop]: 252 mSDtfsCounter, 761 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:54,129 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 553 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-19 06:47:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-03-19 06:47:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 315. [2022-03-19 06:47:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 256 states have (on average 1.359375) internal successors, (348), 255 states have internal predecessors, (348), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-03-19 06:47:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 418 transitions. [2022-03-19 06:47:54,159 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 418 transitions. Word has length 45 [2022-03-19 06:47:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:54,159 INFO L478 AbstractCegarLoop]: Abstraction has 315 states and 418 transitions. [2022-03-19 06:47:54,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 06:47:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 418 transitions. [2022-03-19 06:47:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-19 06:47:54,186 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:54,186 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 06:47:54,186 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-19 06:47:54,187 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:54,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:54,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1782707845, now seen corresponding path program 1 times [2022-03-19 06:47:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:54,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1013204865] [2022-03-19 06:47:54,188 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:54,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1782707845, now seen corresponding path program 2 times [2022-03-19 06:47:54,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:54,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165870449] [2022-03-19 06:47:54,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:54,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:54,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:54,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:54,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:54,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-19 06:47:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:54,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 06:47:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:54,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:54,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165870449] [2022-03-19 06:47:54,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165870449] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:54,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:54,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 06:47:54,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:54,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1013204865] [2022-03-19 06:47:54,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1013204865] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:54,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:54,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 06:47:54,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564491751] [2022-03-19 06:47:54,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:54,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 06:47:54,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:54,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 06:47:54,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-19 06:47:54,388 INFO L87 Difference]: Start difference. First operand 315 states and 418 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 06:47:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:55,296 INFO L93 Difference]: Finished difference Result 327 states and 429 transitions. [2022-03-19 06:47:55,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 06:47:55,297 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-03-19 06:47:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:55,300 INFO L225 Difference]: With dead ends: 327 [2022-03-19 06:47:55,300 INFO L226 Difference]: Without dead ends: 322 [2022-03-19 06:47:55,300 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-03-19 06:47:55,301 INFO L912 BasicCegarLoop]: 253 mSDtfsCounter, 1041 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:55,301 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1043 Valid, 660 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-19 06:47:55,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-03-19 06:47:55,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 316. [2022-03-19 06:47:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 257 states have (on average 1.3579766536964981) internal successors, (349), 256 states have internal predecessors, (349), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-03-19 06:47:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 419 transitions. [2022-03-19 06:47:55,336 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 419 transitions. Word has length 46 [2022-03-19 06:47:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:55,336 INFO L478 AbstractCegarLoop]: Abstraction has 316 states and 419 transitions. [2022-03-19 06:47:55,336 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 06:47:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 419 transitions. [2022-03-19 06:47:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-19 06:47:55,337 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:55,337 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 06:47:55,338 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-19 06:47:55,338 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:55,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash 359403676, now seen corresponding path program 1 times [2022-03-19 06:47:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:55,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1218213642] [2022-03-19 06:47:55,338 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash 359403676, now seen corresponding path program 2 times [2022-03-19 06:47:55,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:55,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549759738] [2022-03-19 06:47:55,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:55,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:55,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:55,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:55,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:55,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-19 06:47:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 06:47:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:55,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:55,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549759738] [2022-03-19 06:47:55,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549759738] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:55,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:55,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 06:47:55,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:55,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1218213642] [2022-03-19 06:47:55,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1218213642] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:55,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:55,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 06:47:55,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319331030] [2022-03-19 06:47:55,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:55,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 06:47:55,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:55,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 06:47:55,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-19 06:47:55,468 INFO L87 Difference]: Start difference. First operand 316 states and 419 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, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 06:47:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:55,789 INFO L93 Difference]: Finished difference Result 330 states and 436 transitions. [2022-03-19 06:47:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 06:47:55,790 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, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-03-19 06:47:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:55,793 INFO L225 Difference]: With dead ends: 330 [2022-03-19 06:47:55,793 INFO L226 Difference]: Without dead ends: 102 [2022-03-19 06:47:55,794 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-03-19 06:47:55,794 INFO L912 BasicCegarLoop]: 247 mSDtfsCounter, 579 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:55,794 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 353 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:47:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-03-19 06:47:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-03-19 06:47:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 15 states have call successors, (15), 13 states have call predecessors, (15), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-19 06:47:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2022-03-19 06:47:55,806 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 47 [2022-03-19 06:47:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:55,806 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2022-03-19 06:47:55,806 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, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 06:47:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-03-19 06:47:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-03-19 06:47:55,807 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:55,807 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 06:47:55,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-19 06:47:55,807 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:55,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:55,807 INFO L85 PathProgramCache]: Analyzing trace with hash -803867800, now seen corresponding path program 1 times [2022-03-19 06:47:55,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:55,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1918344313] [2022-03-19 06:47:55,808 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:55,808 INFO L85 PathProgramCache]: Analyzing trace with hash -803867800, now seen corresponding path program 2 times [2022-03-19 06:47:55,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:55,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825792111] [2022-03-19 06:47:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:55,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:55,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:55,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:55,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-03-19 06:47:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:55,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 06:47:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-03-19 06:47:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:55,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:55,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825792111] [2022-03-19 06:47:55,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825792111] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:55,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:55,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 06:47:55,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:55,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1918344313] [2022-03-19 06:47:55,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1918344313] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:55,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:55,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 06:47:55,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985102571] [2022-03-19 06:47:55,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:55,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 06:47:55,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:55,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 06:47:55,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-19 06:47:55,962 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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-03-19 06:47:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:56,201 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2022-03-19 06:47:56,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 06:47:56,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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 53 [2022-03-19 06:47:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:56,203 INFO L225 Difference]: With dead ends: 130 [2022-03-19 06:47:56,203 INFO L226 Difference]: Without dead ends: 100 [2022-03-19 06:47:56,204 INFO L911 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-03-19 06:47:56,204 INFO L912 BasicCegarLoop]: 84 mSDtfsCounter, 74 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:56,204 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 218 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:47:56,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-03-19 06:47:56,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-03-19 06:47:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 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-03-19 06:47:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-03-19 06:47:56,213 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2022-03-19 06:47:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:56,214 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-03-19 06:47:56,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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-03-19 06:47:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-03-19 06:47:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-19 06:47:56,214 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:56,214 INFO L500 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] [2022-03-19 06:47:56,214 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-19 06:47:56,214 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:56,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1055877385, now seen corresponding path program 1 times [2022-03-19 06:47:56,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:56,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2140532719] [2022-03-19 06:47:56,221 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1055877385, now seen corresponding path program 2 times [2022-03-19 06:47:56,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:56,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711039406] [2022-03-19 06:47:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:56,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:56,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:56,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:56,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 06:47:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:56,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 06:47:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:56,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 06:47:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:56,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:56,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711039406] [2022-03-19 06:47:56,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711039406] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:56,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:56,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-19 06:47:56,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:56,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2140532719] [2022-03-19 06:47:56,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2140532719] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:56,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:56,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-19 06:47:56,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860959997] [2022-03-19 06:47:56,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:56,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-19 06:47:56,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:56,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-19 06:47:56,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-19 06:47:56,422 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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-03-19 06:47:56,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:56,729 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2022-03-19 06:47:56,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 06:47:56,729 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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 57 [2022-03-19 06:47:56,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:56,730 INFO L225 Difference]: With dead ends: 152 [2022-03-19 06:47:56,730 INFO L226 Difference]: Without dead ends: 111 [2022-03-19 06:47:56,730 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-03-19 06:47:56,730 INFO L912 BasicCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:56,731 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 353 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 06:47:56,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-03-19 06:47:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2022-03-19 06:47:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.1875) internal successors, (95), 81 states have internal predecessors, (95), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-03-19 06:47:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-03-19 06:47:56,741 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2022-03-19 06:47:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:56,741 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-03-19 06:47:56,741 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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-03-19 06:47:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-03-19 06:47:56,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-19 06:47:56,742 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:56,742 INFO L500 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] [2022-03-19 06:47:56,742 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-19 06:47:56,742 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:56,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:56,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1324274632, now seen corresponding path program 1 times [2022-03-19 06:47:56,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:56,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1693968710] [2022-03-19 06:47:56,742 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:56,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1324274632, now seen corresponding path program 2 times [2022-03-19 06:47:56,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:56,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555250138] [2022-03-19 06:47:56,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:56,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:56,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:56,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:56,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:56,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 06:47:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:56,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 06:47:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:56,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 06:47:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:56,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:56,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555250138] [2022-03-19 06:47:56,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555250138] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:56,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:56,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-19 06:47:56,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:56,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1693968710] [2022-03-19 06:47:56,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1693968710] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:56,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:56,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-19 06:47:56,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042245182] [2022-03-19 06:47:56,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:56,895 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-19 06:47:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:56,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-19 06:47:56,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-19 06:47:56,895 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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-03-19 06:47:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:57,139 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-03-19 06:47:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-19 06:47:57,140 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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 57 [2022-03-19 06:47:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:57,140 INFO L225 Difference]: With dead ends: 116 [2022-03-19 06:47:57,141 INFO L226 Difference]: Without dead ends: 109 [2022-03-19 06:47:57,141 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-03-19 06:47:57,141 INFO L912 BasicCegarLoop]: 76 mSDtfsCounter, 59 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:57,142 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 316 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:47:57,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-19 06:47:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2022-03-19 06:47:57,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 82 states have internal predecessors, (96), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-03-19 06:47:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2022-03-19 06:47:57,154 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2022-03-19 06:47:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:57,154 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2022-03-19 06:47:57,154 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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-03-19 06:47:57,154 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2022-03-19 06:47:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-19 06:47:57,155 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:57,155 INFO L500 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] [2022-03-19 06:47:57,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-19 06:47:57,155 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:57,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2097337179, now seen corresponding path program 1 times [2022-03-19 06:47:57,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:57,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1188253695] [2022-03-19 06:47:57,156 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:57,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2097337179, now seen corresponding path program 2 times [2022-03-19 06:47:57,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:57,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346569049] [2022-03-19 06:47:57,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:57,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 06:47:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 06:47:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 06:47:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:57,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:57,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346569049] [2022-03-19 06:47:57,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346569049] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:57,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:57,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-19 06:47:57,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:57,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1188253695] [2022-03-19 06:47:57,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1188253695] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:57,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:57,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-19 06:47:57,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844491160] [2022-03-19 06:47:57,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:57,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 06:47:57,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:57,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 06:47:57,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-19 06:47:57,308 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-19 06:47:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:57,482 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2022-03-19 06:47:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 06:47:57,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-03-19 06:47:57,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:57,483 INFO L225 Difference]: With dead ends: 142 [2022-03-19 06:47:57,483 INFO L226 Difference]: Without dead ends: 100 [2022-03-19 06:47:57,484 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-19 06:47:57,484 INFO L912 BasicCegarLoop]: 78 mSDtfsCounter, 41 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:57,485 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 289 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:47:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-03-19 06:47:57,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-03-19 06:47:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.16) internal successors, (87), 76 states have internal predecessors, (87), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-03-19 06:47:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2022-03-19 06:47:57,496 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 58 [2022-03-19 06:47:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:57,496 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2022-03-19 06:47:57,496 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-19 06:47:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-03-19 06:47:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-03-19 06:47:57,497 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:57,497 INFO L500 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-03-19 06:47:57,497 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-19 06:47:57,497 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:57,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:57,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1424142412, now seen corresponding path program 1 times [2022-03-19 06:47:57,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:57,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1474478626] [2022-03-19 06:47:57,498 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:57,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1424142412, now seen corresponding path program 2 times [2022-03-19 06:47:57,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:57,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800035901] [2022-03-19 06:47:57,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:57,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 06:47:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 06:47:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 06:47:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 06:47:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:57,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:57,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800035901] [2022-03-19 06:47:57,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800035901] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:57,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:57,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 06:47:57,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:57,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1474478626] [2022-03-19 06:47:57,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1474478626] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:57,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:57,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 06:47:57,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884427771] [2022-03-19 06:47:57,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:57,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 06:47:57,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:57,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 06:47:57,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-19 06:47:57,682 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 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-03-19 06:47:57,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:57,986 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2022-03-19 06:47:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-19 06:47:57,986 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 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 62 [2022-03-19 06:47:57,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:57,987 INFO L225 Difference]: With dead ends: 128 [2022-03-19 06:47:57,987 INFO L226 Difference]: Without dead ends: 92 [2022-03-19 06:47:57,988 INFO L911 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-03-19 06:47:57,988 INFO L912 BasicCegarLoop]: 70 mSDtfsCounter, 152 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:57,988 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 234 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:47:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-03-19 06:47:57,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-03-19 06:47:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 69 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-03-19 06:47:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-03-19 06:47:58,000 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 62 [2022-03-19 06:47:58,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:58,000 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-03-19 06:47:58,000 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 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-03-19 06:47:58,000 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-03-19 06:47:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-19 06:47:58,001 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:58,001 INFO L500 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] [2022-03-19 06:47:58,001 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-19 06:47:58,001 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:58,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:58,001 INFO L85 PathProgramCache]: Analyzing trace with hash -119468725, now seen corresponding path program 1 times [2022-03-19 06:47:58,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:58,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [961002265] [2022-03-19 06:47:58,002 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:58,002 INFO L85 PathProgramCache]: Analyzing trace with hash -119468725, now seen corresponding path program 2 times [2022-03-19 06:47:58,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:58,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940455671] [2022-03-19 06:47:58,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:58,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 06:47:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 06:47:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 06:47:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 06:47:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:58,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:58,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940455671] [2022-03-19 06:47:58,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940455671] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:58,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:58,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-19 06:47:58,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:58,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [961002265] [2022-03-19 06:47:58,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [961002265] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:58,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:58,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-19 06:47:58,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925802456] [2022-03-19 06:47:58,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:58,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-19 06:47:58,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:58,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-19 06:47:58,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-19 06:47:58,140 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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-03-19 06:47:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:58,272 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2022-03-19 06:47:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 06:47:58,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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 64 [2022-03-19 06:47:58,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:58,273 INFO L225 Difference]: With dead ends: 126 [2022-03-19 06:47:58,273 INFO L226 Difference]: Without dead ends: 98 [2022-03-19 06:47:58,274 INFO L911 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-03-19 06:47:58,274 INFO L912 BasicCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:58,274 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 219 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:47:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-03-19 06:47:58,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2022-03-19 06:47:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 72 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-03-19 06:47:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2022-03-19 06:47:58,286 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 64 [2022-03-19 06:47:58,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:58,286 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2022-03-19 06:47:58,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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-03-19 06:47:58,286 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-03-19 06:47:58,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-19 06:47:58,287 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:58,287 INFO L500 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] [2022-03-19 06:47:58,287 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-19 06:47:58,287 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:58,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:58,287 INFO L85 PathProgramCache]: Analyzing trace with hash -706274739, now seen corresponding path program 1 times [2022-03-19 06:47:58,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:58,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [263042410] [2022-03-19 06:47:58,288 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:58,288 INFO L85 PathProgramCache]: Analyzing trace with hash -706274739, now seen corresponding path program 2 times [2022-03-19 06:47:58,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:58,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056192967] [2022-03-19 06:47:58,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 06:47:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 06:47:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 06:47:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 06:47:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:58,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:58,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056192967] [2022-03-19 06:47:58,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056192967] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:58,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:58,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-19 06:47:58,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:58,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [263042410] [2022-03-19 06:47:58,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [263042410] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:58,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:58,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-19 06:47:58,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000375674] [2022-03-19 06:47:58,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:58,409 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-19 06:47:58,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:58,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-19 06:47:58,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-19 06:47:58,410 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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-03-19 06:47:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:58,574 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-03-19 06:47:58,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 06:47:58,574 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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 64 [2022-03-19 06:47:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:58,575 INFO L225 Difference]: With dead ends: 111 [2022-03-19 06:47:58,575 INFO L226 Difference]: Without dead ends: 106 [2022-03-19 06:47:58,575 INFO L911 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-03-19 06:47:58,576 INFO L912 BasicCegarLoop]: 84 mSDtfsCounter, 79 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:58,576 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 204 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:47:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-03-19 06:47:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2022-03-19 06:47:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 74 states have internal predecessors, (82), 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-03-19 06:47:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-03-19 06:47:58,589 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 64 [2022-03-19 06:47:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:58,589 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-03-19 06:47:58,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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-03-19 06:47:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-03-19 06:47:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-19 06:47:58,590 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:58,590 INFO L500 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] [2022-03-19 06:47:58,590 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-19 06:47:58,590 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:58,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash -348732964, now seen corresponding path program 1 times [2022-03-19 06:47:58,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:58,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [889835958] [2022-03-19 06:47:58,591 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash -348732964, now seen corresponding path program 2 times [2022-03-19 06:47:58,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:58,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284333871] [2022-03-19 06:47:58,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:58,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 06:47:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 06:47:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 06:47:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 06:47:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:58,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:58,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284333871] [2022-03-19 06:47:58,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284333871] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:58,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:58,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 06:47:58,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:58,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [889835958] [2022-03-19 06:47:58,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [889835958] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:58,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:58,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 06:47:58,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50861525] [2022-03-19 06:47:58,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:58,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 06:47:58,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:58,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 06:47:58,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-19 06:47:58,765 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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-03-19 06:47:58,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:58,931 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-03-19 06:47:58,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-19 06:47:58,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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 64 [2022-03-19 06:47:58,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:58,933 INFO L225 Difference]: With dead ends: 110 [2022-03-19 06:47:58,933 INFO L226 Difference]: Without dead ends: 103 [2022-03-19 06:47:58,934 INFO L911 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-03-19 06:47:58,935 INFO L912 BasicCegarLoop]: 77 mSDtfsCounter, 109 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:58,935 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 353 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:47:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-03-19 06:47:58,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2022-03-19 06:47:58,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 74 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-03-19 06:47:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-03-19 06:47:58,948 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 64 [2022-03-19 06:47:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:58,948 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-03-19 06:47:58,948 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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-03-19 06:47:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-03-19 06:47:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-19 06:47:58,949 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:58,949 INFO L500 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] [2022-03-19 06:47:58,949 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-19 06:47:58,949 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:58,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:58,949 INFO L85 PathProgramCache]: Analyzing trace with hash -657469950, now seen corresponding path program 1 times [2022-03-19 06:47:58,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:58,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [191777064] [2022-03-19 06:47:58,949 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:58,950 INFO L85 PathProgramCache]: Analyzing trace with hash -657469950, now seen corresponding path program 2 times [2022-03-19 06:47:58,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:58,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130908848] [2022-03-19 06:47:58,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:58,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 06:47:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 06:47:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 06:47:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 06:47:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:59,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:59,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130908848] [2022-03-19 06:47:59,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130908848] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:59,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:59,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 06:47:59,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:59,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [191777064] [2022-03-19 06:47:59,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [191777064] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:59,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:59,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 06:47:59,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713732540] [2022-03-19 06:47:59,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:59,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 06:47:59,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:59,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 06:47:59,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-19 06:47:59,136 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-19 06:47:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:59,462 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-03-19 06:47:59,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 06:47:59,462 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-03-19 06:47:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:59,463 INFO L225 Difference]: With dead ends: 100 [2022-03-19 06:47:59,463 INFO L226 Difference]: Without dead ends: 82 [2022-03-19 06:47:59,463 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-03-19 06:47:59,464 INFO L912 BasicCegarLoop]: 66 mSDtfsCounter, 182 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:59,464 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 200 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:47:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-03-19 06:47:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-03-19 06:47:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.1) internal successors, (66), 61 states have internal predecessors, (66), 13 states have call successors, (13), 12 states have call predecessors, (13), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-03-19 06:47:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-03-19 06:47:59,473 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2022-03-19 06:47:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:59,473 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-03-19 06:47:59,473 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-19 06:47:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-03-19 06:47:59,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-19 06:47:59,474 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:59,474 INFO L500 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] [2022-03-19 06:47:59,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-19 06:47:59,474 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:59,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:59,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1066121988, now seen corresponding path program 1 times [2022-03-19 06:47:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:59,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [220628820] [2022-03-19 06:47:59,474 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:59,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1066121988, now seen corresponding path program 2 times [2022-03-19 06:47:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:59,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625670025] [2022-03-19 06:47:59,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:59,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 06:47:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 06:47:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 06:47:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 06:47:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:59,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:59,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625670025] [2022-03-19 06:47:59,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625670025] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:59,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:59,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-19 06:47:59,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:59,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [220628820] [2022-03-19 06:47:59,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [220628820] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:59,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:59,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-19 06:47:59,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168537491] [2022-03-19 06:47:59,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:59,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-19 06:47:59,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:59,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-19 06:47:59,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-19 06:47:59,593 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 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-03-19 06:47:59,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:47:59,748 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-03-19 06:47:59,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 06:47:59,748 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 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 65 [2022-03-19 06:47:59,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:47:59,749 INFO L225 Difference]: With dead ends: 98 [2022-03-19 06:47:59,749 INFO L226 Difference]: Without dead ends: 78 [2022-03-19 06:47:59,749 INFO L911 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-03-19 06:47:59,749 INFO L912 BasicCegarLoop]: 68 mSDtfsCounter, 70 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:47:59,750 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 194 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:47:59,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-03-19 06:47:59,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-03-19 06:47:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 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-03-19 06:47:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-03-19 06:47:59,759 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2022-03-19 06:47:59,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:47:59,759 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-03-19 06:47:59,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 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-03-19 06:47:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-03-19 06:47:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-19 06:47:59,760 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:47:59,760 INFO L500 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] [2022-03-19 06:47:59,760 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-19 06:47:59,760 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:47:59,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:47:59,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1874002193, now seen corresponding path program 1 times [2022-03-19 06:47:59,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:59,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [128398246] [2022-03-19 06:47:59,761 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:47:59,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1874002193, now seen corresponding path program 2 times [2022-03-19 06:47:59,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:47:59,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143970981] [2022-03-19 06:47:59,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:47:59,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:47:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:47:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:47:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:47:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 06:47:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 06:47:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 06:47:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 06:47:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:47:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:47:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:47:59,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143970981] [2022-03-19 06:47:59,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143970981] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:59,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:59,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 06:47:59,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:47:59,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [128398246] [2022-03-19 06:47:59,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [128398246] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:47:59,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:47:59,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 06:47:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366052432] [2022-03-19 06:47:59,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:47:59,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 06:47:59,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:47:59,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 06:47:59,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-19 06:47:59,915 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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-03-19 06:48:00,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:00,050 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-03-19 06:48:00,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-19 06:48:00,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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 65 [2022-03-19 06:48:00,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:00,051 INFO L225 Difference]: With dead ends: 87 [2022-03-19 06:48:00,051 INFO L226 Difference]: Without dead ends: 78 [2022-03-19 06:48:00,051 INFO L911 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-03-19 06:48:00,052 INFO L912 BasicCegarLoop]: 65 mSDtfsCounter, 77 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:00,052 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 258 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:48:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-03-19 06:48:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-03-19 06:48:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 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-03-19 06:48:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-03-19 06:48:00,060 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2022-03-19 06:48:00,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:00,060 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-03-19 06:48:00,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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-03-19 06:48:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-03-19 06:48:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-19 06:48:00,061 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:00,061 INFO L500 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, 1, 1] [2022-03-19 06:48:00,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-19 06:48:00,061 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:00,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:00,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2045810187, now seen corresponding path program 1 times [2022-03-19 06:48:00,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:00,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1246317402] [2022-03-19 06:48:00,062 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2045810187, now seen corresponding path program 2 times [2022-03-19 06:48:00,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:00,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445861282] [2022-03-19 06:48:00,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:00,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:00,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:00,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 06:48:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:00,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 06:48:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:00,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 06:48:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:00,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 06:48:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:00,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 06:48:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:00,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 06:48:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:00,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-03-19 06:48:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:00,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-03-19 06:48:00,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:00,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445861282] [2022-03-19 06:48:00,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445861282] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:00,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:00,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-19 06:48:00,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:00,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1246317402] [2022-03-19 06:48:00,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1246317402] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:00,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:00,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-19 06:48:00,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340067306] [2022-03-19 06:48:00,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:00,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-19 06:48:00,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:00,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-19 06:48:00,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-03-19 06:48:00,253 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 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-03-19 06:48:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:00,404 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-03-19 06:48:00,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 06:48:00,405 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 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 76 [2022-03-19 06:48:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:00,405 INFO L225 Difference]: With dead ends: 78 [2022-03-19 06:48:00,405 INFO L226 Difference]: Without dead ends: 0 [2022-03-19 06:48:00,405 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-03-19 06:48:00,406 INFO L912 BasicCegarLoop]: 53 mSDtfsCounter, 31 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:00,406 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 187 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:48:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-19 06:48:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-19 06:48:00,407 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-03-19 06:48:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-19 06:48:00,407 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2022-03-19 06:48:00,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:00,407 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-19 06:48:00,407 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 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-03-19 06:48:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-19 06:48:00,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-19 06:48:00,409 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-19 06:48:00,410 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-19 06:48:00,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-19 06:48:09,374 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-03-19 06:48:09,374 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-03-19 06:48:09,374 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-03-19 06:48:09,375 INFO L878 garLoopResultBuilder]: At program point L624(line 624) the Hoare annotation is: (or (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-03-19 06:48:09,375 INFO L878 garLoopResultBuilder]: At program point KbFilter_CompleteENTRY(lines 618 628) the Hoare annotation is: (or (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-03-19 06:48:09,375 INFO L878 garLoopResultBuilder]: At program point L624-1(line 624) the Hoare annotation is: (or (= ~setEventCalled~0 1) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-03-19 06:48:09,375 INFO L878 garLoopResultBuilder]: At program point KbFilter_CompleteFINAL(lines 618 628) the Hoare annotation is: (or (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (let ((.cse0 (+ 1073741802 |KbFilter_Complete_#res|))) (and (<= .cse0 0) (= ~setEventCalled~0 1) (<= 0 .cse0))) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-03-19 06:48:09,375 INFO L878 garLoopResultBuilder]: At program point KbFilter_CompleteEXIT(lines 618 628) the Hoare annotation is: (or (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (let ((.cse0 (+ 1073741802 |KbFilter_Complete_#res|))) (and (<= .cse0 0) (= ~setEventCalled~0 1) (<= 0 .cse0))) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-03-19 06:48:09,375 INFO L878 garLoopResultBuilder]: At program point _BLAST_initFINAL(lines 57 78) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (and (<= 6 ~MPR3~0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,377 INFO L878 garLoopResultBuilder]: At program point _BLAST_initENTRY(lines 57 78) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= ~s~0 ~DC~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~s~0 ~NP~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,377 INFO L878 garLoopResultBuilder]: At program point _BLAST_initEXIT(lines 57 78) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (and (<= 6 ~MPR3~0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,377 INFO L878 garLoopResultBuilder]: At program point L415(lines 415 419) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= ~s~0 ~NP~0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,377 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 295 466) the Hoare annotation is: true [2022-03-19 06:48:09,377 INFO L878 garLoopResultBuilder]: At program point L374(lines 373 408) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,377 INFO L878 garLoopResultBuilder]: At program point L432(lines 432 459) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,377 INFO L878 garLoopResultBuilder]: At program point L358(lines 358 411) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,378 INFO L885 garLoopResultBuilder]: At program point L449(lines 449 457) the Hoare annotation is: true [2022-03-19 06:48:09,378 INFO L878 garLoopResultBuilder]: At program point L441(lines 432 459) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,378 INFO L878 garLoopResultBuilder]: At program point L433(lines 433 439) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,378 INFO L878 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,378 INFO L878 garLoopResultBuilder]: At program point L359(lines 358 411) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,378 INFO L885 garLoopResultBuilder]: At program point L450(lines 450 452) the Hoare annotation is: true [2022-03-19 06:48:09,378 INFO L878 garLoopResultBuilder]: At program point L376(lines 375 408) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= main_~status~1 0) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,378 INFO L878 garLoopResultBuilder]: At program point L434(lines 434 436) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,378 INFO L878 garLoopResultBuilder]: At program point L368(lines 368 409) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,378 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 295 466) the Hoare annotation is: true [2022-03-19 06:48:09,378 INFO L878 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,379 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 295 466) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= |old(~Executive~0)| ~Executive~0) (<= ~s~0 ~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)|) (= ~pended~0 |old(~pended~0)|) (= ~s~0 ~NP~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~DevicePowerState~0)| ~DevicePowerState~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,379 INFO L878 garLoopResultBuilder]: At program point L443(lines 443 447) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,379 INFO L878 garLoopResultBuilder]: At program point L344(lines 330 413) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,379 INFO L878 garLoopResultBuilder]: At program point L369(lines 368 409) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,379 INFO L878 garLoopResultBuilder]: At program point L328(line 328) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (<= ~s~0 ~DC~0) (= main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,379 INFO L878 garLoopResultBuilder]: At program point L328-1(lines 324 465) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,379 INFO L878 garLoopResultBuilder]: At program point L353(lines 353 412) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,379 INFO L878 garLoopResultBuilder]: At program point L395(line 395) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,379 INFO L878 garLoopResultBuilder]: At program point L354(lines 353 412) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,379 INFO L878 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,380 INFO L878 garLoopResultBuilder]: At program point L429(lines 422 462) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,380 INFO L878 garLoopResultBuilder]: At program point L363(lines 363 410) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,380 INFO L878 garLoopResultBuilder]: At program point L330(lines 324 465) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,380 INFO L885 garLoopResultBuilder]: At program point L454(lines 454 456) the Hoare annotation is: true [2022-03-19 06:48:09,380 INFO L878 garLoopResultBuilder]: At program point L421(lines 414 463) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,380 INFO L878 garLoopResultBuilder]: At program point L380(line 380) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,380 INFO L878 garLoopResultBuilder]: At program point L339(lines 339 342) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,380 INFO L878 garLoopResultBuilder]: At program point L339-2(lines 339 342) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,380 INFO L885 garLoopResultBuilder]: At program point L430(lines 414 463) the Hoare annotation is: true [2022-03-19 06:48:09,380 INFO L878 garLoopResultBuilder]: At program point L364(lines 363 410) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,380 INFO L878 garLoopResultBuilder]: At program point L373(lines 373 408) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,381 INFO L878 garLoopResultBuilder]: At program point L431(lines 431 460) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,381 INFO L878 garLoopResultBuilder]: At program point L423(lines 423 427) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,381 INFO L878 garLoopResultBuilder]: At program point L390(line 390) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (let ((.cse0 (= main_~status~1 0))) (or (and (= ~compRegistered~0 1) .cse0) (and .cse0 (<= ~compRegistered~0 0)))) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-19 06:48:09,381 INFO L878 garLoopResultBuilder]: At program point L475(line 475) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1))) [2022-03-19 06:48:09,381 INFO L878 garLoopResultBuilder]: At program point L475-1(lines 467 480) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (= ~MPR1~0 ~s~0) (not (= ~compRegistered~0 1))) [2022-03-19 06:48:09,381 INFO L878 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 467 480) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (= ~s~0 |old(~s~0)|) (not (= ~compRegistered~0 1))) [2022-03-19 06:48:09,381 INFO L878 garLoopResultBuilder]: At program point stubMoreProcessingRequiredEXIT(lines 467 480) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (= ~MPR1~0 ~s~0) (not (= ~compRegistered~0 1))) [2022-03-19 06:48:09,381 INFO L878 garLoopResultBuilder]: At program point L762(line 762) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,381 INFO L885 garLoopResultBuilder]: At program point PoCallDriverEXIT(lines 745 821) the Hoare annotation is: true [2022-03-19 06:48:09,381 INFO L878 garLoopResultBuilder]: At program point L754(lines 754 766) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,381 INFO L878 garLoopResultBuilder]: At program point L754-1(lines 754 766) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,382 INFO L878 garLoopResultBuilder]: At program point L775(lines 774 791) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,382 INFO L878 garLoopResultBuilder]: At program point L800(lines 800 806) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,382 INFO L885 garLoopResultBuilder]: At program point PoCallDriverFINAL(lines 745 821) the Hoare annotation is: true [2022-03-19 06:48:09,382 INFO L878 garLoopResultBuilder]: At program point PoCallDriverENTRY(lines 745 821) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,382 INFO L878 garLoopResultBuilder]: At program point L809(lines 809 816) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,382 INFO L878 garLoopResultBuilder]: At program point L797(lines 797 817) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,382 INFO L878 garLoopResultBuilder]: At program point L760(lines 760 764) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,382 INFO L878 garLoopResultBuilder]: At program point L789(lines 753 820) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,382 INFO L878 garLoopResultBuilder]: At program point L756(line 756) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,382 INFO L878 garLoopResultBuilder]: At program point L756-1(line 756) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,382 INFO L878 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,382 INFO L885 garLoopResultBuilder]: At program point L814-1(lines 793 818) the Hoare annotation is: true [2022-03-19 06:48:09,382 INFO L878 garLoopResultBuilder]: At program point L777(lines 776 791) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,383 INFO L878 garLoopResultBuilder]: At program point L769(lines 769 792) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,383 INFO L878 garLoopResultBuilder]: At program point L774(lines 774 791) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,383 INFO L878 garLoopResultBuilder]: At program point L770(lines 769 792) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,383 INFO L878 garLoopResultBuilder]: At program point L638(lines 638 656) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,383 INFO L885 garLoopResultBuilder]: At program point KbFilter_CreateCloseEXIT(lines 629 664) the Hoare annotation is: true [2022-03-19 06:48:09,383 INFO L878 garLoopResultBuilder]: At program point L653(lines 641 655) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,383 INFO L878 garLoopResultBuilder]: At program point L645(lines 638 656) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,383 INFO L878 garLoopResultBuilder]: At program point L641(lines 641 655) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,383 INFO L878 garLoopResultBuilder]: At program point KbFilter_CreateCloseENTRY(lines 629 664) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,383 INFO L878 garLoopResultBuilder]: At program point L660(line 660) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,383 INFO L885 garLoopResultBuilder]: At program point L660-1(line 660) the Hoare annotation is: true [2022-03-19 06:48:09,383 INFO L885 garLoopResultBuilder]: At program point KbFilter_CreateCloseFINAL(lines 629 664) the Hoare annotation is: true [2022-03-19 06:48:09,384 INFO L878 garLoopResultBuilder]: At program point L644(lines 644 654) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,384 INFO L878 garLoopResultBuilder]: At program point L956(lines 956 958) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,384 INFO L878 garLoopResultBuilder]: At program point L956-2(lines 934 971) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,384 INFO L885 garLoopResultBuilder]: At program point KbFilter_InternIoCtlEXIT(lines 822 1007) the Hoare annotation is: true [2022-03-19 06:48:09,384 INFO L878 garLoopResultBuilder]: At program point L940(lines 940 943) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,384 INFO L878 garLoopResultBuilder]: At program point L903(lines 903 982) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,384 INFO L878 garLoopResultBuilder]: At program point L924(lines 924 976) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,384 INFO L878 garLoopResultBuilder]: At program point L891(lines 891 986) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,384 INFO L878 garLoopResultBuilder]: At program point L883(lines 883 988) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,384 INFO L878 garLoopResultBuilder]: At program point L875(lines 875 990) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,384 INFO L878 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,384 INFO L885 garLoopResultBuilder]: At program point L1003-1(line 1003) the Hoare annotation is: true [2022-03-19 06:48:09,385 INFO L878 garLoopResultBuilder]: At program point L896(lines 896 984) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,385 INFO L878 garLoopResultBuilder]: At program point L892(lines 891 986) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,385 INFO L878 garLoopResultBuilder]: At program point L917(lines 917 978) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,385 INFO L878 garLoopResultBuilder]: At program point L884(lines 883 988) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,385 INFO L878 garLoopResultBuilder]: At program point L934(lines 934 973) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,385 INFO L878 garLoopResultBuilder]: At program point L959-1(lines 959 961) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,385 INFO L878 garLoopResultBuilder]: At program point KbFilter_InternIoCtlENTRY(lines 822 1007) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,385 INFO L878 garLoopResultBuilder]: At program point L910(lines 910 980) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,385 INFO L878 garLoopResultBuilder]: At program point L972(lines 867 1006) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,385 INFO L878 garLoopResultBuilder]: At program point L935(lines 875 990) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,385 INFO L878 garLoopResultBuilder]: At program point L997(line 997) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,385 INFO L878 garLoopResultBuilder]: At program point L997-1(line 997) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= 2 ~s~0) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,385 INFO L885 garLoopResultBuilder]: At program point KbFilter_InternIoCtlFINAL(lines 822 1007) the Hoare annotation is: true [2022-03-19 06:48:09,386 INFO L878 garLoopResultBuilder]: At program point L931(lines 931 974) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,386 INFO L878 garLoopResultBuilder]: At program point L603(lines 603 615) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-03-19 06:48:09,386 INFO L878 garLoopResultBuilder]: At program point KeWaitForSingleObjectEXIT(lines 576 617) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-03-19 06:48:09,386 INFO L878 garLoopResultBuilder]: At program point L589(lines 581 600) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-03-19 06:48:09,386 INFO L878 garLoopResultBuilder]: At program point L581(lines 581 600) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-03-19 06:48:09,386 INFO L878 garLoopResultBuilder]: At program point L606(lines 605 615) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-03-19 06:48:09,386 INFO L878 garLoopResultBuilder]: At program point KeWaitForSingleObjectFINAL(lines 576 617) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-03-19 06:48:09,386 INFO L878 garLoopResultBuilder]: At program point L604(lines 603 615) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-03-19 06:48:09,386 INFO L878 garLoopResultBuilder]: At program point L596(line 596) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-03-19 06:48:09,387 INFO L878 garLoopResultBuilder]: At program point L594(lines 594 598) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-03-19 06:48:09,387 INFO L878 garLoopResultBuilder]: At program point L594-1(lines 581 600) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-03-19 06:48:09,387 INFO L878 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 576 617) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-03-19 06:48:09,387 INFO L878 garLoopResultBuilder]: At program point L582(lines 582 587) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-03-19 06:48:09,387 INFO L878 garLoopResultBuilder]: At program point L562-1(lines 554 567) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (= 2 ~s~0)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-03-19 06:48:09,387 INFO L878 garLoopResultBuilder]: At program point L558(lines 558 564) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0))) (.cse5 (= ~s~0 |old(~s~0)|))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-03-19 06:48:09,387 INFO L878 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 554 567) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0))) (.cse5 (= ~s~0 |old(~s~0)|))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-03-19 06:48:09,387 INFO L878 garLoopResultBuilder]: At program point IofCompleteRequestEXIT(lines 554 567) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (= 2 ~s~0)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-03-19 06:48:09,387 INFO L878 garLoopResultBuilder]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0)))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~compRegistered~0 1))))) [2022-03-19 06:48:09,388 INFO L878 garLoopResultBuilder]: At program point L258-1(lines 254 260) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,388 INFO L878 garLoopResultBuilder]: At program point L159(lines 159 274) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,388 INFO L878 garLoopResultBuilder]: At program point L126(lines 126 285) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,388 INFO L878 garLoopResultBuilder]: At program point L184(line 184) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,388 INFO L878 garLoopResultBuilder]: At program point L201(lines 201 203) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1))) (or (not (= ~NP~0 1)) (and .cse0 (= ~setEventCalled~0 1) (= KbFilter_PnP_~__cil_tmp23~0 259) (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (and .cse0 (= ~s~0 |old(~s~0)|)))) [2022-03-19 06:48:09,388 INFO L878 garLoopResultBuilder]: At program point L168(lines 168 271) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,388 INFO L878 garLoopResultBuilder]: At program point L201-1(lines 201 203) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,388 INFO L878 garLoopResultBuilder]: At program point L135(lines 135 282) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,388 INFO L878 garLoopResultBuilder]: At program point L218(line 218) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,388 INFO L878 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,389 INFO L878 garLoopResultBuilder]: At program point L243-1(lines 239 245) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,389 INFO L878 garLoopResultBuilder]: At program point L177(lines 177 189) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,389 INFO L878 garLoopResultBuilder]: At program point L144(lines 144 279) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,389 INFO L878 garLoopResultBuilder]: At program point L111(lines 111 290) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,389 INFO L878 garLoopResultBuilder]: At program point L227(line 227) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,389 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 195) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (and (= ~compRegistered~0 1) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~s~0 |old(~s~0)|))) [2022-03-19 06:48:09,389 INFO L878 garLoopResultBuilder]: At program point L227-1(lines 223 229) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,389 INFO L878 garLoopResultBuilder]: At program point L194-1(lines 194 195) the Hoare annotation is: (let ((.cse1 (= KbFilter_PnP_~status~0 0)) (.cse0 (= ~compRegistered~0 1))) (or (and .cse0 (= ~setEventCalled~0 1) (<= |KbFilter_PnP_#t~ret12| 259) (<= 259 |KbFilter_PnP_#t~ret12|) .cse1 (= ~MPR3~0 ~s~0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse1 (= ~s~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (and .cse0 (= |KbFilter_PnP_#t~ret12| 0) (= ~s~0 ~NP~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)))) [2022-03-19 06:48:09,389 INFO L878 garLoopResultBuilder]: At program point L153(lines 153 276) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,389 INFO L878 garLoopResultBuilder]: At program point L120(lines 120 287) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,390 INFO L878 garLoopResultBuilder]: At program point KbFilter_PnPEXIT(lines 81 294) the Hoare annotation is: (or (= ~compRegistered~0 1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (<= ~compRegistered~0 0) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,390 INFO L878 garLoopResultBuilder]: At program point L112(lines 111 290) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,390 INFO L878 garLoopResultBuilder]: At program point L269(lines 172 270) the Hoare annotation is: (or (= ~compRegistered~0 1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (<= ~compRegistered~0 0) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,390 INFO L878 garLoopResultBuilder]: At program point L162(lines 162 273) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,390 INFO L878 garLoopResultBuilder]: At program point L129(lines 129 284) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,390 INFO L878 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,390 INFO L878 garLoopResultBuilder]: At program point KbFilter_PnPENTRY(lines 81 294) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,390 INFO L878 garLoopResultBuilder]: At program point L171(lines 117 288) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,390 INFO L878 garLoopResultBuilder]: At program point L138(lines 138 281) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,390 INFO L878 garLoopResultBuilder]: At program point KbFilter_PnPFINAL(lines 81 294) the Hoare annotation is: (or (= ~compRegistered~0 1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (<= ~compRegistered~0 0) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,390 INFO L878 garLoopResultBuilder]: At program point L147(lines 147 278) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,391 INFO L878 garLoopResultBuilder]: At program point L114(lines 114 289) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,391 INFO L878 garLoopResultBuilder]: At program point L156(lines 156 275) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,391 INFO L878 garLoopResultBuilder]: At program point L123(lines 123 286) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,391 INFO L878 garLoopResultBuilder]: At program point L115(lines 114 289) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,391 INFO L878 garLoopResultBuilder]: At program point L239(lines 239 245) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,391 INFO L878 garLoopResultBuilder]: At program point L264(lines 264 265) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,391 INFO L878 garLoopResultBuilder]: At program point L264-1(lines 264 265) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (= ~compRegistered~0 0)) [2022-03-19 06:48:09,391 INFO L878 garLoopResultBuilder]: At program point L165(lines 165 272) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,391 INFO L878 garLoopResultBuilder]: At program point L132(lines 132 283) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,391 INFO L878 garLoopResultBuilder]: At program point L223(lines 223 229) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,392 INFO L878 garLoopResultBuilder]: At program point L182(lines 182 188) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,392 INFO L878 garLoopResultBuilder]: At program point L182-1(lines 177 189) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (and (= ~compRegistered~0 1) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~s~0 |old(~s~0)|))) [2022-03-19 06:48:09,392 INFO L878 garLoopResultBuilder]: At program point L207(lines 207 213) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,392 INFO L878 garLoopResultBuilder]: At program point L141(lines 141 280) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,392 INFO L878 garLoopResultBuilder]: At program point L108(lines 108 291) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,392 INFO L878 garLoopResultBuilder]: At program point L199(lines 199 205) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1))) (or (not (= ~NP~0 1)) (and .cse0 (= ~setEventCalled~0 1) (= KbFilter_PnP_~__cil_tmp23~0 259) (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (and .cse0 (= ~s~0 |old(~s~0)|)))) [2022-03-19 06:48:09,392 INFO L878 garLoopResultBuilder]: At program point L199-2(lines 172 268) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,392 INFO L878 garLoopResultBuilder]: At program point L249(line 249) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,392 INFO L878 garLoopResultBuilder]: At program point L249-1(line 249) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (= ~compRegistered~0 0)) [2022-03-19 06:48:09,392 INFO L878 garLoopResultBuilder]: At program point L150(lines 150 277) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,392 INFO L878 garLoopResultBuilder]: At program point L117(lines 117 288) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,393 INFO L878 garLoopResultBuilder]: At program point L208(lines 208 212) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,393 INFO L878 garLoopResultBuilder]: At program point L109(lines 108 291) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,393 INFO L878 garLoopResultBuilder]: At program point L233(lines 233 234) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,393 INFO L878 garLoopResultBuilder]: At program point L233-1(lines 233 234) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (= ~compRegistered~0 0)) [2022-03-19 06:48:09,393 INFO L878 garLoopResultBuilder]: At program point L258(line 258) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,393 INFO L878 garLoopResultBuilder]: At program point KeSetEventENTRY(lines 568 575) the Hoare annotation is: (or (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-03-19 06:48:09,393 INFO L878 garLoopResultBuilder]: At program point KeSetEventFINAL(lines 568 575) the Hoare annotation is: (or (= ~setEventCalled~0 1) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-03-19 06:48:09,393 INFO L878 garLoopResultBuilder]: At program point KeSetEventEXIT(lines 568 575) the Hoare annotation is: (or (= ~setEventCalled~0 1) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-03-19 06:48:09,393 INFO L878 garLoopResultBuilder]: At program point L700(lines 700 729) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,393 INFO L885 garLoopResultBuilder]: At program point KbFilter_PowerEXIT(lines 689 744) the Hoare annotation is: true [2022-03-19 06:48:09,393 INFO L878 garLoopResultBuilder]: At program point L709(lines 709 726) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,394 INFO L878 garLoopResultBuilder]: At program point L740(line 740) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,394 INFO L878 garLoopResultBuilder]: At program point KbFilter_PowerENTRY(lines 689 744) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,394 INFO L885 garLoopResultBuilder]: At program point L740-1(line 740) the Hoare annotation is: true [2022-03-19 06:48:09,394 INFO L878 garLoopResultBuilder]: At program point L703(lines 703 728) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,394 INFO L878 garLoopResultBuilder]: At program point L734(line 734) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,394 INFO L878 garLoopResultBuilder]: At program point L701(lines 700 729) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,394 INFO L878 garLoopResultBuilder]: At program point L734-1(lines 730 736) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,394 INFO L878 garLoopResultBuilder]: At program point L724(lines 699 743) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,394 INFO L885 garLoopResultBuilder]: At program point KbFilter_PowerFINAL(lines 689 744) the Hoare annotation is: true [2022-03-19 06:48:09,394 INFO L878 garLoopResultBuilder]: At program point L706(lines 706 727) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,394 INFO L878 garLoopResultBuilder]: At program point stub_driver_initEXIT(lines 43 56) the Hoare annotation is: (or (and (not (= ~pended~0 1)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,394 INFO L878 garLoopResultBuilder]: At program point stub_driver_initENTRY(lines 43 56) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= |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)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,394 INFO L878 garLoopResultBuilder]: At program point stub_driver_initFINAL(lines 43 56) the Hoare annotation is: (or (and (not (= ~pended~0 1)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,395 INFO L885 garLoopResultBuilder]: At program point errorFnENTRY(lines 1009 1016) the Hoare annotation is: true [2022-03-19 06:48:09,395 INFO L885 garLoopResultBuilder]: At program point errorFnFINAL(lines 1009 1016) the Hoare annotation is: true [2022-03-19 06:48:09,395 INFO L885 garLoopResultBuilder]: At program point errorFnEXIT(lines 1009 1016) the Hoare annotation is: true [2022-03-19 06:48:09,395 INFO L885 garLoopResultBuilder]: At program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) the Hoare annotation is: true [2022-03-19 06:48:09,395 INFO L878 garLoopResultBuilder]: At program point L510(lines 509 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 (and (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-03-19 06:48:09,395 INFO L878 garLoopResultBuilder]: At program point L532(lines 532 549) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (let ((.cse0 (= ~MPR1~0 ~s~0)) (.cse1 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0) .cse0) (not (= ~NP~0 1)) (and (<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0) .cse0 .cse1) (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 5 ~MPR1~0)) .cse3 .cse4 (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse0 .cse1) (not (<= 6 ~MPR3~0)) .cse5 (not (= ~compRegistered~0 1)))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5))) [2022-03-19 06:48:09,395 INFO L878 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 481 553) the Hoare annotation is: (let ((.cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 (not (<= 5 ~MPR1~0)) .cse2 .cse3 (not (<= 6 ~MPR3~0)) .cse4 (not (= ~compRegistered~0 1))) (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-03-19 06:48:09,395 INFO L878 garLoopResultBuilder]: At program point L495(lines 495 499) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-03-19 06:48:09,395 INFO L878 garLoopResultBuilder]: At program point L524(lines 488 552) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (let ((.cse0 (= ~MPR1~0 ~s~0)) (.cse1 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (not (= ~NP~0 1)) (and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0) .cse0 .cse1) (and (<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0) .cse0 .cse1) (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 5 ~MPR1~0)) .cse3 .cse4 (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse0 .cse1) (not (<= 6 ~MPR3~0)) .cse5 (not (= ~compRegistered~0 1)))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5))) [2022-03-19 06:48:09,396 INFO L878 garLoopResultBuilder]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (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)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-03-19 06:48:09,396 INFO L878 garLoopResultBuilder]: At program point L491-1(line 491) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 (and (= ~setEventCalled~0 1) (= (+ |IofCallDriver_#t~ret37| 1073741802) 0) (= ~s~0 |old(~s~0)|)) .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-03-19 06:48:09,396 INFO L878 garLoopResultBuilder]: At program point IofCallDriverFINAL(lines 481 553) the Hoare annotation is: (let ((.cse0 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (.cse1 (= ~s~0 ~NP~0))) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259) (<= 259 IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0) .cse0) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and .cse1 .cse0) (and .cse1 (<= IofCallDriver_~returnVal2~0 0) (<= 0 |IofCallDriver_#res|) (<= 0 IofCallDriver_~returnVal2~0) (<= |IofCallDriver_#res| 0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)))) [2022-03-19 06:48:09,396 INFO L878 garLoopResultBuilder]: At program point L512(lines 511 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-03-19 06:48:09,396 INFO L878 garLoopResultBuilder]: At program point L541(lines 541 548) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-03-19 06:48:09,396 INFO L878 garLoopResultBuilder]: At program point L504(lines 504 527) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-03-19 06:48:09,396 INFO L878 garLoopResultBuilder]: At program point IofCallDriverEXIT(lines 481 553) the Hoare annotation is: (let ((.cse0 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (.cse1 (= ~s~0 ~NP~0))) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259) (<= 259 IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0) .cse0) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and .cse1 .cse0) (and .cse1 (<= IofCallDriver_~returnVal2~0 0) (<= 0 |IofCallDriver_#res|) (<= 0 IofCallDriver_~returnVal2~0) (<= |IofCallDriver_#res| 0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)))) [2022-03-19 06:48:09,396 INFO L878 garLoopResultBuilder]: At program point L533(lines 533 539) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (let ((.cse0 (= ~MPR1~0 ~s~0)) (.cse1 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0) .cse0) (not (= ~NP~0 1)) (and (<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0) .cse0 .cse1) (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 5 ~MPR1~0)) .cse3 .cse4 (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse0 .cse1) (not (<= 6 ~MPR3~0)) .cse5 (not (= ~compRegistered~0 1)))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5))) [2022-03-19 06:48:09,396 INFO L878 garLoopResultBuilder]: At program point L546(line 546) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-03-19 06:48:09,397 INFO L878 garLoopResultBuilder]: At program point L546-1(lines 528 550) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (not (= ~NP~0 1)) (and .cse0 (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0) .cse1) (not (<= 4 ~SKIP2~0)) (and .cse0 .cse1) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)))) [2022-03-19 06:48:09,397 INFO L878 garLoopResultBuilder]: At program point L509(lines 509 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-03-19 06:48:09,397 INFO L878 garLoopResultBuilder]: At program point L505(lines 504 527) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 (and (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-03-19 06:48:09,397 INFO L878 garLoopResultBuilder]: At program point L497(line 497) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-03-19 06:48:09,397 INFO L878 garLoopResultBuilder]: At program point L489(lines 489 501) the Hoare annotation is: (let ((.cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 (not (<= 5 ~MPR1~0)) .cse2 .cse3 (not (<= 6 ~MPR3~0)) .cse4 (not (= ~compRegistered~0 1))) (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-03-19 06:48:09,397 INFO L878 garLoopResultBuilder]: At program point L489-1(lines 489 501) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-03-19 06:48:09,397 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= ~s~0 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-03-19 06:48:09,397 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) (= |old(~DevicePowerState~0)| ~DevicePowerState~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-19 06:48:09,397 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= ~s~0 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-03-19 06:48:09,397 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-19 06:48:09,397 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~s~0 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-03-19 06:48:09,397 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-19 06:48:09,397 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-19 06:48:09,397 INFO L878 garLoopResultBuilder]: At program point KbFilter_DispatchPassThroughENTRY(lines 665 688) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,397 INFO L878 garLoopResultBuilder]: At program point L684(line 684) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,397 INFO L885 garLoopResultBuilder]: At program point L684-1(line 684) the Hoare annotation is: true [2022-03-19 06:48:09,398 INFO L885 garLoopResultBuilder]: At program point KbFilter_DispatchPassThroughFINAL(lines 665 688) the Hoare annotation is: true [2022-03-19 06:48:09,398 INFO L878 garLoopResultBuilder]: At program point L678(line 678) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,398 INFO L878 garLoopResultBuilder]: At program point L678-1(lines 674 680) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,398 INFO L885 garLoopResultBuilder]: At program point KbFilter_DispatchPassThroughEXIT(lines 665 688) the Hoare annotation is: true [2022-03-19 06:48:09,398 INFO L878 garLoopResultBuilder]: At program point L674(lines 674 680) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-19 06:48:09,400 INFO L718 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-03-19 06:48:09,401 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 06:48:09,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 06:48:09 BoogieIcfgContainer [2022-03-19 06:48:09,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-19 06:48:09,474 INFO L158 Benchmark]: Toolchain (without parser) took 21474.97ms. Allocated memory was 263.2MB in the beginning and 457.2MB in the end (delta: 194.0MB). Free memory was 238.5MB in the beginning and 250.0MB in the end (delta: -11.5MB). Peak memory consumption was 272.6MB. Max. memory is 8.0GB. [2022-03-19 06:48:09,474 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 172.0MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 06:48:09,474 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.84ms. Allocated memory is still 263.2MB. Free memory was 238.0MB in the beginning and 227.7MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-19 06:48:09,475 INFO L158 Benchmark]: Boogie Preprocessor took 70.56ms. Allocated memory is still 263.2MB. Free memory was 227.7MB in the beginning and 225.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-19 06:48:09,475 INFO L158 Benchmark]: RCFGBuilder took 652.61ms. Allocated memory is still 263.2MB. Free memory was 225.0MB in the beginning and 191.0MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-03-19 06:48:09,475 INFO L158 Benchmark]: TraceAbstraction took 20400.57ms. Allocated memory was 263.2MB in the beginning and 457.2MB in the end (delta: 194.0MB). Free memory was 190.4MB in the beginning and 250.0MB in the end (delta: -59.6MB). Peak memory consumption was 225.6MB. Max. memory is 8.0GB. [2022-03-19 06:48:09,476 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 172.0MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 340.84ms. Allocated memory is still 263.2MB. Free memory was 238.0MB in the beginning and 227.7MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.56ms. Allocated memory is still 263.2MB. Free memory was 227.7MB in the beginning and 225.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 652.61ms. Allocated memory is still 263.2MB. Free memory was 225.0MB in the beginning and 191.0MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 20400.57ms. Allocated memory was 263.2MB in the beginning and 457.2MB in the end (delta: 194.0MB). Free memory was 190.4MB in the beginning and 250.0MB in the end (delta: -59.6MB). Peak memory consumption was 225.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: 1013]: 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 19 procedures, 242 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5413 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5398 mSDsluCounter, 6787 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3692 mSDsCounter, 1252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6924 IncrementalHoareTripleChecker+Invalid, 8176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1252 mSolverCounterUnsat, 3095 mSDtfsCounter, 6924 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 189 SyntacticMatches, 4 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=3, InterpolantAutomatonStates: 173, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 149 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 239 LocationsWithAnnotation, 911 PreInvPairs, 1233 NumberOfFragments, 10930 HoareAnnotationTreeSize, 911 FomulaSimplifications, 1861 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 239 FomulaSimplificationsInter, 9411 FormulaSimplificationTreeSizeReductionInter, 8.5s 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: 422]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || ((((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && status == 0) && compRegistered == 0) && s == \old(s))) || !(2 == DC) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && (((((((((!(NP == 1) || ((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && s == \old(s))) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((((((((!(NP == 1) || (((returnVal2 <= 0 && 0 <= returnVal2) && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || ((1073741823 + returnVal2 <= 0 && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || ((((setEventCalled == 1 && returnVal2 <= 259) && 259 <= returnVal2) && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((compRegistered == 1 || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || compRegistered <= 0) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 776]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) && (((((((((!(NP == 1) || ((setEventCalled == 1 && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || status == 0) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || (((((((((6 <= MPR3 && status == 0) && 7 <= IPC) && 5 <= MPR1) && 2 == DC) && !(pended == 1)) && s == NP) && NP == 1) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - ProcedureContractResult [Line: 568]: Procedure Contract for KeSetEvent Derived contract for procedure KeSetEvent: ((((((((setEventCalled == 1 || pended == 1) || !(s == NP)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) || !(s == 1) - ProcedureContractResult [Line: 618]: Procedure Contract for KbFilter_Complete Derived contract for procedure KbFilter_Complete: ((((((((pended == 1 || !(s == NP)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || ((1073741802 + \result <= 0 && setEventCalled == 1) && 0 <= 1073741802 + \result)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) || !(s == 1) - ProcedureContractResult [Line: 43]: Procedure Contract for stub_driver_init Derived contract for procedure stub_driver_init: ((((((((((!(pended == 1) && compRegistered == 0) && s == \old(s)) || !(NP == 1)) || !(NP == \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC) - ProcedureContractResult [Line: 689]: Procedure Contract for KbFilter_Power Derived contract for procedure KbFilter_Power: 1 - ProcedureContractResult [Line: 57]: Procedure Contract for _BLAST_init Derived contract for procedure _BLAST_init: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || ((((((((6 <= MPR3 && 7 <= IPC) && 5 <= MPR1) && 2 == DC) && !(pended == 1)) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && !(MPR3 == s))) || !(\old(s) == \old(MPR3)) - ProcedureContractResult [Line: 1009]: Procedure Contract for errorFn Derived contract for procedure errorFn: 1 - ProcedureContractResult [Line: 295]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 481]: Procedure Contract for IofCallDriver Derived contract for procedure IofCallDriver: ((((((((((!(NP == 1) || ((((((setEventCalled == 1 && returnVal2 <= 259) && 259 <= \result) && \result <= 259) && 259 <= returnVal2) && MPR3 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (s == NP && __cil_tmp7 + 1073741802 == 0)) || ((((s == NP && returnVal2 <= 0) && 0 <= \result) && 0 <= returnVal2) && \result <= 0)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1) - ProcedureContractResult [Line: 467]: Procedure Contract for stubMoreProcessingRequired Derived contract for procedure stubMoreProcessingRequired: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(setEventCalled == 1)) || !(2 == DC)) || MPR1 == s) || !(compRegistered == 1) - ProcedureContractResult [Line: 745]: Procedure Contract for PoCallDriver Derived contract for procedure PoCallDriver: 1 - ProcedureContractResult [Line: 629]: Procedure Contract for KbFilter_CreateClose Derived contract for procedure KbFilter_CreateClose: 1 - ProcedureContractResult [Line: 822]: Procedure Contract for KbFilter_InternIoCtl Derived contract for procedure KbFilter_InternIoCtl: 1 - ProcedureContractResult [Line: 576]: Procedure Contract for KeWaitForSingleObject Derived contract for procedure KeWaitForSingleObject: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) - ProcedureContractResult [Line: 554]: Procedure Contract for IofCompleteRequest Derived contract for procedure IofCompleteRequest: ((((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || 2 == s) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC)) && ((((((!(NP == \old(s)) || pended == 1) || 2 == s) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC)) || !(compRegistered == 1)) - ProcedureContractResult [Line: 665]: Procedure Contract for KbFilter_DispatchPassThrough Derived contract for procedure KbFilter_DispatchPassThrough: 1 - ProcedureContractResult [Line: 81]: Procedure Contract for KbFilter_PnP Derived contract for procedure KbFilter_PnP: (((((((((compRegistered == 1 || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || compRegistered <= 0) || !(6 <= MPR3)) || !(2 == DC) RESULT: Ultimate proved your program to be correct! [2022-03-19 06:48:09,521 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...