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 -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:18:04,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:18:04,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:18:04,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:18:04,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:18:04,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:18:04,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:18:04,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:18:04,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:18:04,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:18:04,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:18:04,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:18:04,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:18:04,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:18:04,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:18:04,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:18:04,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:18:04,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:18:04,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:18:04,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:18:04,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:18:04,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:18:04,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:18:04,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:18:04,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:18:04,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:18:04,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:18:04,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:18:04,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:18:04,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:18:04,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:18:04,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:18:04,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:18:04,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:18:04,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:18:04,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:18:04,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:18:04,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:18:04,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:18:04,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:18:04,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:18:04,637 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-14 23:18:04,650 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:18:04,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:18:04,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:18:04,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:18:04,652 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:18:04,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:18:04,653 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:18:04,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:18:04,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:18:04,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:18:04,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:18:04,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:18:04,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:18:04,654 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:18:04,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:18:04,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:18:04,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:18:04,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:18:04,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:18:04,655 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:18:04,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:18:04,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:18:04,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:18:04,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:18:04,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:18:04,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:18:04,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:18:04,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:18:04,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:18:04,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:18:04,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:18:04,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:18:04,987 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:18:04,987 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:18:04,988 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-10-14 23:18:05,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008d8e359/f411ee91bd6e4fcaa1b167020c55d2af/FLAGd8cea99f5 [2019-10-14 23:18:05,536 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:18:05,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-10-14 23:18:05,552 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008d8e359/f411ee91bd6e4fcaa1b167020c55d2af/FLAGd8cea99f5 [2019-10-14 23:18:05,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008d8e359/f411ee91bd6e4fcaa1b167020c55d2af [2019-10-14 23:18:05,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:18:05,895 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:18:05,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:18:05,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:18:05,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:18:05,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:18:05" (1/1) ... [2019-10-14 23:18:05,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7492c7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:05, skipping insertion in model container [2019-10-14 23:18:05,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:18:05" (1/1) ... [2019-10-14 23:18:05,913 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:18:05,974 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:18:06,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:18:06,332 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:18:06,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:18:06,548 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:18:06,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:06 WrapperNode [2019-10-14 23:18:06,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:18:06,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:18:06,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:18:06,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:18:06,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:06" (1/1) ... [2019-10-14 23:18:06,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:06" (1/1) ... [2019-10-14 23:18:06,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:06" (1/1) ... [2019-10-14 23:18:06,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:06" (1/1) ... [2019-10-14 23:18:06,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:06" (1/1) ... [2019-10-14 23:18:06,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:06" (1/1) ... [2019-10-14 23:18:06,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:06" (1/1) ... [2019-10-14 23:18:06,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:18:06,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:18:06,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:18:06,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:18:06,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:06" (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-14 23:18:06,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:18:06,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:18:06,670 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-14 23:18:06,670 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-14 23:18:06,671 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-10-14 23:18:06,671 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:18:06,671 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-14 23:18:06,671 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-14 23:18:06,671 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-14 23:18:06,671 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-14 23:18:06,672 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-14 23:18:06,672 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-10-14 23:18:06,672 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-14 23:18:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:18:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:18:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:18:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:18:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-14 23:18:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-10-14 23:18:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-14 23:18:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-14 23:18:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-14 23:18:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-10-14 23:18:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-14 23:18:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-14 23:18:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-14 23:18:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-14 23:18:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:18:06,675 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-14 23:18:06,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:18:06,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:18:06,971 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:18:07,103 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-10-14 23:18:07,103 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-10-14 23:18:07,105 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:18:07,183 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2019-10-14 23:18:07,183 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2019-10-14 23:18:07,209 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:18:07,248 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-14 23:18:07,249 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-14 23:18:07,271 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:18:07,406 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-10-14 23:18:07,406 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-10-14 23:18:07,413 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:18:07,413 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:18:07,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:18:07 BoogieIcfgContainer [2019-10-14 23:18:07,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:18:07,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:18:07,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:18:07,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:18:07,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:18:05" (1/3) ... [2019-10-14 23:18:07,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d2300d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:18:07, skipping insertion in model container [2019-10-14 23:18:07,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:06" (2/3) ... [2019-10-14 23:18:07,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d2300d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:18:07, skipping insertion in model container [2019-10-14 23:18:07,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:18:07" (3/3) ... [2019-10-14 23:18:07,423 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2019-10-14 23:18:07,433 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:18:07,441 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:18:07,451 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:18:07,475 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:18:07,475 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:18:07,475 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:18:07,476 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:18:07,476 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:18:07,476 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:18:07,476 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:18:07,476 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:18:07,497 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-10-14 23:18:07,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:18:07,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:07,505 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] [2019-10-14 23:18:07,507 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:07,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:07,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2019-10-14 23:18:07,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:07,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002040319] [2019-10-14 23:18:07,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:07,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:07,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:07,939 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-14 23:18:07,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002040319] [2019-10-14 23:18:07,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:07,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:18:07,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259382807] [2019-10-14 23:18:07,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:18:07,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:07,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:18:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:18:07,961 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2019-10-14 23:18:08,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:08,615 INFO L93 Difference]: Finished difference Result 303 states and 463 transitions. [2019-10-14 23:18:08,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:18:08,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-14 23:18:08,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:08,640 INFO L225 Difference]: With dead ends: 303 [2019-10-14 23:18:08,640 INFO L226 Difference]: Without dead ends: 157 [2019-10-14 23:18:08,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:18:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-14 23:18:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2019-10-14 23:18:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-14 23:18:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2019-10-14 23:18:08,766 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2019-10-14 23:18:08,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:08,767 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2019-10-14 23:18:08,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:18:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2019-10-14 23:18:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:18:08,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:08,769 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] [2019-10-14 23:18:08,769 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:08,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2019-10-14 23:18:08,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:08,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970122626] [2019-10-14 23:18:08,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:08,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:08,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:09,084 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-14 23:18:09,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970122626] [2019-10-14 23:18:09,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:09,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:18:09,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776431819] [2019-10-14 23:18:09,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:18:09,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:09,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:18:09,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:18:09,090 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2019-10-14 23:18:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:09,869 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2019-10-14 23:18:09,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:18:09,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-10-14 23:18:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:09,873 INFO L225 Difference]: With dead ends: 275 [2019-10-14 23:18:09,873 INFO L226 Difference]: Without dead ends: 219 [2019-10-14 23:18:09,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:18:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-10-14 23:18:09,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2019-10-14 23:18:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-14 23:18:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2019-10-14 23:18:09,904 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2019-10-14 23:18:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:09,904 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2019-10-14 23:18:09,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:18:09,904 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2019-10-14 23:18:09,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:18:09,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:09,906 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] [2019-10-14 23:18:09,906 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:09,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:09,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2019-10-14 23:18:09,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:09,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761361616] [2019-10-14 23:18:09,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:09,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:09,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:10,135 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-14 23:18:10,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761361616] [2019-10-14 23:18:10,136 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:10,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:18:10,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863246267] [2019-10-14 23:18:10,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:18:10,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:10,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:18:10,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:18:10,138 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand 7 states. [2019-10-14 23:18:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:10,768 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2019-10-14 23:18:10,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:18:10,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-10-14 23:18:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:10,773 INFO L225 Difference]: With dead ends: 316 [2019-10-14 23:18:10,773 INFO L226 Difference]: Without dead ends: 254 [2019-10-14 23:18:10,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:18:10,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-14 23:18:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2019-10-14 23:18:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-14 23:18:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2019-10-14 23:18:10,825 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2019-10-14 23:18:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:10,825 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2019-10-14 23:18:10,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:18:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2019-10-14 23:18:10,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-14 23:18:10,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:10,830 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-14 23:18:10,830 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:10,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:10,830 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2019-10-14 23:18:10,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:10,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247518563] [2019-10-14 23:18:10,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:10,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:10,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:11,068 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-14 23:18:11,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247518563] [2019-10-14 23:18:11,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:11,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:18:11,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363906255] [2019-10-14 23:18:11,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:18:11,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:11,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:18:11,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:18:11,071 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 7 states. [2019-10-14 23:18:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:11,776 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2019-10-14 23:18:11,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:18:11,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-10-14 23:18:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:11,779 INFO L225 Difference]: With dead ends: 220 [2019-10-14 23:18:11,780 INFO L226 Difference]: Without dead ends: 217 [2019-10-14 23:18:11,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:18:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-14 23:18:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-10-14 23:18:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-14 23:18:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2019-10-14 23:18:11,805 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2019-10-14 23:18:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:11,805 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2019-10-14 23:18:11,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:18:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2019-10-14 23:18:11,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-14 23:18:11,808 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:11,808 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] [2019-10-14 23:18:11,809 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:11,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2019-10-14 23:18:11,809 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:11,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30149123] [2019-10-14 23:18:11,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:11,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:11,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:12,000 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-14 23:18:12,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30149123] [2019-10-14 23:18:12,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:12,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:18:12,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519287783] [2019-10-14 23:18:12,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:18:12,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:12,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:18:12,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:18:12,003 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand 8 states. [2019-10-14 23:18:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:12,432 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2019-10-14 23:18:12,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:18:12,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-10-14 23:18:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:12,435 INFO L225 Difference]: With dead ends: 274 [2019-10-14 23:18:12,435 INFO L226 Difference]: Without dead ends: 208 [2019-10-14 23:18:12,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:18:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-14 23:18:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2019-10-14 23:18:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-14 23:18:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2019-10-14 23:18:12,452 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2019-10-14 23:18:12,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:12,453 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2019-10-14 23:18:12,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:18:12,453 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2019-10-14 23:18:12,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-14 23:18:12,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:12,455 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-14 23:18:12,455 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:12,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:12,456 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2019-10-14 23:18:12,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:12,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800146241] [2019-10-14 23:18:12,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:12,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:12,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:12,613 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-14 23:18:12,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800146241] [2019-10-14 23:18:12,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:12,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:18:12,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707908985] [2019-10-14 23:18:12,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:18:12,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:12,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:18:12,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:18:12,615 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand 8 states. [2019-10-14 23:18:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:13,046 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2019-10-14 23:18:13,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:18:13,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-10-14 23:18:13,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:13,048 INFO L225 Difference]: With dead ends: 258 [2019-10-14 23:18:13,049 INFO L226 Difference]: Without dead ends: 197 [2019-10-14 23:18:13,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:18:13,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-14 23:18:13,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2019-10-14 23:18:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-14 23:18:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2019-10-14 23:18:13,066 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2019-10-14 23:18:13,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:13,067 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2019-10-14 23:18:13,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:18:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2019-10-14 23:18:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 23:18:13,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:13,068 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-14 23:18:13,068 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:13,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:13,069 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2019-10-14 23:18:13,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:13,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758677967] [2019-10-14 23:18:13,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:13,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:13,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:13,238 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-14 23:18:13,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758677967] [2019-10-14 23:18:13,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:13,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:18:13,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298689779] [2019-10-14 23:18:13,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:18:13,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:18:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:18:13,240 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand 8 states. [2019-10-14 23:18:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:13,490 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2019-10-14 23:18:13,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:18:13,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-10-14 23:18:13,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:13,493 INFO L225 Difference]: With dead ends: 197 [2019-10-14 23:18:13,493 INFO L226 Difference]: Without dead ends: 91 [2019-10-14 23:18:13,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:18:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-14 23:18:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-10-14 23:18:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-14 23:18:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-10-14 23:18:13,506 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 50 [2019-10-14 23:18:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:13,507 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-10-14 23:18:13,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:18:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-10-14 23:18:13,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-14 23:18:13,508 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:13,508 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-14 23:18:13,509 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:13,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2019-10-14 23:18:13,509 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:13,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628007827] [2019-10-14 23:18:13,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:13,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:13,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:13,736 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-14 23:18:13,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628007827] [2019-10-14 23:18:13,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:13,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-14 23:18:13,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319026892] [2019-10-14 23:18:13,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:18:13,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:13,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:18:13,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:18:13,739 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 12 states. [2019-10-14 23:18:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:14,081 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2019-10-14 23:18:14,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:18:14,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-10-14 23:18:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:14,083 INFO L225 Difference]: With dead ends: 142 [2019-10-14 23:18:14,083 INFO L226 Difference]: Without dead ends: 101 [2019-10-14 23:18:14,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:18:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-14 23:18:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-10-14 23:18:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-14 23:18:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-10-14 23:18:14,095 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 59 [2019-10-14 23:18:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:14,095 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-10-14 23:18:14,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:18:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-10-14 23:18:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-14 23:18:14,096 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:14,096 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-14 23:18:14,097 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:14,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:14,097 INFO L82 PathProgramCache]: Analyzing trace with hash -367309916, now seen corresponding path program 1 times [2019-10-14 23:18:14,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:14,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27498416] [2019-10-14 23:18:14,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:14,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:14,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,336 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-14 23:18:14,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27498416] [2019-10-14 23:18:14,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:14,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-14 23:18:14,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302572793] [2019-10-14 23:18:14,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:18:14,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:14,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:18:14,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:18:14,339 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 12 states. [2019-10-14 23:18:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:14,815 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2019-10-14 23:18:14,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:18:14,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-10-14 23:18:14,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:14,817 INFO L225 Difference]: With dead ends: 113 [2019-10-14 23:18:14,817 INFO L226 Difference]: Without dead ends: 106 [2019-10-14 23:18:14,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:18:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-14 23:18:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-10-14 23:18:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-14 23:18:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2019-10-14 23:18:14,828 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 59 [2019-10-14 23:18:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:14,828 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2019-10-14 23:18:14,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:18:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2019-10-14 23:18:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:18:14,829 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:14,829 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, 1] [2019-10-14 23:18:14,830 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:14,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:14,830 INFO L82 PathProgramCache]: Analyzing trace with hash 857146700, now seen corresponding path program 1 times [2019-10-14 23:18:14,830 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:14,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348069754] [2019-10-14 23:18:14,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:14,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:14,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:15,000 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-14 23:18:15,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348069754] [2019-10-14 23:18:15,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:15,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:18:15,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006239276] [2019-10-14 23:18:15,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:18:15,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:15,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:18:15,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:18:15,002 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 9 states. [2019-10-14 23:18:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:15,280 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2019-10-14 23:18:15,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:18:15,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-10-14 23:18:15,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:15,282 INFO L225 Difference]: With dead ends: 199 [2019-10-14 23:18:15,282 INFO L226 Difference]: Without dead ends: 192 [2019-10-14 23:18:15,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:18:15,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-14 23:18:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 180. [2019-10-14 23:18:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-14 23:18:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 200 transitions. [2019-10-14 23:18:15,298 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 200 transitions. Word has length 60 [2019-10-14 23:18:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:15,299 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 200 transitions. [2019-10-14 23:18:15,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:18:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 200 transitions. [2019-10-14 23:18:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:18:15,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:15,300 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, 1] [2019-10-14 23:18:15,300 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:15,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:15,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1662813234, now seen corresponding path program 1 times [2019-10-14 23:18:15,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:15,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912905705] [2019-10-14 23:18:15,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:15,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:15,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:15,565 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-14 23:18:15,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912905705] [2019-10-14 23:18:15,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:15,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-14 23:18:15,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138556701] [2019-10-14 23:18:15,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:18:15,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:15,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:18:15,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:18:15,570 INFO L87 Difference]: Start difference. First operand 180 states and 200 transitions. Second operand 12 states. [2019-10-14 23:18:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:16,014 INFO L93 Difference]: Finished difference Result 228 states and 256 transitions. [2019-10-14 23:18:16,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:18:16,015 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-10-14 23:18:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:16,017 INFO L225 Difference]: With dead ends: 228 [2019-10-14 23:18:16,017 INFO L226 Difference]: Without dead ends: 150 [2019-10-14 23:18:16,018 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:18:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-14 23:18:16,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-10-14 23:18:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-14 23:18:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2019-10-14 23:18:16,032 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 60 [2019-10-14 23:18:16,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:16,032 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2019-10-14 23:18:16,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:18:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2019-10-14 23:18:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-14 23:18:16,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:16,033 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, 1, 1, 1] [2019-10-14 23:18:16,033 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:16,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:16,034 INFO L82 PathProgramCache]: Analyzing trace with hash -673462309, now seen corresponding path program 1 times [2019-10-14 23:18:16,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:16,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150526627] [2019-10-14 23:18:16,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:16,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:16,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,206 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-14 23:18:16,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150526627] [2019-10-14 23:18:16,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:16,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:18:16,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758578881] [2019-10-14 23:18:16,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:18:16,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:16,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:18:16,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:18:16,209 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand 9 states. [2019-10-14 23:18:16,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:16,478 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2019-10-14 23:18:16,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:18:16,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-10-14 23:18:16,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:16,480 INFO L225 Difference]: With dead ends: 170 [2019-10-14 23:18:16,480 INFO L226 Difference]: Without dead ends: 165 [2019-10-14 23:18:16,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:18:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-14 23:18:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 154. [2019-10-14 23:18:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-14 23:18:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 165 transitions. [2019-10-14 23:18:16,498 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 165 transitions. Word has length 62 [2019-10-14 23:18:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:16,498 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 165 transitions. [2019-10-14 23:18:16,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:18:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 165 transitions. [2019-10-14 23:18:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-14 23:18:16,500 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:16,500 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, 1, 1, 1, 1] [2019-10-14 23:18:16,500 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:16,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:16,500 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2019-10-14 23:18:16,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:16,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995686502] [2019-10-14 23:18:16,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:16,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:16,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:16,820 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-14 23:18:16,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995686502] [2019-10-14 23:18:16,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:16,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-14 23:18:16,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063812969] [2019-10-14 23:18:16,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:18:16,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:16,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:18:16,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:18:16,823 INFO L87 Difference]: Start difference. First operand 154 states and 165 transitions. Second operand 11 states. [2019-10-14 23:18:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:17,298 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2019-10-14 23:18:17,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:18:17,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-10-14 23:18:17,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:17,300 INFO L225 Difference]: With dead ends: 179 [2019-10-14 23:18:17,300 INFO L226 Difference]: Without dead ends: 133 [2019-10-14 23:18:17,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:18:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-14 23:18:17,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-10-14 23:18:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-14 23:18:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-10-14 23:18:17,314 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2019-10-14 23:18:17,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:17,314 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-10-14 23:18:17,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:18:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-10-14 23:18:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-14 23:18:17,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:17,315 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, 1, 1, 1, 1] [2019-10-14 23:18:17,315 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:17,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:17,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2019-10-14 23:18:17,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:17,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850817192] [2019-10-14 23:18:17,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:17,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:17,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:17,546 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-14 23:18:17,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850817192] [2019-10-14 23:18:17,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:17,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-14 23:18:17,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433761267] [2019-10-14 23:18:17,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:18:17,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:17,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:18:17,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:18:17,548 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 12 states. [2019-10-14 23:18:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:17,844 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2019-10-14 23:18:17,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:18:17,845 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-10-14 23:18:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:17,846 INFO L225 Difference]: With dead ends: 144 [2019-10-14 23:18:17,846 INFO L226 Difference]: Without dead ends: 133 [2019-10-14 23:18:17,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:18:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-14 23:18:17,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-10-14 23:18:17,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-14 23:18:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2019-10-14 23:18:17,861 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2019-10-14 23:18:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:17,862 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2019-10-14 23:18:17,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:18:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2019-10-14 23:18:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-14 23:18:17,863 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:17,863 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:17,863 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:17,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:17,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2019-10-14 23:18:17,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:17,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355290953] [2019-10-14 23:18:17,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:17,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:17,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:18,129 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-14 23:18:18,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355290953] [2019-10-14 23:18:18,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:18,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-14 23:18:18,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707582982] [2019-10-14 23:18:18,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:18:18,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:18,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:18:18,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:18:18,132 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 12 states. [2019-10-14 23:18:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:18,318 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-10-14 23:18:18,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:18:18,319 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-10-14 23:18:18,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:18,319 INFO L225 Difference]: With dead ends: 133 [2019-10-14 23:18:18,319 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:18:18,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:18:18,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:18:18,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:18:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:18:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:18:18,322 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2019-10-14 23:18:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:18,322 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:18:18,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:18:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:18:18,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:18:18,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:18:18,722 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-10-14 23:18:19,049 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 45 [2019-10-14 23:18:19,206 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2019-10-14 23:18:19,455 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-10-14 23:18:19,682 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-10-14 23:18:19,830 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2019-10-14 23:18:19,994 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 48 [2019-10-14 23:18:20,111 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-10-14 23:18:20,345 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-10-14 23:18:20,623 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-10-14 23:18:20,894 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-10-14 23:18:21,046 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 45 [2019-10-14 23:18:21,197 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2019-10-14 23:18:21,361 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 31 [2019-10-14 23:18:21,562 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2019-10-14 23:18:21,687 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 31 [2019-10-14 23:18:21,834 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-10-14 23:18:21,981 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-10-14 23:18:22,285 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 46 [2019-10-14 23:18:22,468 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-10-14 23:18:22,658 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-10-14 23:18:22,861 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-10-14 23:18:23,120 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-10-14 23:18:23,364 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 44 [2019-10-14 23:18:23,483 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 45 [2019-10-14 23:18:23,822 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-10-14 23:18:23,948 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 31 [2019-10-14 23:18:24,079 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-10-14 23:18:24,150 INFO L439 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 514 521) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= ~s~0 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 ~s~0))) [2019-10-14 23:18:24,150 INFO L443 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 514 521) no Hoare annotation was computed. [2019-10-14 23:18:24,150 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 514 521) no Hoare annotation was computed. [2019-10-14 23:18:24,151 INFO L439 ceAbstractionStarter]: At program point KbFilter_CompleteENTRY(lines 564 574) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= ~s~0 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 ~s~0))) [2019-10-14 23:18:24,151 INFO L439 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= ~s~0 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 ~s~0))) [2019-10-14 23:18:24,151 INFO L443 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2019-10-14 23:18:24,151 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteFINAL(lines 564 574) no Hoare annotation was computed. [2019-10-14 23:18:24,151 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteEXIT(lines 564 574) no Hoare annotation was computed. [2019-10-14 23:18:24,151 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 36 49) no Hoare annotation was computed. [2019-10-14 23:18:24,152 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 36 49) the Hoare annotation is: (or (and (= ~pended~0 |old(~pended~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~s~0 ~NP~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,152 INFO L443 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 36 49) no Hoare annotation was computed. [2019-10-14 23:18:24,152 INFO L443 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 50 71) no Hoare annotation was computed. [2019-10-14 23:18:24,154 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 50 71) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|)) (and (= ~pended~0 |old(~pended~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~DC~0 |old(~DC~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0) (= ~NP~0 ~MPR1~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~MPR1~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~MPR3~0 |old(~MPR3~0)|))) [2019-10-14 23:18:24,154 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 50 71) no Hoare annotation was computed. [2019-10-14 23:18:24,154 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 576 583) the Hoare annotation is: true [2019-10-14 23:18:24,154 INFO L443 ceAbstractionStarter]: For program point errorFnFINAL(lines 576 583) no Hoare annotation was computed. [2019-10-14 23:18:24,154 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 576 583) no Hoare annotation was computed. [2019-10-14 23:18:24,154 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-14 23:18:24,155 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 287 421) no Hoare annotation was computed. [2019-10-14 23:18:24,155 INFO L439 ceAbstractionStarter]: At program point L399(line 399) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-14 23:18:24,155 INFO L443 ceAbstractionStarter]: For program point L358(line 358) no Hoare annotation was computed. [2019-10-14 23:18:24,155 INFO L439 ceAbstractionStarter]: At program point L383(lines 376 416) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (and (not (= 1 ~pended~0)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-14 23:18:24,155 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 410) no Hoare annotation was computed. [2019-10-14 23:18:24,155 INFO L439 ceAbstractionStarter]: At program point L375(lines 368 417) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (and (not (= 1 ~pended~0)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-14 23:18:24,155 INFO L443 ceAbstractionStarter]: For program point L384(lines 368 417) no Hoare annotation was computed. [2019-10-14 23:18:24,156 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 366) no Hoare annotation was computed. [2019-10-14 23:18:24,156 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 287 421) no Hoare annotation was computed. [2019-10-14 23:18:24,156 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 414) no Hoare annotation was computed. [2019-10-14 23:18:24,156 INFO L439 ceAbstractionStarter]: At program point L352(lines 351 366) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= ~s~0 1) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-14 23:18:24,156 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 287 421) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|)) (and (= ~pended~0 |old(~pended~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~DC~0 |old(~DC~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~SKIP1~0 ~s~0) (= ~Executive~0 |old(~Executive~0)|) (= ~NP~0 ~MPR1~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~MPR1~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~MPR3~0 |old(~MPR3~0)|))) [2019-10-14 23:18:24,156 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2019-10-14 23:18:24,157 INFO L443 ceAbstractionStarter]: For program point L369(lines 369 373) no Hoare annotation was computed. [2019-10-14 23:18:24,157 INFO L443 ceAbstractionStarter]: For program point L336(lines 322 367) no Hoare annotation was computed. [2019-10-14 23:18:24,157 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 413) no Hoare annotation was computed. [2019-10-14 23:18:24,157 INFO L439 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ~MPR1~0 ~s~0) (<= 0 main_~status~1) (= ~NP~0 ~MPR1~0) (= ~MPR3~0 ~s~0) (<= ~MPR3~0 0) (<= 0 ~MPR3~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-14 23:18:24,157 INFO L443 ceAbstractionStarter]: For program point L320-1(lines 296 420) no Hoare annotation was computed. [2019-10-14 23:18:24,157 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 411) no Hoare annotation was computed. [2019-10-14 23:18:24,157 INFO L439 ceAbstractionStarter]: At program point L395(lines 386 413) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (and (not (= 1 ~pended~0)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-14 23:18:24,158 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. [2019-10-14 23:18:24,158 INFO L439 ceAbstractionStarter]: At program point L354(lines 353 366) the Hoare annotation is: (or (<= 0 main_~status~1) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-14 23:18:24,158 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-10-14 23:18:24,158 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 390) no Hoare annotation was computed. [2019-10-14 23:18:24,158 INFO L439 ceAbstractionStarter]: At program point L322(lines 296 420) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (and (not (= 1 ~pended~0)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-14 23:18:24,158 INFO L443 ceAbstractionStarter]: For program point L339-1(lines 338 348) no Hoare annotation was computed. [2019-10-14 23:18:24,158 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 401) no Hoare annotation was computed. [2019-10-14 23:18:24,158 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 334) no Hoare annotation was computed. [2019-10-14 23:18:24,159 INFO L439 ceAbstractionStarter]: At program point L331-2(lines 331 334) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= ~s~0 1) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-10-14 23:18:24,159 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2019-10-14 23:18:24,159 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 444 447) no Hoare annotation was computed. [2019-10-14 23:18:24,159 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 495) no Hoare annotation was computed. [2019-10-14 23:18:24,159 INFO L439 ceAbstractionStarter]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) .cse2 (not (<= 1 |old(~s~0)|))) (or .cse0 .cse1 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2019-10-14 23:18:24,159 INFO L443 ceAbstractionStarter]: For program point L445-1(line 445) no Hoare annotation was computed. [2019-10-14 23:18:24,160 INFO L439 ceAbstractionStarter]: At program point L470(lines 443 498) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse0 .cse1 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2) (let ((.cse3 (= ~MPR1~0 ~s~0))) (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) .cse2 (not (<= 1 |old(~s~0)|)) (and .cse3 (<= IofCallDriver_~returnVal2~0 0)) (and .cse3 (= 259 IofCallDriver_~returnVal2~0) (= ~setEventCalled~0 1)))))) [2019-10-14 23:18:24,160 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 436 499) the Hoare annotation is: (let ((.cse2 (not (<= ~SKIP1~0 3))) (.cse3 (= 1 ~pended~0)) (.cse1 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse0 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse4 (not (<= 3 ~SKIP1~0)))) (and (or (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) .cse2 .cse3 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse2 .cse3 (not (<= (+ ~NP~0 4) ~MPR1~0)) (and .cse1 (= ~s~0 ~NP~0) .cse0) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) .cse4 (not (<= 1 |old(~s~0)|))))) [2019-10-14 23:18:24,160 INFO L439 ceAbstractionStarter]: At program point L458(lines 457 472) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) .cse2 (and (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1)) (not (<= 1 |old(~s~0)|))) (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse0 .cse1 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2019-10-14 23:18:24,160 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 494) no Hoare annotation was computed. [2019-10-14 23:18:24,160 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 473) no Hoare annotation was computed. [2019-10-14 23:18:24,160 INFO L443 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 436 499) no Hoare annotation was computed. [2019-10-14 23:18:24,161 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 485) no Hoare annotation was computed. [2019-10-14 23:18:24,161 INFO L439 ceAbstractionStarter]: At program point L446(line 446) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (and (<= ~s~0 1) (<= 1 ~s~0) (= ~setEventCalled~0 1)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) .cse2 (not (<= 1 |old(~s~0)|))) (or .cse0 .cse1 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2019-10-14 23:18:24,161 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 436 499) no Hoare annotation was computed. [2019-10-14 23:18:24,161 INFO L439 ceAbstractionStarter]: At program point L492(line 492) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) .cse2 (not (<= 1 |old(~s~0)|))) (or .cse0 .cse1 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2019-10-14 23:18:24,161 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 474 496) no Hoare annotation was computed. [2019-10-14 23:18:24,161 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 472) no Hoare annotation was computed. [2019-10-14 23:18:24,162 INFO L439 ceAbstractionStarter]: At program point L451(lines 450 473) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) .cse2 (not (<= 1 |old(~s~0)|)) (= ~MPR1~0 ~s~0)) (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse0 .cse1 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2019-10-14 23:18:24,162 INFO L439 ceAbstractionStarter]: At program point L456(lines 455 472) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) .cse2 (not (<= 1 |old(~s~0)|)) (= ~MPR1~0 ~s~0)) (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse0 .cse1 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2019-10-14 23:18:24,162 INFO L439 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (or (not (= ~setEventCalled~0 1)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,162 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 422 435) no Hoare annotation was computed. [2019-10-14 23:18:24,163 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 422 435) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= ~setEventCalled~0 1)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,163 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 422 435) no Hoare annotation was computed. [2019-10-14 23:18:24,163 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:18:24,163 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~pended~0 |old(~pended~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~NP~0 |old(~NP~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~Executive~0 |old(~Executive~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~s~0 |old(~s~0)|) (= ~DC~0 |old(~DC~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~MPR3~0 |old(~MPR3~0)|)) [2019-10-14 23:18:24,163 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:18:24,165 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 522 563) no Hoare annotation was computed. [2019-10-14 23:18:24,165 INFO L439 ceAbstractionStarter]: At program point L535(lines 527 546) the Hoare annotation is: (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (<= ~SKIP1~0 3))) (.cse2 (= 1 ~pended~0)) (.cse5 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0))) (.cse6 (not (<= ~NP~0 1))) (.cse4 (not (<= 3 ~SKIP1~0)))) (and (or .cse0 (and (= ~customIrp~0 |old(~customIrp~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 (not (<= 1 |old(~s~0)|))) (or .cse0 (not (<= 1 ~NP~0)) .cse1 .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 .cse6 .cse4))) [2019-10-14 23:18:24,165 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 546) no Hoare annotation was computed. [2019-10-14 23:18:24,165 INFO L439 ceAbstractionStarter]: At program point L552(lines 551 561) the Hoare annotation is: (let ((.cse2 (= 1 ~pended~0)) (.cse10 (<= 3 ~SKIP1~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= ~SKIP1~0 3))) (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not .cse9)) (.cse4 (not .cse8)) (.cse7 (not .cse10)) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse6 (and (not .cse2) (= ~s~0 ~NP~0) .cse8 .cse9 .cse10)) (.cse5 (not (<= ~NP~0 1)))) (and (or .cse0 (not (<= 1 ~NP~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 .cse5 .cse6 .cse7) (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse4 .cse7) .cse3 .cse6 .cse5 (not (<= 1 |old(~s~0)|)))))) [2019-10-14 23:18:24,166 INFO L439 ceAbstractionStarter]: At program point L550(lines 549 561) the Hoare annotation is: (let ((.cse2 (= 1 ~pended~0)) (.cse10 (<= 3 ~SKIP1~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= ~SKIP1~0 3))) (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not .cse9)) (.cse4 (not .cse8)) (.cse7 (not .cse10)) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse6 (and (not .cse2) (= ~s~0 ~NP~0) .cse8 .cse9 .cse10)) (.cse5 (not (<= ~NP~0 1)))) (and (or .cse0 (not (<= 1 ~NP~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 .cse5 .cse6 .cse7) (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse4 .cse7) .cse3 .cse6 .cse5 (not (<= 1 |old(~s~0)|)))))) [2019-10-14 23:18:24,166 INFO L439 ceAbstractionStarter]: At program point L542(line 542) the Hoare annotation is: (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (<= ~SKIP1~0 3))) (.cse2 (= 1 ~pended~0)) (.cse5 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0))) (.cse6 (not (<= ~NP~0 1))) (.cse4 (not (<= 3 ~SKIP1~0)))) (and (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 (not (<= 1 |old(~s~0)|))) (or .cse0 (not (<= 1 ~NP~0)) .cse1 .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 .cse6 .cse4))) [2019-10-14 23:18:24,166 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 522 563) no Hoare annotation was computed. [2019-10-14 23:18:24,167 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 544) no Hoare annotation was computed. [2019-10-14 23:18:24,167 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 527 546) no Hoare annotation was computed. [2019-10-14 23:18:24,167 INFO L443 ceAbstractionStarter]: For program point L528(lines 528 533) no Hoare annotation was computed. [2019-10-14 23:18:24,167 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 522 563) the Hoare annotation is: (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (<= ~SKIP1~0 3))) (.cse6 (= ~customIrp~0 |old(~customIrp~0)|)) (.cse7 (= ~setEventCalled~0 1)) (.cse2 (= 1 ~pended~0)) (.cse5 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0))) (.cse8 (not (<= ~NP~0 1))) (.cse4 (not (<= 3 ~SKIP1~0)))) (and (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5 (and .cse6 (= ~s~0 ~NP~0) .cse7) .cse8 (not (<= 1 |old(~s~0)|))) (or .cse0 (not (<= 1 ~NP~0)) .cse1 (and .cse6 (= ~MPR3~0 ~s~0) .cse7) .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 .cse8 .cse4))) [2019-10-14 23:18:24,167 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 561) no Hoare annotation was computed. [2019-10-14 23:18:24,167 INFO L439 ceAbstractionStarter]: At program point L508(line 508) the Hoare annotation is: (or (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (= |old(~s~0)| ~NP~0)) (not (<= 1 ~compRegistered~0)) (not (<= 3 ~SKIP1~0))) [2019-10-14 23:18:24,167 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 500 513) no Hoare annotation was computed. [2019-10-14 23:18:24,167 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 500 513) the Hoare annotation is: (or (not (<= ~SKIP1~0 3)) (= ~s~0 |old(~s~0)|) (= 1 ~pended~0) (not (= |old(~s~0)| ~NP~0)) (not (<= 1 ~compRegistered~0)) (not (<= 3 ~SKIP1~0))) [2019-10-14 23:18:24,168 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 510) no Hoare annotation was computed. [2019-10-14 23:18:24,168 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 500 513) no Hoare annotation was computed. [2019-10-14 23:18:24,168 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:18:24,168 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ~MPR1~0 ~s~0) (= ~NP~0 ~MPR1~0) (= ~MPR3~0 ~s~0) (<= ~MPR3~0 0) (<= 0 ~MPR3~0) (= ~SKIP1~0 ~s~0)) [2019-10-14 23:18:24,168 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:18:24,168 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:18:24,168 INFO L439 ceAbstractionStarter]: At program point L225(lines 225 226) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (and (= 0 ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,168 INFO L443 ceAbstractionStarter]: For program point L225-1(lines 225 226) no Hoare annotation was computed. [2019-10-14 23:18:24,169 INFO L439 ceAbstractionStarter]: At program point L250(line 250) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,169 INFO L443 ceAbstractionStarter]: For program point L250-1(lines 246 252) no Hoare annotation was computed. [2019-10-14 23:18:24,169 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 269) no Hoare annotation was computed. [2019-10-14 23:18:24,169 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 280) no Hoare annotation was computed. [2019-10-14 23:18:24,169 INFO L439 ceAbstractionStarter]: At program point L102(lines 101 283) the Hoare annotation is: (or (and (= ~customIrp~0 |old(~customIrp~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~s~0 ~NP~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (<= 0 KbFilter_PnP_~status~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,169 INFO L439 ceAbstractionStarter]: At program point L193(lines 193 195) the Hoare annotation is: (let ((.cse9 (<= 1 ~compRegistered~0)) (.cse10 (<= 0 KbFilter_PnP_~status~0)) (.cse11 (= ~setEventCalled~0 1))) (let ((.cse0 (and .cse9 (<= 1 ~s~0) .cse10 (<= ~s~0 1) .cse11)) (.cse1 (not (<= ~SKIP1~0 3))) (.cse2 (= 1 ~pended~0)) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~NP~0 1))) (.cse5 (not (<= 3 ~SKIP1~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (<= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (<= KbFilter_PnP_~__cil_tmp23~0 259) (<= 259 KbFilter_PnP_~__cil_tmp23~0) (= ~MPR3~0 ~s~0) .cse9 .cse10 .cse11)) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~myStatus~0 1073741637) 0) .cse6 .cse7 .cse8)))) [2019-10-14 23:18:24,170 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 193 195) no Hoare annotation was computed. [2019-10-14 23:18:24,170 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 266) no Hoare annotation was computed. [2019-10-14 23:18:24,170 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 277) no Hoare annotation was computed. [2019-10-14 23:18:24,170 INFO L439 ceAbstractionStarter]: At program point L210(line 210) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,170 INFO L439 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,170 INFO L439 ceAbstractionStarter]: At program point L235(line 235) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,170 INFO L443 ceAbstractionStarter]: For program point L235-1(lines 231 237) no Hoare annotation was computed. [2019-10-14 23:18:24,170 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 263) no Hoare annotation was computed. [2019-10-14 23:18:24,171 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 274) no Hoare annotation was computed. [2019-10-14 23:18:24,171 INFO L439 ceAbstractionStarter]: At program point L219(line 219) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,171 INFO L439 ceAbstractionStarter]: At program point L186(lines 186 187) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse5 (not (= |old(~compRegistered~0)| 0))) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= ~NP~0 1))) (.cse4 (not (<= 3 ~SKIP1~0))) (.cse6 (not (<= 1 |old(~s~0)|)))) (and (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~s~0)| ~NP~0)) .cse5 (<= (+ ~myStatus~0 1073741637) 0) .cse6) (or (and (= ~customIrp~0 |old(~customIrp~0)|) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (<= 0 KbFilter_PnP_~status~0) (<= ~s~0 1)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse0 .cse1 .cse5 .cse2 .cse3 .cse4 .cse6))) [2019-10-14 23:18:24,171 INFO L443 ceAbstractionStarter]: For program point L219-1(lines 215 221) no Hoare annotation was computed. [2019-10-14 23:18:24,171 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 186 187) no Hoare annotation was computed. [2019-10-14 23:18:24,171 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPEXIT(lines 74 286) no Hoare annotation was computed. [2019-10-14 23:18:24,171 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 182) no Hoare annotation was computed. [2019-10-14 23:18:24,172 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 271) no Hoare annotation was computed. [2019-10-14 23:18:24,172 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 282) no Hoare annotation was computed. [2019-10-14 23:18:24,172 INFO L446 ceAbstractionStarter]: At program point L261(lines 165 262) the Hoare annotation is: true [2019-10-14 23:18:24,172 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 268) no Hoare annotation was computed. [2019-10-14 23:18:24,172 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 279) no Hoare annotation was computed. [2019-10-14 23:18:24,172 INFO L439 ceAbstractionStarter]: At program point KbFilter_PnPENTRY(lines 74 286) the Hoare annotation is: (or (and (= ~customIrp~0 |old(~customIrp~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~s~0 ~NP~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,172 INFO L439 ceAbstractionStarter]: At program point L105(lines 104 282) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (and (= ~customIrp~0 |old(~customIrp~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,173 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPFINAL(lines 74 286) no Hoare annotation was computed. [2019-10-14 23:18:24,173 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 265) no Hoare annotation was computed. [2019-10-14 23:18:24,173 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 276) no Hoare annotation was computed. [2019-10-14 23:18:24,173 INFO L439 ceAbstractionStarter]: At program point L172(line 172) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,173 INFO L439 ceAbstractionStarter]: At program point L164(lines 110 280) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (and (= ~customIrp~0 |old(~customIrp~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,173 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 273) no Hoare annotation was computed. [2019-10-14 23:18:24,173 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 270) no Hoare annotation was computed. [2019-10-14 23:18:24,173 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 281) no Hoare annotation was computed. [2019-10-14 23:18:24,174 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 237) no Hoare annotation was computed. [2019-10-14 23:18:24,174 INFO L439 ceAbstractionStarter]: At program point L256(lines 256 257) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (and (= 0 ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,174 INFO L443 ceAbstractionStarter]: For program point L256-1(lines 256 257) no Hoare annotation was computed. [2019-10-14 23:18:24,174 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 221) no Hoare annotation was computed. [2019-10-14 23:18:24,174 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 267) no Hoare annotation was computed. [2019-10-14 23:18:24,174 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 278) no Hoare annotation was computed. [2019-10-14 23:18:24,174 INFO L439 ceAbstractionStarter]: At program point L108(lines 107 281) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (and (= ~customIrp~0 |old(~customIrp~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,175 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 205) no Hoare annotation was computed. [2019-10-14 23:18:24,175 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 197) no Hoare annotation was computed. [2019-10-14 23:18:24,176 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 264) no Hoare annotation was computed. [2019-10-14 23:18:24,176 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 275) no Hoare annotation was computed. [2019-10-14 23:18:24,176 INFO L443 ceAbstractionStarter]: For program point L191-2(lines 165 260) no Hoare annotation was computed. [2019-10-14 23:18:24,176 INFO L439 ceAbstractionStarter]: At program point L241(line 241) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (and (= 0 ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 |old(~s~0)|))) [2019-10-14 23:18:24,176 INFO L443 ceAbstractionStarter]: For program point L241-1(line 241) no Hoare annotation was computed. [2019-10-14 23:18:24,177 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 181) no Hoare annotation was computed. [2019-10-14 23:18:24,177 INFO L443 ceAbstractionStarter]: For program point L175-1(lines 170 182) no Hoare annotation was computed. [2019-10-14 23:18:24,177 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 204) no Hoare annotation was computed. [2019-10-14 23:18:24,177 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 272) no Hoare annotation was computed. [2019-10-14 23:18:24,177 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 283) no Hoare annotation was computed. [2019-10-14 23:18:24,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:18:24 BoogieIcfgContainer [2019-10-14 23:18:24,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:18:24,245 INFO L168 Benchmark]: Toolchain (without parser) took 18345.72 ms. Allocated memory was 142.1 MB in the beginning and 437.8 MB in the end (delta: 295.7 MB). Free memory was 99.8 MB in the beginning and 95.1 MB in the end (delta: 4.7 MB). Peak memory consumption was 316.2 MB. Max. memory is 7.1 GB. [2019-10-14 23:18:24,245 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-14 23:18:24,246 INFO L168 Benchmark]: CACSL2BoogieTranslator took 653.42 ms. Allocated memory was 142.1 MB in the beginning and 199.2 MB in the end (delta: 57.1 MB). Free memory was 99.3 MB in the beginning and 174.4 MB in the end (delta: -75.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:18:24,247 INFO L168 Benchmark]: Boogie Preprocessor took 58.58 ms. Allocated memory is still 199.2 MB. Free memory was 174.4 MB in the beginning and 172.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-10-14 23:18:24,248 INFO L168 Benchmark]: RCFGBuilder took 806.53 ms. Allocated memory is still 199.2 MB. Free memory was 172.2 MB in the beginning and 127.1 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:18:24,249 INFO L168 Benchmark]: TraceAbstraction took 16822.90 ms. Allocated memory was 199.2 MB in the beginning and 437.8 MB in the end (delta: 238.6 MB). Free memory was 127.1 MB in the beginning and 95.1 MB in the end (delta: 32.0 MB). Peak memory consumption was 286.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:18:24,257 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.46 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 653.42 ms. Allocated memory was 142.1 MB in the beginning and 199.2 MB in the end (delta: 57.1 MB). Free memory was 99.3 MB in the beginning and 174.4 MB in the end (delta: -75.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.58 ms. Allocated memory is still 199.2 MB. Free memory was 174.4 MB in the beginning and 172.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.53 ms. Allocated memory is still 199.2 MB. Free memory was 172.2 MB in the beginning and 127.1 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16822.90 ms. Allocated memory was 199.2 MB in the beginning and 437.8 MB in the end (delta: 238.6 MB). Free memory was 127.1 MB in the beginning and 95.1 MB in the end (delta: 32.0 MB). Peak memory consumption was 286.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 580]: 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: 386]: Loop Invariant Derived loop invariant: (((((((!(\old(NP) == \old(MPR1)) || (!(1 == pended) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((((((!(\old(NP) == \old(MPR1)) || (!(1 == pended) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((((!(\old(NP) == \old(MPR1)) || (!(1 == pended) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((0 <= status || !(\old(NP) == \old(MPR1))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((((!(1 <= NP) || !(\old(s) <= 1)) || !(SKIP1 <= 3)) || 1 == pended) || !(\old(compRegistered) == 0)) || (((((customIrp == \old(customIrp) && s == \old(s)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == \old(compRegistered)) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus))) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(1 <= \old(s)) - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) || !(SKIP1 <= 3)) || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(3 <= SKIP1)) && ((((((((((!(1 <= NP) || !(\old(s) <= 1)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(1 <= \old(s))) || (MPR1 == s && returnVal2 <= 0)) || ((MPR1 == s && 259 == returnVal2) && setEventCalled == 1)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: (((((!(\old(setEventCalled) == 1) || ((customIrp == \old(customIrp) && setEventCalled == \old(setEventCalled)) && s == NP)) || (((!(\old(s) == NP) || !(SKIP1 <= 3)) || 1 == pended) || !(1 <= compRegistered)) || !(3 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(1 <= \old(s))) && ((((((((!(\old(setEventCalled) == 1) || !(1 <= NP)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(3 <= SKIP1)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((!(1 <= NP) || !(\old(s) <= 1)) || !(SKIP1 <= 3)) || 1 == pended) || !(\old(compRegistered) == 0)) || (((((customIrp == \old(customIrp) && s == \old(s)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == \old(compRegistered)) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus))) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(1 <= \old(s)) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((((!(1 <= NP) || !(\old(s) <= 1)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(1 <= \old(s))) || MPR1 == s) && (((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) || !(SKIP1 <= 3)) || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(3 <= SKIP1)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((!(1 <= NP) || !(\old(s) <= 1)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(3 <= SKIP1)) || (MPR1 == s && setEventCalled == 1)) || !(1 <= \old(s))) && (((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) || !(SKIP1 <= 3)) || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(3 <= SKIP1)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((((((customIrp == \old(customIrp) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && s == NP) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == \old(compRegistered)) && 0 <= status) || !(1 <= NP)) || !(\old(s) <= 1)) || !(SKIP1 <= 3)) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(1 <= \old(s)) - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: (((((((((!(\old(setEventCalled) == 1) || !(1 <= NP)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || ((((!(1 == pended) && s == NP) && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1)) || !(3 <= SKIP1)) && (((((!(\old(setEventCalled) == 1) || (((!(\old(s) == NP) || !(SKIP1 <= 3)) || 1 == pended) || !(1 <= compRegistered)) || !(3 <= SKIP1)) || !(NP + 4 <= MPR1)) || ((((!(1 == pended) && s == NP) && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1)) || !(NP <= 1)) || !(1 <= \old(s))) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: (((((((!(\old(NP) == \old(MPR1)) || (!(1 == pended) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((((((!(1 <= NP) || !(\old(s) <= 1)) || !(SKIP1 <= 3)) || 1 == pended) || !(\old(compRegistered) == 0)) || (((((customIrp == \old(customIrp) && s == \old(s)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == \old(compRegistered)) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus))) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(1 <= \old(s)) - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: (((((((((!(\old(setEventCalled) == 1) || !(1 <= NP)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || ((((!(1 == pended) && s == NP) && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1)) || !(3 <= SKIP1)) && (((((!(\old(setEventCalled) == 1) || (((!(\old(s) == NP) || !(SKIP1 <= 3)) || 1 == pended) || !(1 <= compRegistered)) || !(3 <= SKIP1)) || !(NP + 4 <= MPR1)) || ((((!(1 == pended) && s == NP) && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1)) || !(NP <= 1)) || !(1 <= \old(s))) - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: (((((((((!(1 <= NP) || !(\old(s) <= 1)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(1 <= \old(s))) || MPR1 == s) && (((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) || !(SKIP1 <= 3)) || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(3 <= SKIP1)) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: (((((((((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) && SKIP1 <= 3) && 3 <= SKIP1) && s <= 1) && 1 <= s) && NP + 4 <= MPR1) || !(\old(NP) == \old(MPR1))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 151 locations, 1 error locations. Result: SAFE, OverallTime: 16.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.8s, HoareTripleCheckerStatistics: 1748 SDtfs, 2367 SDslu, 2192 SDs, 0 SdLazy, 3775 SolverSat, 652 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 149 SyntacticMatches, 4 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred 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.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 134 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 285 PreInvPairs, 355 NumberOfFragments, 2966 HoareAnnotationTreeSize, 285 FomulaSimplifications, 1250 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 53 FomulaSimplificationsInter, 5891 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 756 NumberOfCodeBlocks, 756 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 741 ConstructedInterpolants, 0 QuantifiedInterpolants, 166358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...