java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:05:23,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:05:23,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:05:23,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:05:23,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:05:23,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:05:23,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:05:23,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:05:23,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:05:23,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:05:23,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:05:23,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:05:23,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:05:23,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:05:23,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:05:23,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:05:23,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:05:23,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:05:23,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:05:23,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:05:23,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:05:23,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:05:23,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:05:23,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:05:23,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:05:23,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:05:23,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:05:23,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:05:23,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:05:23,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:05:23,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:05:23,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:05:23,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:05:23,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:05:23,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:05:23,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:05:23,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:05:23,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:05:23,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:05:23,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:05:23,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:05:23,525 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 [2019-10-15 03:05:23,546 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:05:23,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:05:23,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:05:23,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:05:23,553 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:05:23,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:05:23,553 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:05:23,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:05:23,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:05:23,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:05:23,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:05:23,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:05:23,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:05:23,556 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:05:23,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:05:23,557 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:05:23,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:05:23,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:05:23,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:05:23,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:05:23,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:05:23,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:05:23,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:05:23,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:05:23,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:05:23,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:05:23,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:05:23,561 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:05:23,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:05:23,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:05:23,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:05:23,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:05:23,857 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:05:23,857 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:05:23,858 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-10-15 03:05:23,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fba44238/688f3b51dd67405082d24db25bc7138c/FLAG9d9cfab1a [2019-10-15 03:05:24,501 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:05:24,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-10-15 03:05:24,528 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fba44238/688f3b51dd67405082d24db25bc7138c/FLAG9d9cfab1a [2019-10-15 03:05:24,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fba44238/688f3b51dd67405082d24db25bc7138c [2019-10-15 03:05:24,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:05:24,878 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:05:24,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:05:24,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:05:24,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:05:24,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:05:24" (1/1) ... [2019-10-15 03:05:24,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d0e25df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:24, skipping insertion in model container [2019-10-15 03:05:24,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:05:24" (1/1) ... [2019-10-15 03:05:24,895 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:05:24,937 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:05:25,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:05:25,286 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:05:25,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:05:25,492 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:05:25,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:25 WrapperNode [2019-10-15 03:05:25,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:05:25,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:05:25,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:05:25,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:05:25,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:25" (1/1) ... [2019-10-15 03:05:25,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:25" (1/1) ... [2019-10-15 03:05:25,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:25" (1/1) ... [2019-10-15 03:05:25,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:25" (1/1) ... [2019-10-15 03:05:25,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:25" (1/1) ... [2019-10-15 03:05:25,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:25" (1/1) ... [2019-10-15 03:05:25,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:25" (1/1) ... [2019-10-15 03:05:25,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:05:25,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:05:25,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:05:25,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:05:25,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:05:25,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:05:25,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:05:25,647 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-15 03:05:25,647 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-15 03:05:25,648 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-10-15 03:05:25,648 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:05:25,649 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-15 03:05:25,649 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-15 03:05:25,649 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-15 03:05:25,650 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-15 03:05:25,650 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-15 03:05:25,652 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-10-15 03:05:25,653 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-10-15 03:05:25,653 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-10-15 03:05:25,654 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-10-15 03:05:25,654 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-15 03:05:25,654 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-10-15 03:05:25,654 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-15 03:05:25,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:05:25,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:05:25,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:05:25,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:05:25,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:05:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-15 03:05:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-10-15 03:05:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-15 03:05:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-15 03:05:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-15 03:05:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-10-15 03:05:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-10-15 03:05:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-10-15 03:05:25,660 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-10-15 03:05:25,660 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-10-15 03:05:25,660 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-15 03:05:25,661 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-15 03:05:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-15 03:05:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-15 03:05:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:05:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-15 03:05:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:05:25,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:05:25,980 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:26,061 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-15 03:05:26,062 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-15 03:05:26,093 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:26,251 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-15 03:05:26,252 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-15 03:05:26,253 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:26,295 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-15 03:05:26,295 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-15 03:05:26,301 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:26,343 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-15 03:05:26,343 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-15 03:05:26,511 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:26,565 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-15 03:05:26,566 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-15 03:05:26,593 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:26,701 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-10-15 03:05:26,701 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-10-15 03:05:27,206 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:05:27,207 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:05:27,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:27 BoogieIcfgContainer [2019-10-15 03:05:27,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:05:27,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:05:27,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:05:27,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:05:27,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:05:24" (1/3) ... [2019-10-15 03:05:27,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1075d39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:05:27, skipping insertion in model container [2019-10-15 03:05:27,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:25" (2/3) ... [2019-10-15 03:05:27,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1075d39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:05:27, skipping insertion in model container [2019-10-15 03:05:27,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:27" (3/3) ... [2019-10-15 03:05:27,220 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2019-10-15 03:05:27,230 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:05:27,245 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:05:27,257 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:05:27,293 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:05:27,293 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:05:27,293 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:05:27,293 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:05:27,293 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:05:27,293 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:05:27,293 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:05:27,294 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:05:27,315 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states. [2019-10-15 03:05:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:05:27,322 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:27,323 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:27,325 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:27,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:27,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1263961662, now seen corresponding path program 1 times [2019-10-15 03:05:27,339 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:27,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987965404] [2019-10-15 03:05:27,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:27,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987965404] [2019-10-15 03:05:27,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:27,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:27,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404699144] [2019-10-15 03:05:27,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:27,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:27,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:27,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:27,641 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 3 states. [2019-10-15 03:05:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:27,747 INFO L93 Difference]: Finished difference Result 291 states and 428 transitions. [2019-10-15 03:05:27,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:27,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 03:05:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:27,764 INFO L225 Difference]: With dead ends: 291 [2019-10-15 03:05:27,765 INFO L226 Difference]: Without dead ends: 166 [2019-10-15 03:05:27,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-15 03:05:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-10-15 03:05:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-15 03:05:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 221 transitions. [2019-10-15 03:05:27,833 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 221 transitions. Word has length 18 [2019-10-15 03:05:27,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:27,833 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 221 transitions. [2019-10-15 03:05:27,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 221 transitions. [2019-10-15 03:05:27,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 03:05:27,835 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:27,836 INFO L380 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] [2019-10-15 03:05:27,836 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:27,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:27,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1970687131, now seen corresponding path program 1 times [2019-10-15 03:05:27,838 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:27,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958453689] [2019-10-15 03:05:27,839 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,839 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:27,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958453689] [2019-10-15 03:05:27,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:27,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:27,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311162115] [2019-10-15 03:05:27,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:27,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:27,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:27,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:27,987 INFO L87 Difference]: Start difference. First operand 166 states and 221 transitions. Second operand 3 states. [2019-10-15 03:05:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:28,170 INFO L93 Difference]: Finished difference Result 232 states and 304 transitions. [2019-10-15 03:05:28,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:28,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 03:05:28,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:28,175 INFO L225 Difference]: With dead ends: 232 [2019-10-15 03:05:28,175 INFO L226 Difference]: Without dead ends: 184 [2019-10-15 03:05:28,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-15 03:05:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-10-15 03:05:28,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-15 03:05:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 235 transitions. [2019-10-15 03:05:28,201 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 235 transitions. Word has length 22 [2019-10-15 03:05:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:28,201 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 235 transitions. [2019-10-15 03:05:28,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2019-10-15 03:05:28,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 03:05:28,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:28,203 INFO L380 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] [2019-10-15 03:05:28,203 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:28,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash 961751251, now seen corresponding path program 1 times [2019-10-15 03:05:28,204 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:28,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541875335] [2019-10-15 03:05:28,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:28,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541875335] [2019-10-15 03:05:28,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:28,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021422583] [2019-10-15 03:05:28,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:28,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:28,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:28,286 INFO L87 Difference]: Start difference. First operand 182 states and 235 transitions. Second operand 3 states. [2019-10-15 03:05:28,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:28,330 INFO L93 Difference]: Finished difference Result 283 states and 362 transitions. [2019-10-15 03:05:28,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:28,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 03:05:28,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:28,334 INFO L225 Difference]: With dead ends: 283 [2019-10-15 03:05:28,335 INFO L226 Difference]: Without dead ends: 217 [2019-10-15 03:05:28,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:28,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-15 03:05:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2019-10-15 03:05:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-10-15 03:05:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 251 transitions. [2019-10-15 03:05:28,370 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 251 transitions. Word has length 23 [2019-10-15 03:05:28,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:28,370 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 251 transitions. [2019-10-15 03:05:28,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 251 transitions. [2019-10-15 03:05:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 03:05:28,373 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:28,373 INFO L380 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] [2019-10-15 03:05:28,374 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:28,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:28,374 INFO L82 PathProgramCache]: Analyzing trace with hash 231119792, now seen corresponding path program 1 times [2019-10-15 03:05:28,375 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:28,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750278297] [2019-10-15 03:05:28,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:28,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750278297] [2019-10-15 03:05:28,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:28,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858340613] [2019-10-15 03:05:28,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:28,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:28,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:28,494 INFO L87 Difference]: Start difference. First operand 197 states and 251 transitions. Second operand 3 states. [2019-10-15 03:05:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:28,631 INFO L93 Difference]: Finished difference Result 200 states and 253 transitions. [2019-10-15 03:05:28,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:28,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 03:05:28,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:28,642 INFO L225 Difference]: With dead ends: 200 [2019-10-15 03:05:28,643 INFO L226 Difference]: Without dead ends: 196 [2019-10-15 03:05:28,644 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-15 03:05:28,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-10-15 03:05:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-15 03:05:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2019-10-15 03:05:28,670 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 30 [2019-10-15 03:05:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:28,671 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2019-10-15 03:05:28,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2019-10-15 03:05:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 03:05:28,674 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:28,674 INFO L380 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] [2019-10-15 03:05:28,674 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:28,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash 866474743, now seen corresponding path program 1 times [2019-10-15 03:05:28,675 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:28,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503727348] [2019-10-15 03:05:28,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:28,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503727348] [2019-10-15 03:05:28,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:05:28,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579564298] [2019-10-15 03:05:28,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:05:28,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:05:28,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:05:28,748 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand 4 states. [2019-10-15 03:05:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:28,865 INFO L93 Difference]: Finished difference Result 238 states and 294 transitions. [2019-10-15 03:05:28,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:05:28,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-15 03:05:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:28,869 INFO L225 Difference]: With dead ends: 238 [2019-10-15 03:05:28,870 INFO L226 Difference]: Without dead ends: 191 [2019-10-15 03:05:28,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:05:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-15 03:05:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2019-10-15 03:05:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-10-15 03:05:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 216 transitions. [2019-10-15 03:05:28,899 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 216 transitions. Word has length 37 [2019-10-15 03:05:28,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:28,900 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 216 transitions. [2019-10-15 03:05:28,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:05:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 216 transitions. [2019-10-15 03:05:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 03:05:28,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:28,904 INFO L380 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] [2019-10-15 03:05:28,905 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:28,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:28,907 INFO L82 PathProgramCache]: Analyzing trace with hash 495734487, now seen corresponding path program 1 times [2019-10-15 03:05:28,907 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:28,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497490521] [2019-10-15 03:05:28,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:28,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497490521] [2019-10-15 03:05:28,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:28,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657609290] [2019-10-15 03:05:28,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:28,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:28,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:28,978 INFO L87 Difference]: Start difference. First operand 174 states and 216 transitions. Second operand 3 states. [2019-10-15 03:05:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:29,003 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-10-15 03:05:29,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:29,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-15 03:05:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:29,006 INFO L225 Difference]: With dead ends: 183 [2019-10-15 03:05:29,006 INFO L226 Difference]: Without dead ends: 66 [2019-10-15 03:05:29,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-15 03:05:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-15 03:05:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-15 03:05:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-10-15 03:05:29,013 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 40 [2019-10-15 03:05:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:29,014 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-10-15 03:05:29,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-10-15 03:05:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:05:29,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:29,016 INFO L380 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] [2019-10-15 03:05:29,016 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:29,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:29,016 INFO L82 PathProgramCache]: Analyzing trace with hash -148659379, now seen corresponding path program 1 times [2019-10-15 03:05:29,017 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:29,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361009923] [2019-10-15 03:05:29,017 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,017 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:29,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361009923] [2019-10-15 03:05:29,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:29,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:29,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473124199] [2019-10-15 03:05:29,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:29,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:29,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:29,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:29,081 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 3 states. [2019-10-15 03:05:29,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:29,124 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2019-10-15 03:05:29,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:29,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-15 03:05:29,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:29,126 INFO L225 Difference]: With dead ends: 87 [2019-10-15 03:05:29,127 INFO L226 Difference]: Without dead ends: 64 [2019-10-15 03:05:29,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:29,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-15 03:05:29,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-10-15 03:05:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-15 03:05:29,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-10-15 03:05:29,134 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 44 [2019-10-15 03:05:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:29,135 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-10-15 03:05:29,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-10-15 03:05:29,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 03:05:29,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:29,138 INFO L380 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] [2019-10-15 03:05:29,138 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:29,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:29,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1042710899, now seen corresponding path program 1 times [2019-10-15 03:05:29,139 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:29,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176137481] [2019-10-15 03:05:29,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:29,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176137481] [2019-10-15 03:05:29,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:29,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:29,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272223520] [2019-10-15 03:05:29,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:29,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:29,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:29,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:29,296 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-10-15 03:05:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:29,314 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2019-10-15 03:05:29,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:29,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-15 03:05:29,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:29,316 INFO L225 Difference]: With dead ends: 85 [2019-10-15 03:05:29,317 INFO L226 Difference]: Without dead ends: 62 [2019-10-15 03:05:29,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:29,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-15 03:05:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-10-15 03:05:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-15 03:05:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-10-15 03:05:29,325 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 46 [2019-10-15 03:05:29,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:29,326 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-10-15 03:05:29,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-10-15 03:05:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:05:29,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:29,328 INFO L380 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] [2019-10-15 03:05:29,328 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:29,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:29,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1337489926, now seen corresponding path program 1 times [2019-10-15 03:05:29,332 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:29,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110738053] [2019-10-15 03:05:29,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:29,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110738053] [2019-10-15 03:05:29,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:29,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:29,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409776695] [2019-10-15 03:05:29,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:29,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:29,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:29,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:29,452 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 5 states. [2019-10-15 03:05:29,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:29,654 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2019-10-15 03:05:29,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:29,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-15 03:05:29,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:29,657 INFO L225 Difference]: With dead ends: 83 [2019-10-15 03:05:29,657 INFO L226 Difference]: Without dead ends: 62 [2019-10-15 03:05:29,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:29,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-15 03:05:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-10-15 03:05:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-15 03:05:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-10-15 03:05:29,663 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 50 [2019-10-15 03:05:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:29,664 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-10-15 03:05:29,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-10-15 03:05:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 03:05:29,665 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:29,665 INFO L380 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] [2019-10-15 03:05:29,665 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:29,666 INFO L82 PathProgramCache]: Analyzing trace with hash 634691168, now seen corresponding path program 1 times [2019-10-15 03:05:29,666 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:29,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263632817] [2019-10-15 03:05:29,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:29,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263632817] [2019-10-15 03:05:29,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:29,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:29,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735625337] [2019-10-15 03:05:29,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:29,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:29,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:29,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:29,799 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 7 states. [2019-10-15 03:05:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:30,047 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-10-15 03:05:30,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:05:30,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-15 03:05:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:30,049 INFO L225 Difference]: With dead ends: 69 [2019-10-15 03:05:30,049 INFO L226 Difference]: Without dead ends: 62 [2019-10-15 03:05:30,049 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-15 03:05:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-10-15 03:05:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-15 03:05:30,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-10-15 03:05:30,055 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 51 [2019-10-15 03:05:30,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:30,055 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-10-15 03:05:30,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:30,055 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-10-15 03:05:30,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 03:05:30,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:30,056 INFO L380 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] [2019-10-15 03:05:30,056 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:30,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:30,057 INFO L82 PathProgramCache]: Analyzing trace with hash 461082475, now seen corresponding path program 1 times [2019-10-15 03:05:30,057 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:30,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600530896] [2019-10-15 03:05:30,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:30,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600530896] [2019-10-15 03:05:30,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:30,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:30,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456300105] [2019-10-15 03:05:30,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:30,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:30,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:30,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:30,126 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 3 states. [2019-10-15 03:05:30,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:30,167 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-10-15 03:05:30,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:30,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-15 03:05:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:30,171 INFO L225 Difference]: With dead ends: 69 [2019-10-15 03:05:30,171 INFO L226 Difference]: Without dead ends: 66 [2019-10-15 03:05:30,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-15 03:05:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-15 03:05:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-15 03:05:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-10-15 03:05:30,177 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 52 [2019-10-15 03:05:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:30,178 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-10-15 03:05:30,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-10-15 03:05:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:05:30,178 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:30,179 INFO L380 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] [2019-10-15 03:05:30,179 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1170982788, now seen corresponding path program 1 times [2019-10-15 03:05:30,180 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:30,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593773532] [2019-10-15 03:05:30,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:30,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593773532] [2019-10-15 03:05:30,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:30,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:30,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552872910] [2019-10-15 03:05:30,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:30,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:30,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:30,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:30,288 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 5 states. [2019-10-15 03:05:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:30,418 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-10-15 03:05:30,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:30,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-10-15 03:05:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:30,420 INFO L225 Difference]: With dead ends: 74 [2019-10-15 03:05:30,420 INFO L226 Difference]: Without dead ends: 60 [2019-10-15 03:05:30,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-15 03:05:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-10-15 03:05:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-15 03:05:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 59 transitions. [2019-10-15 03:05:30,427 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 59 transitions. Word has length 53 [2019-10-15 03:05:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:30,428 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 59 transitions. [2019-10-15 03:05:30,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 59 transitions. [2019-10-15 03:05:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:05:30,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:30,429 INFO L380 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] [2019-10-15 03:05:30,429 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:30,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:30,429 INFO L82 PathProgramCache]: Analyzing trace with hash 174282180, now seen corresponding path program 1 times [2019-10-15 03:05:30,430 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:30,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600779176] [2019-10-15 03:05:30,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:30,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600779176] [2019-10-15 03:05:30,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:30,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:05:30,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766971941] [2019-10-15 03:05:30,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:05:30,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:30,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:05:30,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:30,489 INFO L87 Difference]: Start difference. First operand 60 states and 59 transitions. Second operand 6 states. [2019-10-15 03:05:30,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:30,737 INFO L93 Difference]: Finished difference Result 60 states and 59 transitions. [2019-10-15 03:05:30,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:30,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-15 03:05:30,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:30,738 INFO L225 Difference]: With dead ends: 60 [2019-10-15 03:05:30,738 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:05:30,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:05:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:05:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:05:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:05:30,740 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2019-10-15 03:05:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:30,740 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:05:30,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:05:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:05:30,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:05:30,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:05:31,821 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-10-15 03:05:32,471 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-10-15 03:05:34,242 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 567 574) the Hoare annotation is: true [2019-10-15 03:05:34,242 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 567 574) no Hoare annotation was computed. [2019-10-15 03:05:34,242 INFO L446 ceAbstractionStarter]: At program point KbFilter_CompleteENTRY(lines 617 627) the Hoare annotation is: true [2019-10-15 03:05:34,242 INFO L446 ceAbstractionStarter]: At program point L623(line 623) the Hoare annotation is: true [2019-10-15 03:05:34,242 INFO L443 ceAbstractionStarter]: For program point L623-1(line 623) no Hoare annotation was computed. [2019-10-15 03:05:34,242 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteEXIT(lines 617 627) no Hoare annotation was computed. [2019-10-15 03:05:34,243 INFO L439 ceAbstractionStarter]: At program point L733(line 733) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2019-10-15 03:05:34,243 INFO L443 ceAbstractionStarter]: For program point L733-1(lines 729 735) no Hoare annotation was computed. [2019-10-15 03:05:34,243 INFO L439 ceAbstractionStarter]: At program point L723(lines 698 742) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-15 03:05:34,243 INFO L443 ceAbstractionStarter]: For program point KbFilter_PowerEXIT(lines 688 743) no Hoare annotation was computed. [2019-10-15 03:05:34,243 INFO L439 ceAbstractionStarter]: At program point KbFilter_PowerENTRY(lines 688 743) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-15 03:05:34,243 INFO L439 ceAbstractionStarter]: At program point L739(line 739) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~s~0)) [2019-10-15 03:05:34,243 INFO L443 ceAbstractionStarter]: For program point L739-1(line 739) no Hoare annotation was computed. [2019-10-15 03:05:34,244 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 42 55) no Hoare annotation was computed. [2019-10-15 03:05:34,244 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 42 55) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-15 03:05:34,244 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 56 77) the Hoare annotation is: (or (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,244 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 56 77) no Hoare annotation was computed. [2019-10-15 03:05:34,244 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 1008 1015) the Hoare annotation is: true [2019-10-15 03:05:34,244 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 1008 1015) no Hoare annotation was computed. [2019-10-15 03:05:34,245 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-15 03:05:34,245 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 294 465) no Hoare annotation was computed. [2019-10-15 03:05:34,245 INFO L439 ceAbstractionStarter]: At program point L440(lines 431 458) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,245 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 438) no Hoare annotation was computed. [2019-10-15 03:05:34,245 INFO L443 ceAbstractionStarter]: For program point L399(line 399) no Hoare annotation was computed. [2019-10-15 03:05:34,245 INFO L439 ceAbstractionStarter]: At program point L358(lines 357 410) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,246 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 435) no Hoare annotation was computed. [2019-10-15 03:05:34,246 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 408) no Hoare annotation was computed. [2019-10-15 03:05:34,246 INFO L443 ceAbstractionStarter]: For program point L384(line 384) no Hoare annotation was computed. [2019-10-15 03:05:34,246 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 446) no Hoare annotation was computed. [2019-10-15 03:05:34,246 INFO L443 ceAbstractionStarter]: For program point L343(lines 329 412) no Hoare annotation was computed. [2019-10-15 03:05:34,246 INFO L439 ceAbstractionStarter]: At program point L368(lines 367 408) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,246 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 294 465) no Hoare annotation was computed. [2019-10-15 03:05:34,247 INFO L439 ceAbstractionStarter]: At program point L327(line 327) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (= ~SKIP1~0 ~s~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,247 INFO L443 ceAbstractionStarter]: For program point L327-1(lines 323 464) no Hoare annotation was computed. [2019-10-15 03:05:34,247 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 411) no Hoare annotation was computed. [2019-10-15 03:05:34,247 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 294 465) the Hoare annotation is: (or (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,247 INFO L443 ceAbstractionStarter]: For program point L394(line 394) no Hoare annotation was computed. [2019-10-15 03:05:34,247 INFO L439 ceAbstractionStarter]: At program point L353(lines 352 411) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,248 INFO L439 ceAbstractionStarter]: At program point L444(line 444) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,248 INFO L439 ceAbstractionStarter]: At program point L428(lines 421 461) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,248 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 409) no Hoare annotation was computed. [2019-10-15 03:05:34,248 INFO L439 ceAbstractionStarter]: At program point L329(lines 323 464) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,248 INFO L439 ceAbstractionStarter]: At program point L420(lines 413 462) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,248 INFO L443 ceAbstractionStarter]: For program point L379(line 379) no Hoare annotation was computed. [2019-10-15 03:05:34,249 INFO L439 ceAbstractionStarter]: At program point L338-2(lines 338 341) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,249 INFO L443 ceAbstractionStarter]: For program point L429(lines 413 462) no Hoare annotation was computed. [2019-10-15 03:05:34,249 INFO L439 ceAbstractionStarter]: At program point L363(lines 362 409) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,249 INFO L439 ceAbstractionStarter]: At program point L372(lines 372 407) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,249 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 459) no Hoare annotation was computed. [2019-10-15 03:05:34,249 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 426) no Hoare annotation was computed. [2019-10-15 03:05:34,249 INFO L443 ceAbstractionStarter]: For program point L389(line 389) no Hoare annotation was computed. [2019-10-15 03:05:34,250 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 418) no Hoare annotation was computed. [2019-10-15 03:05:34,250 INFO L439 ceAbstractionStarter]: At program point L373(lines 372 407) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-15 03:05:34,250 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 458) no Hoare annotation was computed. [2019-10-15 03:05:34,250 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 410) no Hoare annotation was computed. [2019-10-15 03:05:34,250 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 548) no Hoare annotation was computed. [2019-10-15 03:05:34,250 INFO L443 ceAbstractionStarter]: For program point L494(lines 494 498) no Hoare annotation was computed. [2019-10-15 03:05:34,251 INFO L439 ceAbstractionStarter]: At program point L523(lines 487 551) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) (or (not (<= 1 ~NP~0)) (and (= ~s~0 ~MPR1~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))))) [2019-10-15 03:05:34,251 INFO L439 ceAbstractionStarter]: At program point L490(line 490) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (= ~s~0 |old(~s~0)|)) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2019-10-15 03:05:34,251 INFO L443 ceAbstractionStarter]: For program point L490-1(line 490) no Hoare annotation was computed. [2019-10-15 03:05:34,251 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 547) no Hoare annotation was computed. [2019-10-15 03:05:34,251 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 480 552) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) (or (not (<= 1 ~NP~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (= ~s~0 |old(~s~0)|)))) [2019-10-15 03:05:34,251 INFO L439 ceAbstractionStarter]: At program point L545(line 545) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2019-10-15 03:05:34,252 INFO L443 ceAbstractionStarter]: For program point L545-1(lines 527 549) no Hoare annotation was computed. [2019-10-15 03:05:34,252 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 480 552) no Hoare annotation was computed. [2019-10-15 03:05:34,252 INFO L439 ceAbstractionStarter]: At program point L496(line 496) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~s~0 |old(~s~0)|) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2019-10-15 03:05:34,252 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 500) no Hoare annotation was computed. [2019-10-15 03:05:34,252 INFO L439 ceAbstractionStarter]: At program point L488-1(lines 488 500) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) (or (not (<= 1 ~NP~0)) (and (= ~s~0 ~MPR1~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))))) [2019-10-15 03:05:34,252 INFO L439 ceAbstractionStarter]: At program point L474(line 474) the Hoare annotation is: (or (not (<= 1 ~setEventCalled~0)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))) [2019-10-15 03:05:34,253 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 466 479) no Hoare annotation was computed. [2019-10-15 03:05:34,253 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 466 479) the Hoare annotation is: (or (not (<= 1 ~setEventCalled~0)) (not (<= 1 ~NP~0)) (= ~s~0 |old(~s~0)|) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))) [2019-10-15 03:05:34,253 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 466 479) no Hoare annotation was computed. [2019-10-15 03:05:34,253 INFO L443 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 744 820) no Hoare annotation was computed. [2019-10-15 03:05:34,253 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 815) no Hoare annotation was computed. [2019-10-15 03:05:34,253 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 816) no Hoare annotation was computed. [2019-10-15 03:05:34,254 INFO L443 ceAbstractionStarter]: For program point L759(lines 759 763) no Hoare annotation was computed. [2019-10-15 03:05:34,254 INFO L439 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 744 820) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2019-10-15 03:05:34,254 INFO L439 ceAbstractionStarter]: At program point L788(lines 752 819) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2019-10-15 03:05:34,254 INFO L439 ceAbstractionStarter]: At program point L755(line 755) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2019-10-15 03:05:34,254 INFO L443 ceAbstractionStarter]: For program point L755-1(line 755) no Hoare annotation was computed. [2019-10-15 03:05:34,254 INFO L439 ceAbstractionStarter]: At program point L813(line 813) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2019-10-15 03:05:34,254 INFO L443 ceAbstractionStarter]: For program point L813-1(lines 792 817) no Hoare annotation was computed. [2019-10-15 03:05:34,254 INFO L439 ceAbstractionStarter]: At program point L761(line 761) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2019-10-15 03:05:34,255 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 765) no Hoare annotation was computed. [2019-10-15 03:05:34,255 INFO L439 ceAbstractionStarter]: At program point L753-1(lines 753 765) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2019-10-15 03:05:34,255 INFO L443 ceAbstractionStarter]: For program point L640(lines 640 654) no Hoare annotation was computed. [2019-10-15 03:05:34,255 INFO L439 ceAbstractionStarter]: At program point L659(line 659) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-15 03:05:34,255 INFO L443 ceAbstractionStarter]: For program point KbFilter_CreateCloseEXIT(lines 628 663) no Hoare annotation was computed. [2019-10-15 03:05:34,255 INFO L443 ceAbstractionStarter]: For program point L659-1(line 659) no Hoare annotation was computed. [2019-10-15 03:05:34,255 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 653) no Hoare annotation was computed. [2019-10-15 03:05:34,255 INFO L443 ceAbstractionStarter]: For program point L637(lines 637 655) no Hoare annotation was computed. [2019-10-15 03:05:34,256 INFO L439 ceAbstractionStarter]: At program point KbFilter_CreateCloseENTRY(lines 628 663) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-15 03:05:34,256 INFO L439 ceAbstractionStarter]: At program point L652(lines 640 654) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-15 03:05:34,256 INFO L439 ceAbstractionStarter]: At program point L644(lines 637 655) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-15 03:05:34,256 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~s~0 |old(~s~0)|) [2019-10-15 03:05:34,256 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:05:34,256 INFO L443 ceAbstractionStarter]: For program point L923(lines 923 975) no Hoare annotation was computed. [2019-10-15 03:05:34,256 INFO L439 ceAbstractionStarter]: At program point L890(lines 890 985) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-15 03:05:34,257 INFO L439 ceAbstractionStarter]: At program point L882(lines 882 987) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-15 03:05:34,257 INFO L443 ceAbstractionStarter]: For program point KbFilter_InternIoCtlEXIT(lines 821 1006) no Hoare annotation was computed. [2019-10-15 03:05:34,257 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 989) no Hoare annotation was computed. [2019-10-15 03:05:34,257 INFO L439 ceAbstractionStarter]: At program point L1002(line 1002) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-15 03:05:34,257 INFO L443 ceAbstractionStarter]: For program point L1002-1(line 1002) no Hoare annotation was computed. [2019-10-15 03:05:34,257 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 983) no Hoare annotation was computed. [2019-10-15 03:05:34,257 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 977) no Hoare annotation was computed. [2019-10-15 03:05:34,257 INFO L443 ceAbstractionStarter]: For program point L933(lines 933 972) no Hoare annotation was computed. [2019-10-15 03:05:34,258 INFO L443 ceAbstractionStarter]: For program point L909(lines 909 979) no Hoare annotation was computed. [2019-10-15 03:05:34,258 INFO L439 ceAbstractionStarter]: At program point L971(lines 866 1005) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-15 03:05:34,258 INFO L439 ceAbstractionStarter]: At program point L934(lines 874 989) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-15 03:05:34,258 INFO L439 ceAbstractionStarter]: At program point L996(line 996) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-15 03:05:34,258 INFO L443 ceAbstractionStarter]: For program point L996-1(line 996) no Hoare annotation was computed. [2019-10-15 03:05:34,258 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 973) no Hoare annotation was computed. [2019-10-15 03:05:34,258 INFO L439 ceAbstractionStarter]: At program point KbFilter_InternIoCtlENTRY(lines 821 1006) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-15 03:05:34,259 INFO L443 ceAbstractionStarter]: For program point L902(lines 902 981) no Hoare annotation was computed. [2019-10-15 03:05:34,259 INFO L443 ceAbstractionStarter]: For program point KbFilter_InternIoCtlFINAL(lines 821 1006) no Hoare annotation was computed. [2019-10-15 03:05:34,259 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 575 616) no Hoare annotation was computed. [2019-10-15 03:05:34,259 INFO L439 ceAbstractionStarter]: At program point L595(line 595) the Hoare annotation is: (or (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (and (not (= |old(~s~0)| ~NP~0)) (not (= |old(~s~0)| ~MPR3~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1))) [2019-10-15 03:05:34,259 INFO L443 ceAbstractionStarter]: For program point L593(lines 593 597) no Hoare annotation was computed. [2019-10-15 03:05:34,259 INFO L439 ceAbstractionStarter]: At program point L593-1(lines 580 599) the Hoare annotation is: (or (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (= ~s~0 ~NP~0) (and (not (= |old(~s~0)| ~NP~0)) (not (= |old(~s~0)| ~MPR3~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1))) [2019-10-15 03:05:34,259 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-10-15 03:05:34,260 INFO L439 ceAbstractionStarter]: At program point L588(lines 580 599) the Hoare annotation is: (or (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (and (not (= |old(~s~0)| ~NP~0)) (not (= |old(~s~0)| ~MPR3~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1))) [2019-10-15 03:05:34,260 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 575 616) the Hoare annotation is: (or (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (and (= ~s~0 |old(~s~0)|) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (and (not (= |old(~s~0)| ~NP~0)) (not (= |old(~s~0)| ~MPR3~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1))) [2019-10-15 03:05:34,260 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 599) no Hoare annotation was computed. [2019-10-15 03:05:34,260 INFO L439 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0))) (and (or .cse0 .cse1 (not (<= 1 ~compRegistered~0))) (or .cse0 .cse1 (not (= ~compRegistered~0 0))))) [2019-10-15 03:05:34,260 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 553 566) no Hoare annotation was computed. [2019-10-15 03:05:34,260 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 563) no Hoare annotation was computed. [2019-10-15 03:05:34,261 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 553 566) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (= ~s~0 ~NP~0))) (and (or .cse0 .cse1 .cse2 (not (<= 1 ~compRegistered~0))) (or .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2))) [2019-10-15 03:05:34,261 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 553 566) no Hoare annotation was computed. [2019-10-15 03:05:34,261 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:05:34,261 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) [2019-10-15 03:05:34,261 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:05:34,261 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:05:34,261 INFO L439 ceAbstractionStarter]: At program point KbFilter_DispatchPassThroughENTRY(lines 664 687) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-15 03:05:34,262 INFO L443 ceAbstractionStarter]: For program point L673(lines 673 679) no Hoare annotation was computed. [2019-10-15 03:05:34,262 INFO L439 ceAbstractionStarter]: At program point L683(line 683) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~s~0)) [2019-10-15 03:05:34,262 INFO L443 ceAbstractionStarter]: For program point L683-1(line 683) no Hoare annotation was computed. [2019-10-15 03:05:34,262 INFO L439 ceAbstractionStarter]: At program point L677(line 677) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2019-10-15 03:05:34,262 INFO L443 ceAbstractionStarter]: For program point L677-1(lines 673 679) no Hoare annotation was computed. [2019-10-15 03:05:34,262 INFO L443 ceAbstractionStarter]: For program point KbFilter_DispatchPassThroughEXIT(lines 664 687) no Hoare annotation was computed. [2019-10-15 03:05:34,262 INFO L439 ceAbstractionStarter]: At program point L217(line 217) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-15 03:05:34,262 INFO L439 ceAbstractionStarter]: At program point L242(line 242) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-15 03:05:34,263 INFO L443 ceAbstractionStarter]: For program point L242-1(lines 238 244) no Hoare annotation was computed. [2019-10-15 03:05:34,263 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 188) no Hoare annotation was computed. [2019-10-15 03:05:34,263 INFO L439 ceAbstractionStarter]: At program point L110(lines 110 289) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2019-10-15 03:05:34,263 INFO L439 ceAbstractionStarter]: At program point L226(line 226) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-15 03:05:34,263 INFO L439 ceAbstractionStarter]: At program point L193(lines 193 194) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (and (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0))) [2019-10-15 03:05:34,263 INFO L443 ceAbstractionStarter]: For program point L226-1(lines 222 228) no Hoare annotation was computed. [2019-10-15 03:05:34,263 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 193 194) no Hoare annotation was computed. [2019-10-15 03:05:34,264 INFO L446 ceAbstractionStarter]: At program point L268(lines 171 269) the Hoare annotation is: true [2019-10-15 03:05:34,264 INFO L439 ceAbstractionStarter]: At program point L178(line 178) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-15 03:05:34,264 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPEXIT(lines 80 293) no Hoare annotation was computed. [2019-10-15 03:05:34,264 INFO L439 ceAbstractionStarter]: At program point L170(lines 116 287) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2019-10-15 03:05:34,264 INFO L439 ceAbstractionStarter]: At program point L113(lines 113 288) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2019-10-15 03:05:34,264 INFO L439 ceAbstractionStarter]: At program point KbFilter_PnPENTRY(lines 80 293) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-15 03:05:34,265 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 244) no Hoare annotation was computed. [2019-10-15 03:05:34,265 INFO L439 ceAbstractionStarter]: At program point L263(lines 263 264) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (= 1 |old(~s~0)|))) [2019-10-15 03:05:34,265 INFO L443 ceAbstractionStarter]: For program point L263-1(lines 263 264) no Hoare annotation was computed. [2019-10-15 03:05:34,265 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 228) no Hoare annotation was computed. [2019-10-15 03:05:34,265 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2019-10-15 03:05:34,265 INFO L443 ceAbstractionStarter]: For program point L181-1(lines 176 188) no Hoare annotation was computed. [2019-10-15 03:05:34,265 INFO L439 ceAbstractionStarter]: At program point L107(lines 107 290) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-15 03:05:34,265 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 204) no Hoare annotation was computed. [2019-10-15 03:05:34,266 INFO L443 ceAbstractionStarter]: For program point L198-2(lines 171 267) no Hoare annotation was computed. [2019-10-15 03:05:34,266 INFO L439 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (= 1 |old(~s~0)|))) [2019-10-15 03:05:34,266 INFO L443 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2019-10-15 03:05:34,266 INFO L439 ceAbstractionStarter]: At program point L232(lines 232 233) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (= 1 |old(~s~0)|))) [2019-10-15 03:05:34,266 INFO L443 ceAbstractionStarter]: For program point L232-1(lines 232 233) no Hoare annotation was computed. [2019-10-15 03:05:34,266 INFO L439 ceAbstractionStarter]: At program point L257(line 257) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-15 03:05:34,266 INFO L443 ceAbstractionStarter]: For program point L257-1(lines 253 259) no Hoare annotation was computed. [2019-10-15 03:05:34,267 INFO L439 ceAbstractionStarter]: At program point L183(line 183) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-15 03:05:34,267 INFO L439 ceAbstractionStarter]: At program point L200(lines 200 202) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (let ((.cse0 (= ~s~0 ~NP~0))) (and (or .cse0 (= KbFilter_PnP_~__cil_tmp23~0 259)) (or .cse0 (= ~MPR3~0 ~s~0)) (<= 1 ~compRegistered~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (not (= 1 |old(~s~0)|))) [2019-10-15 03:05:34,267 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 200 202) no Hoare annotation was computed. [2019-10-15 03:05:34,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:05:34 BoogieIcfgContainer [2019-10-15 03:05:34,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:05:34,302 INFO L168 Benchmark]: Toolchain (without parser) took 9424.13 ms. Allocated memory was 135.8 MB in the beginning and 340.8 MB in the end (delta: 205.0 MB). Free memory was 98.4 MB in the beginning and 238.1 MB in the end (delta: -139.7 MB). Peak memory consumption was 184.8 MB. Max. memory is 7.1 GB. [2019-10-15 03:05:34,303 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory was 117.8 MB in the beginning and 117.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-15 03:05:34,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.85 ms. Allocated memory was 135.8 MB in the beginning and 201.3 MB in the end (delta: 65.5 MB). Free memory was 98.2 MB in the beginning and 174.1 MB in the end (delta: -75.8 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. [2019-10-15 03:05:34,305 INFO L168 Benchmark]: Boogie Preprocessor took 85.09 ms. Allocated memory is still 201.3 MB. Free memory was 174.1 MB in the beginning and 170.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-10-15 03:05:34,306 INFO L168 Benchmark]: RCFGBuilder took 1631.16 ms. Allocated memory was 201.3 MB in the beginning and 229.1 MB in the end (delta: 27.8 MB). Free memory was 170.5 MB in the beginning and 159.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 93.9 MB. Max. memory is 7.1 GB. [2019-10-15 03:05:34,307 INFO L168 Benchmark]: TraceAbstraction took 7089.61 ms. Allocated memory was 229.1 MB in the beginning and 340.8 MB in the end (delta: 111.7 MB). Free memory was 159.5 MB in the beginning and 238.1 MB in the end (delta: -78.6 MB). Peak memory consumption was 152.6 MB. Max. memory is 7.1 GB. [2019-10-15 03:05:34,311 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory was 117.8 MB in the beginning and 117.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 613.85 ms. Allocated memory was 135.8 MB in the beginning and 201.3 MB in the end (delta: 65.5 MB). Free memory was 98.2 MB in the beginning and 174.1 MB in the end (delta: -75.8 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 85.09 ms. Allocated memory is still 201.3 MB. Free memory was 174.1 MB in the beginning and 170.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1631.16 ms. Allocated memory was 201.3 MB in the beginning and 229.1 MB in the end (delta: 27.8 MB). Free memory was 170.5 MB in the beginning and 159.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 93.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7089.61 ms. Allocated memory was 229.1 MB in the beginning and 340.8 MB in the end (delta: 111.7 MB). Free memory was 159.5 MB in the beginning and 238.1 MB in the end (delta: -78.6 MB). Peak memory consumption was 152.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ((((!(\old(s) == \old(NP)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || (((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) && 1 == s) && NP + 4 <= MPR1)) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 640]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((!(1 <= NP) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(1 == \old(s))) || (s == NP && 0 == compRegistered) - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: ((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((((!(1 <= \old(setEventCalled)) || !(1 <= NP)) || 1 == pended) || (!(\old(s) == NP) && !(\old(s) == MPR3))) || !(NP + 4 <= MPR1)) || (((s == \old(s) && !(MPR3 == s)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1) - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: ((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 752]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((!(1 <= NP) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(1 == \old(s))) || (s == NP && 0 == compRegistered) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((!(1 <= NP) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(1 == \old(s))) || (s == NP && 0 == compRegistered) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((((!(1 <= \old(setEventCalled)) || !(1 <= NP)) || 1 == pended) || s == NP) || (!(\old(s) == NP) && !(\old(s) == MPR3))) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((0 == compRegistered && s == \old(s)) || !(1 <= NP)) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(1 == \old(s)) - InvariantResult [Line: 421]: Loop Invariant Derived loop invariant: ((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 866]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) && ((((((!(1 <= NP) || (((s == MPR1 && __cil_tmp7 + 1073741802 == 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(1 == \old(s))) - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) && ((((((!(1 <= NP) || (((s == MPR1 && __cil_tmp7 + 1073741802 == 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(1 == \old(s))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 172 locations, 1 error locations. Result: SAFE, OverallTime: 6.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.4s, HoareTripleCheckerStatistics: 1640 SDtfs, 960 SDslu, 1137 SDs, 0 SdLazy, 424 SolverSat, 207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 78 LocationsWithAnnotation, 257 PreInvPairs, 301 NumberOfFragments, 2012 HoareAnnotationTreeSize, 257 FomulaSimplifications, 89 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 78 FomulaSimplificationsInter, 1570 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 525 NumberOfCodeBlocks, 525 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 41811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...