/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 02:29:41,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 02:29:41,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 02:29:41,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 02:29:41,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 02:29:41,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 02:29:41,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 02:29:41,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 02:29:41,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 02:29:41,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 02:29:41,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 02:29:41,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 02:29:41,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 02:29:42,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 02:29:42,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 02:29:42,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 02:29:42,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 02:29:42,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 02:29:42,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 02:29:42,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 02:29:42,011 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 02:29:42,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 02:29:42,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 02:29:42,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 02:29:42,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 02:29:42,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 02:29:42,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 02:29:42,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 02:29:42,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 02:29:42,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 02:29:42,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 02:29:42,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 02:29:42,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 02:29:42,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 02:29:42,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 02:29:42,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 02:29:42,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 02:29:42,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 02:29:42,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 02:29:42,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 02:29:42,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 02:29:42,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 02:29:42,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-03-20 02:29:42,049 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 02:29:42,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 02:29:42,050 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-20 02:29:42,050 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-20 02:29:42,051 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-20 02:29:42,051 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-20 02:29:42,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-20 02:29:42,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-20 02:29:42,051 INFO L138 SettingsManager]: * Use SBE=true [2022-03-20 02:29:42,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 02:29:42,052 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 02:29:42,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 02:29:42,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 02:29:42,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 02:29:42,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 02:29:42,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 02:29:42,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 02:29:42,053 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 02:29:42,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 02:29:42,054 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 02:29:42,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 02:29:42,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 02:29:42,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 02:29:42,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 02:29:42,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 02:29:42,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 02:29:42,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-20 02:29:42,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-20 02:29:42,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 02:29:42,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-20 02:29:42,055 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-20 02:29:42,055 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-20 02:29:42,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 02:29:42,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-20 02:29:42,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 02:29:42,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 02:29:42,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 02:29:42,258 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 02:29:42,259 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 02:29:42,259 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-20 02:29:42,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b83499c3/22c8be7b63e94d8496f09cfb37caa7fc/FLAGb930a953f [2022-03-20 02:29:42,678 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 02:29:42,679 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-03-20 02:29:42,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b83499c3/22c8be7b63e94d8496f09cfb37caa7fc/FLAGb930a953f [2022-03-20 02:29:42,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b83499c3/22c8be7b63e94d8496f09cfb37caa7fc [2022-03-20 02:29:42,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 02:29:42,713 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 02:29:42,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 02:29:42,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 02:29:42,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 02:29:42,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 02:29:42" (1/1) ... [2022-03-20 02:29:42,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a4af5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:42, skipping insertion in model container [2022-03-20 02:29:42,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 02:29:42" (1/1) ... [2022-03-20 02:29:42,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 02:29:42,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 02:29:43,007 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-20 02:29:43,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 02:29:43,015 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 02:29:43,080 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-20 02:29:43,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 02:29:43,093 INFO L208 MainTranslator]: Completed translation [2022-03-20 02:29:43,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:43 WrapperNode [2022-03-20 02:29:43,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 02:29:43,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 02:29:43,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 02:29:43,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 02:29:43,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:43" (1/1) ... [2022-03-20 02:29:43,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:43" (1/1) ... [2022-03-20 02:29:43,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:43" (1/1) ... [2022-03-20 02:29:43,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:43" (1/1) ... [2022-03-20 02:29:43,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:43" (1/1) ... [2022-03-20 02:29:43,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:43" (1/1) ... [2022-03-20 02:29:43,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:43" (1/1) ... [2022-03-20 02:29:43,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 02:29:43,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 02:29:43,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 02:29:43,159 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 02:29:43,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:43" (1/1) ... [2022-03-20 02:29:43,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 02:29:43,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 02:29:43,206 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-20 02:29:43,208 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-20 02:29:43,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 02:29:43,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 02:29:43,245 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 02:29:43,246 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-03-20 02:29:43,248 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-03-20 02:29:43,248 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-03-20 02:29:43,248 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 02:29:43,248 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-03-20 02:29:43,249 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-03-20 02:29:43,249 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-03-20 02:29:43,249 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-03-20 02:29:43,249 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-03-20 02:29:43,250 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-03-20 02:29:43,252 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-03-20 02:29:43,252 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-03-20 02:29:43,252 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2022-03-20 02:29:43,252 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-03-20 02:29:43,252 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2022-03-20 02:29:43,252 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-03-20 02:29:43,252 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 02:29:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 02:29:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 02:29:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 02:29:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-20 02:29:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 02:29:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-03-20 02:29:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-03-20 02:29:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-03-20 02:29:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-03-20 02:29:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-03-20 02:29:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-03-20 02:29:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-03-20 02:29:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-03-20 02:29:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-03-20 02:29:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2022-03-20 02:29:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2022-03-20 02:29:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-03-20 02:29:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-03-20 02:29:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-03-20 02:29:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-03-20 02:29:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 02:29:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-03-20 02:29:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 02:29:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 02:29:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 02:29:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 02:29:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 02:29:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 02:29:43,397 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 02:29:43,399 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 02:29:43,489 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:43,597 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-03-20 02:29:43,597 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-03-20 02:29:43,602 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:43,640 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-03-20 02:29:43,640 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-03-20 02:29:43,711 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:43,728 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-03-20 02:29:43,728 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-03-20 02:29:43,737 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:43,836 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-03-20 02:29:43,836 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-03-20 02:29:43,840 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:43,860 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-03-20 02:29:43,860 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-03-20 02:29:43,865 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:43,885 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-03-20 02:29:43,885 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-03-20 02:29:43,910 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 02:29:43,919 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 02:29:43,920 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-20 02:29:43,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 02:29:43 BoogieIcfgContainer [2022-03-20 02:29:43,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 02:29:43,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 02:29:43,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 02:29:43,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 02:29:43,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 02:29:42" (1/3) ... [2022-03-20 02:29:43,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce79cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 02:29:43, skipping insertion in model container [2022-03-20 02:29:43,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:43" (2/3) ... [2022-03-20 02:29:43,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce79cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 02:29:43, skipping insertion in model container [2022-03-20 02:29:43,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 02:29:43" (3/3) ... [2022-03-20 02:29:43,929 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2022-03-20 02:29:43,934 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-20 02:29:43,934 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 02:29:43,979 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 02:29:43,985 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-20 02:29:43,986 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 02:29:44,012 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-20 02:29:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 02:29:44,020 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:44,020 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:44,021 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:44,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1606654013, now seen corresponding path program 1 times [2022-03-20 02:29:44,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:44,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802948298] [2022-03-20 02:29:44,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:44,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:44,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:44,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:44,349 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-20 02:29:44,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:44,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802948298] [2022-03-20 02:29:44,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802948298] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:44,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:44,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 02:29:44,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804410343] [2022-03-20 02:29:44,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:44,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 02:29:44,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:44,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 02:29:44,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:29:44,382 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-20 02:29:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:45,137 INFO L93 Difference]: Finished difference Result 415 states and 624 transitions. [2022-03-20 02:29:45,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:29:45,139 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-20 02:29:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:45,147 INFO L225 Difference]: With dead ends: 415 [2022-03-20 02:29:45,147 INFO L226 Difference]: Without dead ends: 256 [2022-03-20 02:29:45,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:29:45,153 INFO L913 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-20 02:29:45,154 INFO L914 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-20 02:29:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-03-20 02:29:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2022-03-20 02:29:45,195 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-20 02:29:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2022-03-20 02:29:45,198 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2022-03-20 02:29:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:45,198 INFO L478 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2022-03-20 02:29:45,198 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-20 02:29:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2022-03-20 02:29:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-20 02:29:45,199 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:45,199 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:45,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 02:29:45,200 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:45,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:45,200 INFO L85 PathProgramCache]: Analyzing trace with hash -584418248, now seen corresponding path program 1 times [2022-03-20 02:29:45,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:45,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310741541] [2022-03-20 02:29:45,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:45,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:45,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:45,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:45,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:45,355 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-20 02:29:45,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:45,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310741541] [2022-03-20 02:29:45,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310741541] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:45,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:45,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 02:29:45,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092739964] [2022-03-20 02:29:45,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:45,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 02:29:45,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:45,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 02:29:45,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:29:45,358 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-20 02:29:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:46,209 INFO L93 Difference]: Finished difference Result 401 states and 553 transitions. [2022-03-20 02:29:46,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 02:29:46,209 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-20 02:29:46,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:46,215 INFO L225 Difference]: With dead ends: 401 [2022-03-20 02:29:46,215 INFO L226 Difference]: Without dead ends: 343 [2022-03-20 02:29:46,219 INFO L912 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-20 02:29:46,221 INFO L913 BasicCegarLoop]: 352 mSDtfsCounter, 380 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:46,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 493 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-20 02:29:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-03-20 02:29:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 301. [2022-03-20 02:29:46,248 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-20 02:29:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2022-03-20 02:29:46,249 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 28 [2022-03-20 02:29:46,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:46,250 INFO L478 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2022-03-20 02:29:46,250 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-20 02:29:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2022-03-20 02:29:46,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-20 02:29:46,251 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:46,251 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:46,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 02:29:46,251 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:46,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:46,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1124228951, now seen corresponding path program 1 times [2022-03-20 02:29:46,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:46,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300333869] [2022-03-20 02:29:46,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:46,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:46,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:46,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:46,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:46,362 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-20 02:29:46,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:46,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300333869] [2022-03-20 02:29:46,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300333869] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:46,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:46,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 02:29:46,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47591317] [2022-03-20 02:29:46,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:46,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 02:29:46,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:46,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 02:29:46,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:29:46,364 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-20 02:29:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:46,902 INFO L93 Difference]: Finished difference Result 478 states and 635 transitions. [2022-03-20 02:29:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 02:29:46,902 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-20 02:29:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:46,904 INFO L225 Difference]: With dead ends: 478 [2022-03-20 02:29:46,904 INFO L226 Difference]: Without dead ends: 362 [2022-03-20 02:29:46,905 INFO L912 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-20 02:29:46,906 INFO L913 BasicCegarLoop]: 263 mSDtfsCounter, 404 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:46,906 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 379 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 02:29:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-03-20 02:29:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2022-03-20 02:29:46,926 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-20 02:29:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2022-03-20 02:29:46,927 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 28 [2022-03-20 02:29:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:46,927 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2022-03-20 02:29:46,928 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-20 02:29:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2022-03-20 02:29:46,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-20 02:29:46,929 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:46,929 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:46,929 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 02:29:46,929 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:46,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash 512919532, now seen corresponding path program 1 times [2022-03-20 02:29:46,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:46,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978681150] [2022-03-20 02:29:46,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,048 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-20 02:29:47,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:47,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978681150] [2022-03-20 02:29:47,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978681150] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:47,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:47,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 02:29:47,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56488044] [2022-03-20 02:29:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:47,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 02:29:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:47,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 02:29:47,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:29:47,050 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-20 02:29:47,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:47,410 INFO L93 Difference]: Finished difference Result 344 states and 464 transitions. [2022-03-20 02:29:47,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 02:29:47,411 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-20 02:29:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:47,413 INFO L225 Difference]: With dead ends: 344 [2022-03-20 02:29:47,413 INFO L226 Difference]: Without dead ends: 340 [2022-03-20 02:29:47,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-20 02:29:47,415 INFO L913 BasicCegarLoop]: 264 mSDtfsCounter, 343 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:47,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 385 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 02:29:47,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-03-20 02:29:47,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2022-03-20 02:29:47,430 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-20 02:29:47,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 459 transitions. [2022-03-20 02:29:47,432 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 459 transitions. Word has length 38 [2022-03-20 02:29:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:47,432 INFO L478 AbstractCegarLoop]: Abstraction has 340 states and 459 transitions. [2022-03-20 02:29:47,432 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-20 02:29:47,432 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2022-03-20 02:29:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 02:29:47,435 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:47,435 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:47,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 02:29:47,435 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:47,435 INFO L85 PathProgramCache]: Analyzing trace with hash 708737618, now seen corresponding path program 1 times [2022-03-20 02:29:47,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:47,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836487936] [2022-03-20 02:29:47,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:47,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 02:29:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,562 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-20 02:29:47,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:47,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836487936] [2022-03-20 02:29:47,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836487936] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:47,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:47,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 02:29:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475831108] [2022-03-20 02:29:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:47,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 02:29:47,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:47,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 02:29:47,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-20 02:29:47,564 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-20 02:29:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:48,104 INFO L93 Difference]: Finished difference Result 385 states and 508 transitions. [2022-03-20 02:29:48,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 02:29:48,104 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-20 02:29:48,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:48,106 INFO L225 Difference]: With dead ends: 385 [2022-03-20 02:29:48,106 INFO L226 Difference]: Without dead ends: 319 [2022-03-20 02:29:48,106 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:48,107 INFO L913 BasicCegarLoop]: 298 mSDtfsCounter, 595 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:48,107 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [595 Valid, 542 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 02:29:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-03-20 02:29:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 301. [2022-03-20 02:29:48,120 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-20 02:29:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 402 transitions. [2022-03-20 02:29:48,121 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 402 transitions. Word has length 46 [2022-03-20 02:29:48,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:48,122 INFO L478 AbstractCegarLoop]: Abstraction has 301 states and 402 transitions. [2022-03-20 02:29:48,122 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-20 02:29:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 402 transitions. [2022-03-20 02:29:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-20 02:29:48,124 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:48,124 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:48,124 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 02:29:48,124 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:48,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:48,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1153649594, now seen corresponding path program 1 times [2022-03-20 02:29:48,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:48,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84276648] [2022-03-20 02:29:48,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:48,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:48,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:48,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:48,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:48,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-20 02:29:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:48,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:29:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:48,381 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-20 02:29:48,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:48,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84276648] [2022-03-20 02:29:48,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84276648] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:48,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:48,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:29:48,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75054522] [2022-03-20 02:29:48,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:48,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:29:48,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:48,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:29:48,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:48,383 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-20 02:29:49,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:49,246 INFO L93 Difference]: Finished difference Result 327 states and 430 transitions. [2022-03-20 02:29:49,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:29:49,246 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-20 02:29:49,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:49,248 INFO L225 Difference]: With dead ends: 327 [2022-03-20 02:29:49,248 INFO L226 Difference]: Without dead ends: 322 [2022-03-20 02:29:49,248 INFO L912 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-20 02:29:49,249 INFO L913 BasicCegarLoop]: 252 mSDtfsCounter, 1068 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:49,249 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1070 Valid, 465 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 02:29:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-03-20 02:29:49,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 315. [2022-03-20 02:29:49,265 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-20 02:29:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 418 transitions. [2022-03-20 02:29:49,267 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 418 transitions. Word has length 45 [2022-03-20 02:29:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:49,267 INFO L478 AbstractCegarLoop]: Abstraction has 315 states and 418 transitions. [2022-03-20 02:29:49,267 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-20 02:29:49,267 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 418 transitions. [2022-03-20 02:29:49,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 02:29:49,268 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:49,268 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:49,268 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 02:29:49,269 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:49,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:49,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1782707845, now seen corresponding path program 1 times [2022-03-20 02:29:49,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:49,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279553310] [2022-03-20 02:29:49,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:49,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:49,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:49,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:49,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:49,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-20 02:29:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:49,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:29:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:49,455 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-20 02:29:49,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:49,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279553310] [2022-03-20 02:29:49,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279553310] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:49,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:49,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:29:49,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673389223] [2022-03-20 02:29:49,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:49,456 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:29:49,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:49,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:29:49,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:49,457 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-20 02:29:50,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:50,092 INFO L93 Difference]: Finished difference Result 327 states and 429 transitions. [2022-03-20 02:29:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:29:50,093 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-20 02:29:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:50,094 INFO L225 Difference]: With dead ends: 327 [2022-03-20 02:29:50,094 INFO L226 Difference]: Without dead ends: 322 [2022-03-20 02:29:50,095 INFO L912 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-20 02:29:50,095 INFO L913 BasicCegarLoop]: 253 mSDtfsCounter, 919 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:50,096 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [921 Valid, 415 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 02:29:50,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-03-20 02:29:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 316. [2022-03-20 02:29:50,114 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-20 02:29:50,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 419 transitions. [2022-03-20 02:29:50,115 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 419 transitions. Word has length 46 [2022-03-20 02:29:50,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:50,115 INFO L478 AbstractCegarLoop]: Abstraction has 316 states and 419 transitions. [2022-03-20 02:29:50,116 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-20 02:29:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 419 transitions. [2022-03-20 02:29:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-20 02:29:50,117 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:50,118 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:50,118 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 02:29:50,118 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:50,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:50,118 INFO L85 PathProgramCache]: Analyzing trace with hash 359403676, now seen corresponding path program 1 times [2022-03-20 02:29:50,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:50,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59483721] [2022-03-20 02:29:50,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:50,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-20 02:29:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:29:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,263 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-20 02:29:50,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:50,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59483721] [2022-03-20 02:29:50,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59483721] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:50,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:50,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 02:29:50,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770016325] [2022-03-20 02:29:50,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:50,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 02:29:50,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:50,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 02:29:50,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-20 02:29:50,265 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-20 02:29:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:50,517 INFO L93 Difference]: Finished difference Result 330 states and 436 transitions. [2022-03-20 02:29:50,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 02:29:50,517 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-20 02:29:50,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:50,518 INFO L225 Difference]: With dead ends: 330 [2022-03-20 02:29:50,518 INFO L226 Difference]: Without dead ends: 102 [2022-03-20 02:29:50,519 INFO L912 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-20 02:29:50,519 INFO L913 BasicCegarLoop]: 247 mSDtfsCounter, 723 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:50,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 332 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 02:29:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-03-20 02:29:50,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-03-20 02:29:50,525 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-20 02:29:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2022-03-20 02:29:50,526 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 47 [2022-03-20 02:29:50,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:50,526 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2022-03-20 02:29:50,526 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-20 02:29:50,527 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-03-20 02:29:50,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-03-20 02:29:50,527 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:50,527 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:50,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 02:29:50,527 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:50,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:50,528 INFO L85 PathProgramCache]: Analyzing trace with hash -803867800, now seen corresponding path program 1 times [2022-03-20 02:29:50,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:50,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634725310] [2022-03-20 02:29:50,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:50,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-03-20 02:29:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-03-20 02:29:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,641 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-20 02:29:50,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:50,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634725310] [2022-03-20 02:29:50,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634725310] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:50,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:50,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 02:29:50,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097893691] [2022-03-20 02:29:50,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:50,642 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 02:29:50,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:50,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 02:29:50,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-20 02:29:50,642 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-20 02:29:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:50,873 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2022-03-20 02:29:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 02:29:50,873 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-20 02:29:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:50,874 INFO L225 Difference]: With dead ends: 130 [2022-03-20 02:29:50,874 INFO L226 Difference]: Without dead ends: 100 [2022-03-20 02:29:50,875 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-03-20 02:29:50,875 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 51 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:50,875 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 209 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 02:29:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-03-20 02:29:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-03-20 02:29:50,902 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-20 02:29:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-03-20 02:29:50,903 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2022-03-20 02:29:50,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:50,903 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-03-20 02:29:50,903 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-20 02:29:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-03-20 02:29:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-20 02:29:50,904 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:50,904 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:50,904 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-20 02:29:50,905 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:50,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:50,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1055877385, now seen corresponding path program 1 times [2022-03-20 02:29:50,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:50,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212287251] [2022-03-20 02:29:50,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:50,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 02:29:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,056 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-20 02:29:51,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:51,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212287251] [2022-03-20 02:29:51,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212287251] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:51,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:51,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 02:29:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20047383] [2022-03-20 02:29:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:51,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 02:29:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:51,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 02:29:51,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-20 02:29:51,057 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-20 02:29:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:51,261 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2022-03-20 02:29:51,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 02:29:51,261 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-20 02:29:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:51,262 INFO L225 Difference]: With dead ends: 152 [2022-03-20 02:29:51,262 INFO L226 Difference]: Without dead ends: 111 [2022-03-20 02:29:51,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:51,263 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 37 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:51,263 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 322 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 02:29:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-03-20 02:29:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2022-03-20 02:29:51,269 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-20 02:29:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-03-20 02:29:51,270 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2022-03-20 02:29:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:51,270 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-03-20 02:29:51,270 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-20 02:29:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-03-20 02:29:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-20 02:29:51,271 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:51,271 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:51,271 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-20 02:29:51,271 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:51,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:51,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1324274632, now seen corresponding path program 1 times [2022-03-20 02:29:51,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:51,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540457607] [2022-03-20 02:29:51,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:51,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 02:29:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,421 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-20 02:29:51,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:51,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540457607] [2022-03-20 02:29:51,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540457607] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:51,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:51,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 02:29:51,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422406978] [2022-03-20 02:29:51,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:51,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 02:29:51,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:51,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 02:29:51,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-20 02:29:51,423 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-20 02:29:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:51,617 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-03-20 02:29:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 02:29:51,618 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-20 02:29:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:51,618 INFO L225 Difference]: With dead ends: 116 [2022-03-20 02:29:51,618 INFO L226 Difference]: Without dead ends: 109 [2022-03-20 02:29:51,619 INFO L912 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-20 02:29:51,619 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 82 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:51,619 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 305 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-20 02:29:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2022-03-20 02:29:51,626 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-20 02:29:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2022-03-20 02:29:51,627 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2022-03-20 02:29:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:51,627 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2022-03-20 02:29:51,627 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-20 02:29:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2022-03-20 02:29:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-20 02:29:51,628 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:51,628 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:51,628 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-20 02:29:51,628 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2097337179, now seen corresponding path program 1 times [2022-03-20 02:29:51,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:51,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098574621] [2022-03-20 02:29:51,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:51,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 02:29:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,773 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-20 02:29:51,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:51,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098574621] [2022-03-20 02:29:51,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098574621] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:51,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:51,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 02:29:51,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862184209] [2022-03-20 02:29:51,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:51,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 02:29:51,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:51,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 02:29:51,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:51,774 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-20 02:29:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:51,875 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2022-03-20 02:29:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 02:29:51,876 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-20 02:29:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:51,877 INFO L225 Difference]: With dead ends: 142 [2022-03-20 02:29:51,877 INFO L226 Difference]: Without dead ends: 100 [2022-03-20 02:29:51,877 INFO L912 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-20 02:29:51,877 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 88 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:51,878 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 256 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-03-20 02:29:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-03-20 02:29:51,883 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-20 02:29:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2022-03-20 02:29:51,884 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 58 [2022-03-20 02:29:51,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:51,884 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2022-03-20 02:29:51,884 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-20 02:29:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-03-20 02:29:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-03-20 02:29:51,885 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:51,885 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:51,885 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-20 02:29:51,885 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:51,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:51,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1424142412, now seen corresponding path program 1 times [2022-03-20 02:29:51,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:51,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157470104] [2022-03-20 02:29:51,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:51,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 02:29:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:29:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,059 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-20 02:29:52,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:52,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157470104] [2022-03-20 02:29:52,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157470104] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:52,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:52,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:29:52,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926402785] [2022-03-20 02:29:52,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:52,060 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:29:52,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:52,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:29:52,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:52,061 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-20 02:29:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:52,367 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2022-03-20 02:29:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 02:29:52,367 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-20 02:29:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:52,368 INFO L225 Difference]: With dead ends: 128 [2022-03-20 02:29:52,368 INFO L226 Difference]: Without dead ends: 92 [2022-03-20 02:29:52,368 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-03-20 02:29:52,369 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 99 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:52,369 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 228 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 02:29:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-03-20 02:29:52,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-03-20 02:29:52,375 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-20 02:29:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-03-20 02:29:52,375 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 62 [2022-03-20 02:29:52,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:52,375 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-03-20 02:29:52,376 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-20 02:29:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-03-20 02:29:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 02:29:52,376 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:52,376 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:52,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-20 02:29:52,376 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:52,377 INFO L85 PathProgramCache]: Analyzing trace with hash -119468725, now seen corresponding path program 1 times [2022-03-20 02:29:52,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:52,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953675400] [2022-03-20 02:29:52,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:52,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 02:29:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:29:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,493 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-20 02:29:52,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:52,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953675400] [2022-03-20 02:29:52,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953675400] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:52,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:52,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 02:29:52,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108255367] [2022-03-20 02:29:52,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:52,493 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 02:29:52,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:52,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 02:29:52,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 02:29:52,494 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-20 02:29:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:52,585 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2022-03-20 02:29:52,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 02:29:52,586 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-20 02:29:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:52,586 INFO L225 Difference]: With dead ends: 126 [2022-03-20 02:29:52,586 INFO L226 Difference]: Without dead ends: 98 [2022-03-20 02:29:52,586 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 02:29:52,587 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 80 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:52,587 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 207 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-03-20 02:29:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2022-03-20 02:29:52,593 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-20 02:29:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2022-03-20 02:29:52,593 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 64 [2022-03-20 02:29:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:52,593 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2022-03-20 02:29:52,593 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-20 02:29:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-03-20 02:29:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 02:29:52,594 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:52,594 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:52,594 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-20 02:29:52,594 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:52,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash -706274739, now seen corresponding path program 1 times [2022-03-20 02:29:52,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:52,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565520923] [2022-03-20 02:29:52,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:52,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 02:29:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:29:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,708 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-20 02:29:52,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:52,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565520923] [2022-03-20 02:29:52,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565520923] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:52,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:52,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 02:29:52,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180347165] [2022-03-20 02:29:52,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:52,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 02:29:52,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:52,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 02:29:52,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 02:29:52,709 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-20 02:29:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:52,853 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-03-20 02:29:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 02:29:52,854 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-20 02:29:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:52,854 INFO L225 Difference]: With dead ends: 111 [2022-03-20 02:29:52,854 INFO L226 Difference]: Without dead ends: 106 [2022-03-20 02:29:52,854 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:52,855 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 78 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:52,855 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 205 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-03-20 02:29:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2022-03-20 02:29:52,861 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-20 02:29:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-03-20 02:29:52,862 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 64 [2022-03-20 02:29:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:52,862 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-03-20 02:29:52,862 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-20 02:29:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-03-20 02:29:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 02:29:52,862 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:52,862 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:52,863 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-20 02:29:52,863 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:52,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:52,863 INFO L85 PathProgramCache]: Analyzing trace with hash -348732964, now seen corresponding path program 1 times [2022-03-20 02:29:52,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:52,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813140056] [2022-03-20 02:29:52,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 02:29:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:29:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:53,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:53,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813140056] [2022-03-20 02:29:53,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813140056] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:53,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:53,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:29:53,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029702741] [2022-03-20 02:29:53,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:53,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:29:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:53,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:29:53,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:53,040 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-20 02:29:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:53,193 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-03-20 02:29:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 02:29:53,194 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-20 02:29:53,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:53,195 INFO L225 Difference]: With dead ends: 110 [2022-03-20 02:29:53,195 INFO L226 Difference]: Without dead ends: 103 [2022-03-20 02:29:53,195 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:29:53,195 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 88 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:53,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 323 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-03-20 02:29:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2022-03-20 02:29:53,203 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-20 02:29:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-03-20 02:29:53,203 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 64 [2022-03-20 02:29:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:53,204 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-03-20 02:29:53,204 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-20 02:29:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-03-20 02:29:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-20 02:29:53,204 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:53,204 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:53,204 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-20 02:29:53,205 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:53,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash -657469950, now seen corresponding path program 1 times [2022-03-20 02:29:53,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:53,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799892767] [2022-03-20 02:29:53,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:53,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 02:29:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:29:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,373 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-20 02:29:53,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:53,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799892767] [2022-03-20 02:29:53,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799892767] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:53,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:53,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:29:53,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469529474] [2022-03-20 02:29:53,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:53,374 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:29:53,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:53,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:29:53,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:53,374 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-20 02:29:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:53,676 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-03-20 02:29:53,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:29:53,677 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-20 02:29:53,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:53,677 INFO L225 Difference]: With dead ends: 100 [2022-03-20 02:29:53,677 INFO L226 Difference]: Without dead ends: 82 [2022-03-20 02:29:53,678 INFO L912 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-20 02:29:53,678 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 158 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:53,678 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 190 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:53,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-03-20 02:29:53,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-03-20 02:29:53,684 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-20 02:29:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-03-20 02:29:53,684 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2022-03-20 02:29:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:53,685 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-03-20 02:29:53,685 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-20 02:29:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-03-20 02:29:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-20 02:29:53,685 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:53,685 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:53,685 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-20 02:29:53,685 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:53,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:53,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1066121988, now seen corresponding path program 1 times [2022-03-20 02:29:53,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:53,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783286965] [2022-03-20 02:29:53,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:53,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 02:29:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:29:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:53,815 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-20 02:29:53,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:53,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783286965] [2022-03-20 02:29:53,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783286965] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:53,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:53,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 02:29:53,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827397994] [2022-03-20 02:29:53,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:53,816 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 02:29:53,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:53,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 02:29:53,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 02:29:53,816 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-20 02:29:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:53,958 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-03-20 02:29:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 02:29:53,958 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-20 02:29:53,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:53,959 INFO L225 Difference]: With dead ends: 98 [2022-03-20 02:29:53,959 INFO L226 Difference]: Without dead ends: 78 [2022-03-20 02:29:53,959 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:53,959 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 91 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:53,960 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 183 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:53,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-03-20 02:29:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-03-20 02:29:53,965 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-20 02:29:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-03-20 02:29:53,965 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2022-03-20 02:29:53,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:53,966 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-03-20 02:29:53,966 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-20 02:29:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-03-20 02:29:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-20 02:29:53,966 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:53,966 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:53,966 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-20 02:29:53,966 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1874002193, now seen corresponding path program 1 times [2022-03-20 02:29:53,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:53,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395023864] [2022-03-20 02:29:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 02:29:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:29:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,129 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-20 02:29:54,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:54,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395023864] [2022-03-20 02:29:54,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395023864] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:54,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:54,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:29:54,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431768720] [2022-03-20 02:29:54,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:54,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:29:54,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:54,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:29:54,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:54,131 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-20 02:29:54,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:54,333 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-03-20 02:29:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 02:29:54,333 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-20 02:29:54,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:54,334 INFO L225 Difference]: With dead ends: 87 [2022-03-20 02:29:54,334 INFO L226 Difference]: Without dead ends: 78 [2022-03-20 02:29:54,334 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:29:54,335 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 36 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:54,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 284 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 02:29:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-03-20 02:29:54,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-03-20 02:29:54,340 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-20 02:29:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-03-20 02:29:54,340 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2022-03-20 02:29:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:54,340 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-03-20 02:29:54,340 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-20 02:29:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-03-20 02:29:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-20 02:29:54,341 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:54,341 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:54,341 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-20 02:29:54,341 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:54,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:54,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2045810187, now seen corresponding path program 1 times [2022-03-20 02:29:54,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:54,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537917328] [2022-03-20 02:29:54,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:54,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 02:29:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:29:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-03-20 02:29:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,475 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-20 02:29:54,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:54,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537917328] [2022-03-20 02:29:54,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537917328] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:54,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:54,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 02:29:54,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678493358] [2022-03-20 02:29:54,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:54,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 02:29:54,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:54,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 02:29:54,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-03-20 02:29:54,477 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-20 02:29:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:54,627 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-03-20 02:29:54,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 02:29:54,627 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-20 02:29:54,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:54,627 INFO L225 Difference]: With dead ends: 78 [2022-03-20 02:29:54,627 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 02:29:54,628 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:29:54,628 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 24 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:54,628 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 145 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 02:29:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 02:29:54,629 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-20 02:29:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 02:29:54,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2022-03-20 02:29:54,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:54,629 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 02:29:54,629 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-20 02:29:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 02:29:54,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 02:29:54,631 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 02:29:54,631 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-20 02:29:54,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 02:29:57,397 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-03-20 02:29:57,398 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-03-20 02:29:57,398 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-03-20 02:29:57,398 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-20 02:29:57,398 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-20 02:29:57,398 INFO L882 garLoopResultBuilder]: For program point L624-1(line 624) no Hoare annotation was computed. [2022-03-20 02:29:57,398 INFO L882 garLoopResultBuilder]: For program point KbFilter_CompleteFINAL(lines 618 628) no Hoare annotation was computed. [2022-03-20 02:29:57,398 INFO L882 garLoopResultBuilder]: For program point KbFilter_CompleteEXIT(lines 618 628) no Hoare annotation was computed. [2022-03-20 02:29:57,398 INFO L882 garLoopResultBuilder]: For program point _BLAST_initFINAL(lines 57 78) no Hoare annotation was computed. [2022-03-20 02:29:57,398 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-20 02:29:57,398 INFO L882 garLoopResultBuilder]: For program point _BLAST_initEXIT(lines 57 78) no Hoare annotation was computed. [2022-03-20 02:29:57,399 INFO L882 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-03-20 02:29:57,399 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 295 466) no Hoare annotation was computed. [2022-03-20 02:29:57,399 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-20 02:29:57,399 INFO L882 garLoopResultBuilder]: For program point L432(lines 432 459) no Hoare annotation was computed. [2022-03-20 02:29:57,399 INFO L882 garLoopResultBuilder]: For program point L358(lines 358 411) no Hoare annotation was computed. [2022-03-20 02:29:57,399 INFO L882 garLoopResultBuilder]: For program point L449(lines 449 457) no Hoare annotation was computed. [2022-03-20 02:29:57,400 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-20 02:29:57,400 INFO L882 garLoopResultBuilder]: For program point L433(lines 433 439) no Hoare annotation was computed. [2022-03-20 02:29:57,400 INFO L882 garLoopResultBuilder]: For program point L400(line 400) no Hoare annotation was computed. [2022-03-20 02:29:57,400 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-20 02:29:57,400 INFO L882 garLoopResultBuilder]: For program point L450(lines 450 452) no Hoare annotation was computed. [2022-03-20 02:29:57,400 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-20 02:29:57,400 INFO L882 garLoopResultBuilder]: For program point L434(lines 434 436) no Hoare annotation was computed. [2022-03-20 02:29:57,400 INFO L882 garLoopResultBuilder]: For program point L368(lines 368 409) no Hoare annotation was computed. [2022-03-20 02:29:57,401 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 295 466) no Hoare annotation was computed. [2022-03-20 02:29:57,401 INFO L882 garLoopResultBuilder]: For program point L385(line 385) no Hoare annotation was computed. [2022-03-20 02:29:57,401 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-20 02:29:57,401 INFO L882 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2022-03-20 02:29:57,401 INFO L882 garLoopResultBuilder]: For program point L344(lines 330 413) no Hoare annotation was computed. [2022-03-20 02:29:57,401 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-20 02:29:57,401 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-20 02:29:57,401 INFO L882 garLoopResultBuilder]: For program point L328-1(lines 324 465) no Hoare annotation was computed. [2022-03-20 02:29:57,401 INFO L882 garLoopResultBuilder]: For program point L353(lines 353 412) no Hoare annotation was computed. [2022-03-20 02:29:57,401 INFO L882 garLoopResultBuilder]: For program point L395(line 395) no Hoare annotation was computed. [2022-03-20 02:29:57,401 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-20 02:29:57,401 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-20 02:29:57,401 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-20 02:29:57,402 INFO L882 garLoopResultBuilder]: For program point L363(lines 363 410) no Hoare annotation was computed. [2022-03-20 02:29:57,402 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-20 02:29:57,402 INFO L882 garLoopResultBuilder]: For program point L454(lines 454 456) no Hoare annotation was computed. [2022-03-20 02:29:57,402 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-20 02:29:57,402 INFO L882 garLoopResultBuilder]: For program point L380(line 380) no Hoare annotation was computed. [2022-03-20 02:29:57,402 INFO L882 garLoopResultBuilder]: For program point L339(lines 339 342) no Hoare annotation was computed. [2022-03-20 02:29:57,402 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-20 02:29:57,402 INFO L882 garLoopResultBuilder]: For program point L430(lines 414 463) no Hoare annotation was computed. [2022-03-20 02:29:57,402 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-20 02:29:57,402 INFO L882 garLoopResultBuilder]: For program point L373(lines 373 408) no Hoare annotation was computed. [2022-03-20 02:29:57,402 INFO L882 garLoopResultBuilder]: For program point L431(lines 431 460) no Hoare annotation was computed. [2022-03-20 02:29:57,402 INFO L882 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-03-20 02:29:57,402 INFO L882 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2022-03-20 02:29:57,402 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-20 02:29:57,402 INFO L882 garLoopResultBuilder]: For program point L475-1(lines 467 480) no Hoare annotation was computed. [2022-03-20 02:29:57,403 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-20 02:29:57,403 INFO L882 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 467 480) no Hoare annotation was computed. [2022-03-20 02:29:57,403 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-20 02:29:57,403 INFO L882 garLoopResultBuilder]: For program point PoCallDriverEXIT(lines 745 821) no Hoare annotation was computed. [2022-03-20 02:29:57,403 INFO L882 garLoopResultBuilder]: For program point L754(lines 754 766) no Hoare annotation was computed. [2022-03-20 02:29:57,403 INFO L882 garLoopResultBuilder]: For program point L754-1(lines 754 766) no Hoare annotation was computed. [2022-03-20 02:29:57,403 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-20 02:29:57,403 INFO L882 garLoopResultBuilder]: For program point L800(lines 800 806) no Hoare annotation was computed. [2022-03-20 02:29:57,403 INFO L882 garLoopResultBuilder]: For program point PoCallDriverFINAL(lines 745 821) no Hoare annotation was computed. [2022-03-20 02:29:57,403 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-20 02:29:57,403 INFO L882 garLoopResultBuilder]: For program point L809(lines 809 816) no Hoare annotation was computed. [2022-03-20 02:29:57,403 INFO L882 garLoopResultBuilder]: For program point L797(lines 797 817) no Hoare annotation was computed. [2022-03-20 02:29:57,403 INFO L882 garLoopResultBuilder]: For program point L760(lines 760 764) no Hoare annotation was computed. [2022-03-20 02:29:57,403 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-20 02:29:57,403 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-20 02:29:57,403 INFO L882 garLoopResultBuilder]: For program point L756-1(line 756) no Hoare annotation was computed. [2022-03-20 02:29:57,403 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-20 02:29:57,403 INFO L882 garLoopResultBuilder]: For program point L814-1(lines 793 818) no Hoare annotation was computed. [2022-03-20 02:29:57,403 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-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point L769(lines 769 792) no Hoare annotation was computed. [2022-03-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point L774(lines 774 791) no Hoare annotation was computed. [2022-03-20 02:29:57,404 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-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point L638(lines 638 656) no Hoare annotation was computed. [2022-03-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point KbFilter_CreateCloseEXIT(lines 629 664) no Hoare annotation was computed. [2022-03-20 02:29:57,404 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-20 02:29:57,404 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-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point L641(lines 641 655) no Hoare annotation was computed. [2022-03-20 02:29:57,404 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-20 02:29:57,404 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-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point L660-1(line 660) no Hoare annotation was computed. [2022-03-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point KbFilter_CreateCloseFINAL(lines 629 664) no Hoare annotation was computed. [2022-03-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point L644(lines 644 654) no Hoare annotation was computed. [2022-03-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point L956(lines 956 958) no Hoare annotation was computed. [2022-03-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point L956-2(lines 934 971) no Hoare annotation was computed. [2022-03-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point KbFilter_InternIoCtlEXIT(lines 822 1007) no Hoare annotation was computed. [2022-03-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point L940(lines 940 943) no Hoare annotation was computed. [2022-03-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point L903(lines 903 982) no Hoare annotation was computed. [2022-03-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point L924(lines 924 976) no Hoare annotation was computed. [2022-03-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point L891(lines 891 986) no Hoare annotation was computed. [2022-03-20 02:29:57,404 INFO L882 garLoopResultBuilder]: For program point L883(lines 883 988) no Hoare annotation was computed. [2022-03-20 02:29:57,405 INFO L882 garLoopResultBuilder]: For program point L875(lines 875 990) no Hoare annotation was computed. [2022-03-20 02:29:57,405 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-20 02:29:57,405 INFO L882 garLoopResultBuilder]: For program point L1003-1(line 1003) no Hoare annotation was computed. [2022-03-20 02:29:57,405 INFO L882 garLoopResultBuilder]: For program point L896(lines 896 984) no Hoare annotation was computed. [2022-03-20 02:29:57,405 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-20 02:29:57,405 INFO L882 garLoopResultBuilder]: For program point L917(lines 917 978) no Hoare annotation was computed. [2022-03-20 02:29:57,405 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-20 02:29:57,405 INFO L882 garLoopResultBuilder]: For program point L934(lines 934 973) no Hoare annotation was computed. [2022-03-20 02:29:57,405 INFO L882 garLoopResultBuilder]: For program point L959-1(lines 959 961) no Hoare annotation was computed. [2022-03-20 02:29:57,405 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-20 02:29:57,405 INFO L882 garLoopResultBuilder]: For program point L910(lines 910 980) no Hoare annotation was computed. [2022-03-20 02:29:57,405 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-20 02:29:57,405 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-20 02:29:57,405 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-20 02:29:57,405 INFO L882 garLoopResultBuilder]: For program point L997-1(line 997) no Hoare annotation was computed. [2022-03-20 02:29:57,405 INFO L882 garLoopResultBuilder]: For program point KbFilter_InternIoCtlFINAL(lines 822 1007) no Hoare annotation was computed. [2022-03-20 02:29:57,405 INFO L882 garLoopResultBuilder]: For program point L931(lines 931 974) no Hoare annotation was computed. [2022-03-20 02:29:57,405 INFO L882 garLoopResultBuilder]: For program point L603(lines 603 615) no Hoare annotation was computed. [2022-03-20 02:29:57,405 INFO L882 garLoopResultBuilder]: For program point KeWaitForSingleObjectEXIT(lines 576 617) no Hoare annotation was computed. [2022-03-20 02:29:57,406 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-20 02:29:57,406 INFO L882 garLoopResultBuilder]: For program point L581(lines 581 600) no Hoare annotation was computed. [2022-03-20 02:29:57,406 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-20 02:29:57,406 INFO L882 garLoopResultBuilder]: For program point KeWaitForSingleObjectFINAL(lines 576 617) no Hoare annotation was computed. [2022-03-20 02:29:57,406 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-20 02:29:57,406 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-20 02:29:57,406 INFO L882 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2022-03-20 02:29:57,406 INFO L882 garLoopResultBuilder]: For program point L594-1(lines 581 600) no Hoare annotation was computed. [2022-03-20 02:29:57,406 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-20 02:29:57,406 INFO L882 garLoopResultBuilder]: For program point L582(lines 582 587) no Hoare annotation was computed. [2022-03-20 02:29:57,406 INFO L882 garLoopResultBuilder]: For program point L562-1(lines 554 567) no Hoare annotation was computed. [2022-03-20 02:29:57,406 INFO L882 garLoopResultBuilder]: For program point L558(lines 558 564) no Hoare annotation was computed. [2022-03-20 02:29:57,406 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-20 02:29:57,406 INFO L882 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 554 567) no Hoare annotation was computed. [2022-03-20 02:29:57,407 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-20 02:29:57,407 INFO L882 garLoopResultBuilder]: For program point L258-1(lines 254 260) no Hoare annotation was computed. [2022-03-20 02:29:57,407 INFO L882 garLoopResultBuilder]: For program point L159(lines 159 274) no Hoare annotation was computed. [2022-03-20 02:29:57,407 INFO L882 garLoopResultBuilder]: For program point L126(lines 126 285) no Hoare annotation was computed. [2022-03-20 02:29:57,407 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-20 02:29:57,407 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-20 02:29:57,407 INFO L882 garLoopResultBuilder]: For program point L168(lines 168 271) no Hoare annotation was computed. [2022-03-20 02:29:57,407 INFO L882 garLoopResultBuilder]: For program point L201-1(lines 201 203) no Hoare annotation was computed. [2022-03-20 02:29:57,407 INFO L882 garLoopResultBuilder]: For program point L135(lines 135 282) no Hoare annotation was computed. [2022-03-20 02:29:57,407 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-20 02:29:57,407 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-20 02:29:57,407 INFO L882 garLoopResultBuilder]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2022-03-20 02:29:57,407 INFO L882 garLoopResultBuilder]: For program point L177(lines 177 189) no Hoare annotation was computed. [2022-03-20 02:29:57,407 INFO L882 garLoopResultBuilder]: For program point L144(lines 144 279) no Hoare annotation was computed. [2022-03-20 02:29:57,407 INFO L882 garLoopResultBuilder]: For program point L111(lines 111 290) no Hoare annotation was computed. [2022-03-20 02:29:57,407 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-20 02:29:57,408 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-20 02:29:57,408 INFO L882 garLoopResultBuilder]: For program point L227-1(lines 223 229) no Hoare annotation was computed. [2022-03-20 02:29:57,408 INFO L882 garLoopResultBuilder]: For program point L194-1(lines 194 195) no Hoare annotation was computed. [2022-03-20 02:29:57,408 INFO L882 garLoopResultBuilder]: For program point L153(lines 153 276) no Hoare annotation was computed. [2022-03-20 02:29:57,408 INFO L882 garLoopResultBuilder]: For program point L120(lines 120 287) no Hoare annotation was computed. [2022-03-20 02:29:57,408 INFO L882 garLoopResultBuilder]: For program point KbFilter_PnPEXIT(lines 81 294) no Hoare annotation was computed. [2022-03-20 02:29:57,408 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-20 02:29:57,408 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-20 02:29:57,408 INFO L882 garLoopResultBuilder]: For program point L162(lines 162 273) no Hoare annotation was computed. [2022-03-20 02:29:57,408 INFO L882 garLoopResultBuilder]: For program point L129(lines 129 284) no Hoare annotation was computed. [2022-03-20 02:29:57,408 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-20 02:29:57,408 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-20 02:29:57,408 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-20 02:29:57,408 INFO L882 garLoopResultBuilder]: For program point L138(lines 138 281) no Hoare annotation was computed. [2022-03-20 02:29:57,408 INFO L882 garLoopResultBuilder]: For program point KbFilter_PnPFINAL(lines 81 294) no Hoare annotation was computed. [2022-03-20 02:29:57,408 INFO L882 garLoopResultBuilder]: For program point L147(lines 147 278) no Hoare annotation was computed. [2022-03-20 02:29:57,408 INFO L882 garLoopResultBuilder]: For program point L114(lines 114 289) no Hoare annotation was computed. [2022-03-20 02:29:57,408 INFO L882 garLoopResultBuilder]: For program point L156(lines 156 275) no Hoare annotation was computed. [2022-03-20 02:29:57,408 INFO L882 garLoopResultBuilder]: For program point L123(lines 123 286) no Hoare annotation was computed. [2022-03-20 02:29:57,408 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-20 02:29:57,409 INFO L882 garLoopResultBuilder]: For program point L239(lines 239 245) no Hoare annotation was computed. [2022-03-20 02:29:57,409 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-20 02:29:57,409 INFO L882 garLoopResultBuilder]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2022-03-20 02:29:57,409 INFO L882 garLoopResultBuilder]: For program point L165(lines 165 272) no Hoare annotation was computed. [2022-03-20 02:29:57,409 INFO L882 garLoopResultBuilder]: For program point L132(lines 132 283) no Hoare annotation was computed. [2022-03-20 02:29:57,409 INFO L882 garLoopResultBuilder]: For program point L223(lines 223 229) no Hoare annotation was computed. [2022-03-20 02:29:57,409 INFO L882 garLoopResultBuilder]: For program point L182(lines 182 188) no Hoare annotation was computed. [2022-03-20 02:29:57,409 INFO L882 garLoopResultBuilder]: For program point L182-1(lines 177 189) no Hoare annotation was computed. [2022-03-20 02:29:57,409 INFO L882 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-03-20 02:29:57,410 INFO L882 garLoopResultBuilder]: For program point L141(lines 141 280) no Hoare annotation was computed. [2022-03-20 02:29:57,410 INFO L882 garLoopResultBuilder]: For program point L108(lines 108 291) no Hoare annotation was computed. [2022-03-20 02:29:57,411 INFO L882 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2022-03-20 02:29:57,411 INFO L882 garLoopResultBuilder]: For program point L199-2(lines 172 268) no Hoare annotation was computed. [2022-03-20 02:29:57,411 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-20 02:29:57,411 INFO L882 garLoopResultBuilder]: For program point L249-1(line 249) no Hoare annotation was computed. [2022-03-20 02:29:57,412 INFO L882 garLoopResultBuilder]: For program point L150(lines 150 277) no Hoare annotation was computed. [2022-03-20 02:29:57,412 INFO L882 garLoopResultBuilder]: For program point L117(lines 117 288) no Hoare annotation was computed. [2022-03-20 02:29:57,412 INFO L882 garLoopResultBuilder]: For program point L208(lines 208 212) no Hoare annotation was computed. [2022-03-20 02:29:57,412 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-20 02:29:57,412 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-20 02:29:57,412 INFO L882 garLoopResultBuilder]: For program point L233-1(lines 233 234) no Hoare annotation was computed. [2022-03-20 02:29:57,412 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-20 02:29:57,412 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-20 02:29:57,412 INFO L882 garLoopResultBuilder]: For program point KeSetEventFINAL(lines 568 575) no Hoare annotation was computed. [2022-03-20 02:29:57,412 INFO L882 garLoopResultBuilder]: For program point KeSetEventEXIT(lines 568 575) no Hoare annotation was computed. [2022-03-20 02:29:57,412 INFO L882 garLoopResultBuilder]: For program point L700(lines 700 729) no Hoare annotation was computed. [2022-03-20 02:29:57,412 INFO L882 garLoopResultBuilder]: For program point KbFilter_PowerEXIT(lines 689 744) no Hoare annotation was computed. [2022-03-20 02:29:57,412 INFO L882 garLoopResultBuilder]: For program point L709(lines 709 726) no Hoare annotation was computed. [2022-03-20 02:29:57,412 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-20 02:29:57,412 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-20 02:29:57,412 INFO L882 garLoopResultBuilder]: For program point L740-1(line 740) no Hoare annotation was computed. [2022-03-20 02:29:57,412 INFO L882 garLoopResultBuilder]: For program point L703(lines 703 728) no Hoare annotation was computed. [2022-03-20 02:29:57,412 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-20 02:29:57,412 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-20 02:29:57,412 INFO L882 garLoopResultBuilder]: For program point L734-1(lines 730 736) no Hoare annotation was computed. [2022-03-20 02:29:57,413 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-20 02:29:57,413 INFO L882 garLoopResultBuilder]: For program point KbFilter_PowerFINAL(lines 689 744) no Hoare annotation was computed. [2022-03-20 02:29:57,413 INFO L882 garLoopResultBuilder]: For program point L706(lines 706 727) no Hoare annotation was computed. [2022-03-20 02:29:57,413 INFO L882 garLoopResultBuilder]: For program point stub_driver_initEXIT(lines 43 56) no Hoare annotation was computed. [2022-03-20 02:29:57,413 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-20 02:29:57,413 INFO L882 garLoopResultBuilder]: For program point stub_driver_initFINAL(lines 43 56) no Hoare annotation was computed. [2022-03-20 02:29:57,413 INFO L885 garLoopResultBuilder]: At program point errorFnENTRY(lines 1009 1016) the Hoare annotation is: true [2022-03-20 02:29:57,413 INFO L882 garLoopResultBuilder]: For program point errorFnFINAL(lines 1009 1016) no Hoare annotation was computed. [2022-03-20 02:29:57,413 INFO L882 garLoopResultBuilder]: For program point errorFnEXIT(lines 1009 1016) no Hoare annotation was computed. [2022-03-20 02:29:57,413 INFO L882 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2022-03-20 02:29:57,413 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-20 02:29:57,414 INFO L882 garLoopResultBuilder]: For program point L532(lines 532 549) no Hoare annotation was computed. [2022-03-20 02:29:57,414 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-20 02:29:57,414 INFO L882 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2022-03-20 02:29:57,414 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-20 02:29:57,414 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-20 02:29:57,414 INFO L882 garLoopResultBuilder]: For program point L491-1(line 491) no Hoare annotation was computed. [2022-03-20 02:29:57,414 INFO L882 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 481 553) no Hoare annotation was computed. [2022-03-20 02:29:57,414 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-20 02:29:57,414 INFO L882 garLoopResultBuilder]: For program point L541(lines 541 548) no Hoare annotation was computed. [2022-03-20 02:29:57,414 INFO L882 garLoopResultBuilder]: For program point L504(lines 504 527) no Hoare annotation was computed. [2022-03-20 02:29:57,414 INFO L882 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 481 553) no Hoare annotation was computed. [2022-03-20 02:29:57,414 INFO L882 garLoopResultBuilder]: For program point L533(lines 533 539) no Hoare annotation was computed. [2022-03-20 02:29:57,414 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-20 02:29:57,414 INFO L882 garLoopResultBuilder]: For program point L546-1(lines 528 550) no Hoare annotation was computed. [2022-03-20 02:29:57,414 INFO L882 garLoopResultBuilder]: For program point L509(lines 509 526) no Hoare annotation was computed. [2022-03-20 02:29:57,414 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-20 02:29:57,415 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-20 02:29:57,415 INFO L882 garLoopResultBuilder]: For program point L489(lines 489 501) no Hoare annotation was computed. [2022-03-20 02:29:57,415 INFO L882 garLoopResultBuilder]: For program point L489-1(lines 489 501) no Hoare annotation was computed. [2022-03-20 02:29:57,415 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-03-20 02:29:57,415 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-20 02:29:57,415 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-03-20 02:29:57,415 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-03-20 02:29:57,415 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-20 02:29:57,415 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 02:29:57,415 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-03-20 02:29:57,416 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-20 02:29:57,416 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-20 02:29:57,416 INFO L882 garLoopResultBuilder]: For program point L684-1(line 684) no Hoare annotation was computed. [2022-03-20 02:29:57,416 INFO L882 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughFINAL(lines 665 688) no Hoare annotation was computed. [2022-03-20 02:29:57,416 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-20 02:29:57,416 INFO L882 garLoopResultBuilder]: For program point L678-1(lines 674 680) no Hoare annotation was computed. [2022-03-20 02:29:57,416 INFO L882 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughEXIT(lines 665 688) no Hoare annotation was computed. [2022-03-20 02:29:57,416 INFO L882 garLoopResultBuilder]: For program point L674(lines 674 680) no Hoare annotation was computed. [2022-03-20 02:29:57,418 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:57,422 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 02:29:57,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 02:29:57 BoogieIcfgContainer [2022-03-20 02:29:57,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 02:29:57,463 INFO L158 Benchmark]: Toolchain (without parser) took 14749.70ms. Allocated memory was 183.5MB in the beginning and 343.9MB in the end (delta: 160.4MB). Free memory was 132.6MB in the beginning and 131.5MB in the end (delta: 1.1MB). Peak memory consumption was 174.6MB. Max. memory is 8.0GB. [2022-03-20 02:29:57,463 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 02:29:57,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.17ms. Allocated memory is still 183.5MB. Free memory was 132.4MB in the beginning and 151.8MB in the end (delta: -19.4MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2022-03-20 02:29:57,464 INFO L158 Benchmark]: Boogie Preprocessor took 63.89ms. Allocated memory is still 183.5MB. Free memory was 151.8MB in the beginning and 149.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 02:29:57,464 INFO L158 Benchmark]: RCFGBuilder took 762.89ms. Allocated memory is still 183.5MB. Free memory was 149.1MB in the beginning and 115.1MB in the end (delta: 33.9MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-03-20 02:29:57,464 INFO L158 Benchmark]: TraceAbstraction took 13540.05ms. Allocated memory was 183.5MB in the beginning and 343.9MB in the end (delta: 160.4MB). Free memory was 114.7MB in the beginning and 131.5MB in the end (delta: -16.8MB). Peak memory consumption was 157.0MB. Max. memory is 8.0GB. [2022-03-20 02:29:57,465 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.09ms. Allocated memory is still 183.5MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 378.17ms. Allocated memory is still 183.5MB. Free memory was 132.4MB in the beginning and 151.8MB in the end (delta: -19.4MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.89ms. Allocated memory is still 183.5MB. Free memory was 151.8MB in the beginning and 149.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 762.89ms. Allocated memory is still 183.5MB. Free memory was 149.1MB in the beginning and 115.1MB in the end (delta: 33.9MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13540.05ms. Allocated memory was 183.5MB in the beginning and 343.9MB in the end (delta: 160.4MB). Free memory was 114.7MB in the beginning and 131.5MB in the end (delta: -16.8MB). Peak memory consumption was 157.0MB. 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: 13.4s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5532 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5517 mSDsluCounter, 6314 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3219 mSDsCounter, 1258 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6234 IncrementalHoareTripleChecker+Invalid, 7492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1258 mSolverCounterUnsat, 3095 mSDtfsCounter, 6234 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.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 149 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 326 PreInvPairs, 404 NumberOfFragments, 4116 HoareAnnotationTreeSize, 326 FomulaSimplifications, 624 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 84 FomulaSimplificationsInter, 2833 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1048 NumberOfCodeBlocks, 1048 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1028 ConstructedInterpolants, 0 QuantifiedInterpolants, 4925 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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)) RESULT: Ultimate proved your program to be correct! [2022-03-20 02:29:57,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...