/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:32:18,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:32:18,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:32:18,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:32:18,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:32:18,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:32:18,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:32:18,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:32:18,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:32:18,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:32:18,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:32:18,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:32:18,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:32:18,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:32:18,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:32:18,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:32:18,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:32:18,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:32:18,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:32:18,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:32:18,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:32:18,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:32:18,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:32:18,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:32:18,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:32:18,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:32:18,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:32:18,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:32:18,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:32:18,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:32:18,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:32:18,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:32:18,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:32:18,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:32:18,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:32:18,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:32:18,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:32:18,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:32:18,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:32:18,669 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:32:18,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:32:18,671 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 04:32:18,686 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:32:18,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:32:18,687 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:32:18,687 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:32:18,687 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:32:18,687 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:32:18,688 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:32:18,688 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:32:18,688 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:32:18,688 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:32:18,688 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:32:18,689 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:32:18,689 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:32:18,689 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:32:18,689 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:32:18,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:32:18,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:32:18,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:32:18,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:32:18,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:32:18,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:32:18,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:32:18,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:32:18,692 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:32:18,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:32:18,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:32:18,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:32:18,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:32:18,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:32:18,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:32:18,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:32:18,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:32:18,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:32:18,694 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:32:18,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:32:18,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:32:18,694 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:32:18,694 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:32:18,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:32:19,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:32:19,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:32:19,019 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:32:19,019 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:32:19,020 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-11-24 04:32:19,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/730818a63/af7d7612d9204bc5a794ef2be8406a13/FLAG350376f75 [2019-11-24 04:32:19,569 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:32:19,570 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-11-24 04:32:19,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/730818a63/af7d7612d9204bc5a794ef2be8406a13/FLAG350376f75 [2019-11-24 04:32:19,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/730818a63/af7d7612d9204bc5a794ef2be8406a13 [2019-11-24 04:32:19,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:32:19,872 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:32:19,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:32:19,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:32:19,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:32:19,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:32:19" (1/1) ... [2019-11-24 04:32:19,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9c0de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:19, skipping insertion in model container [2019-11-24 04:32:19,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:32:19" (1/1) ... [2019-11-24 04:32:19,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:32:19,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:32:20,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:32:20,227 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:32:20,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:32:20,422 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:32:20,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:20 WrapperNode [2019-11-24 04:32:20,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:32:20,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:32:20,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:32:20,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:32:20,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:20" (1/1) ... [2019-11-24 04:32:20,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:20" (1/1) ... [2019-11-24 04:32:20,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:32:20,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:32:20,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:32:20,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:32:20,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:20" (1/1) ... [2019-11-24 04:32:20,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:20" (1/1) ... [2019-11-24 04:32:20,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:20" (1/1) ... [2019-11-24 04:32:20,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:20" (1/1) ... [2019-11-24 04:32:20,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:20" (1/1) ... [2019-11-24 04:32:20,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:20" (1/1) ... [2019-11-24 04:32:20,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:20" (1/1) ... [2019-11-24 04:32:20,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:32:20,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:32:20,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:32:20,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:32:20,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:20" (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-11-24 04:32:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:32:20,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:32:20,973 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:20,994 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:21,018 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:21,027 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:21,032 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:21,036 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:21,039 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:21,043 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:21,046 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:21,048 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:21,050 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:21,057 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:22,080 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-11-24 04:32:22,080 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-11-24 04:32:22,081 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-11-24 04:32:22,081 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-11-24 04:32:22,081 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2019-11-24 04:32:22,081 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2019-11-24 04:32:22,081 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-11-24 04:32:22,081 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-11-24 04:32:22,082 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2019-11-24 04:32:22,082 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2019-11-24 04:32:22,082 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-24 04:32:22,082 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-24 04:32:22,083 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2019-11-24 04:32:22,083 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2019-11-24 04:32:22,083 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2019-11-24 04:32:22,083 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2019-11-24 04:32:22,084 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2019-11-24 04:32:22,084 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2019-11-24 04:32:22,084 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2019-11-24 04:32:22,084 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2019-11-24 04:32:22,084 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-24 04:32:22,084 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-24 04:32:22,084 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2019-11-24 04:32:22,085 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2019-11-24 04:32:22,892 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:32:22,892 INFO L284 CfgBuilder]: Removed 152 assume(true) statements. [2019-11-24 04:32:22,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:32:22 BoogieIcfgContainer [2019-11-24 04:32:22,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:32:22,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:32:22,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:32:22,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:32:22,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:32:19" (1/3) ... [2019-11-24 04:32:22,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4dc62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:32:22, skipping insertion in model container [2019-11-24 04:32:22,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:20" (2/3) ... [2019-11-24 04:32:22,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4dc62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:32:22, skipping insertion in model container [2019-11-24 04:32:22,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:32:22" (3/3) ... [2019-11-24 04:32:22,903 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2019-11-24 04:32:22,914 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:32:22,922 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-24 04:32:22,934 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-24 04:32:22,962 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:32:22,962 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:32:22,962 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:32:22,963 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:32:22,963 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:32:22,963 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:32:22,963 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:32:22,963 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:32:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-24 04:32:22,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:32:23,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:23,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:23,002 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:23,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1094760104, now seen corresponding path program 1 times [2019-11-24 04:32:23,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:23,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750166702] [2019-11-24 04:32:23,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:23,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750166702] [2019-11-24 04:32:23,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:23,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:23,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091813148] [2019-11-24 04:32:23,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:23,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:23,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:23,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:23,249 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-24 04:32:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:23,496 INFO L93 Difference]: Finished difference Result 349 states and 520 transitions. [2019-11-24 04:32:23,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:23,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 04:32:23,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:23,520 INFO L225 Difference]: With dead ends: 349 [2019-11-24 04:32:23,521 INFO L226 Difference]: Without dead ends: 180 [2019-11-24 04:32:23,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:23,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-24 04:32:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-11-24 04:32:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-24 04:32:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 241 transitions. [2019-11-24 04:32:23,591 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 241 transitions. Word has length 9 [2019-11-24 04:32:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:23,591 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 241 transitions. [2019-11-24 04:32:23,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 241 transitions. [2019-11-24 04:32:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:32:23,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:23,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:23,593 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:23,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:23,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1602184203, now seen corresponding path program 1 times [2019-11-24 04:32:23,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:23,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720080040] [2019-11-24 04:32:23,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:23,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720080040] [2019-11-24 04:32:23,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:23,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:32:23,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790019075] [2019-11-24 04:32:23,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:23,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:23,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:23,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:23,638 INFO L87 Difference]: Start difference. First operand 180 states and 241 transitions. Second operand 3 states. [2019-11-24 04:32:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:23,679 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2019-11-24 04:32:23,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:23,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-24 04:32:23,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:23,682 INFO L225 Difference]: With dead ends: 193 [2019-11-24 04:32:23,682 INFO L226 Difference]: Without dead ends: 180 [2019-11-24 04:32:23,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:23,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-24 04:32:23,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-11-24 04:32:23,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-24 04:32:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 240 transitions. [2019-11-24 04:32:23,698 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 240 transitions. Word has length 10 [2019-11-24 04:32:23,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:23,698 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 240 transitions. [2019-11-24 04:32:23,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:23,699 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 240 transitions. [2019-11-24 04:32:23,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:32:23,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:23,700 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:23,700 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:23,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:23,701 INFO L82 PathProgramCache]: Analyzing trace with hash 724220205, now seen corresponding path program 1 times [2019-11-24 04:32:23,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:23,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713162206] [2019-11-24 04:32:23,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:23,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713162206] [2019-11-24 04:32:23,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:23,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:23,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742424901] [2019-11-24 04:32:23,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:23,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:23,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:23,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:23,753 INFO L87 Difference]: Start difference. First operand 180 states and 240 transitions. Second operand 3 states. [2019-11-24 04:32:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:23,816 INFO L93 Difference]: Finished difference Result 276 states and 360 transitions. [2019-11-24 04:32:23,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:23,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-24 04:32:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:23,821 INFO L225 Difference]: With dead ends: 276 [2019-11-24 04:32:23,822 INFO L226 Difference]: Without dead ends: 182 [2019-11-24 04:32:23,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:23,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-24 04:32:23,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 150. [2019-11-24 04:32:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-24 04:32:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 196 transitions. [2019-11-24 04:32:23,842 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 196 transitions. Word has length 10 [2019-11-24 04:32:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:23,842 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 196 transitions. [2019-11-24 04:32:23,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 196 transitions. [2019-11-24 04:32:23,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:32:23,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:23,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:23,844 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:23,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash 305808601, now seen corresponding path program 1 times [2019-11-24 04:32:23,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:23,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381055670] [2019-11-24 04:32:23,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:23,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381055670] [2019-11-24 04:32:23,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:23,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:23,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474410091] [2019-11-24 04:32:23,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:23,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:23,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:23,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:23,906 INFO L87 Difference]: Start difference. First operand 150 states and 196 transitions. Second operand 3 states. [2019-11-24 04:32:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:24,017 INFO L93 Difference]: Finished difference Result 150 states and 196 transitions. [2019-11-24 04:32:24,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:24,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:32:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:24,019 INFO L225 Difference]: With dead ends: 150 [2019-11-24 04:32:24,019 INFO L226 Difference]: Without dead ends: 136 [2019-11-24 04:32:24,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-24 04:32:24,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-11-24 04:32:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-24 04:32:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 182 transitions. [2019-11-24 04:32:24,035 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 182 transitions. Word has length 15 [2019-11-24 04:32:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:24,036 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 182 transitions. [2019-11-24 04:32:24,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 182 transitions. [2019-11-24 04:32:24,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:32:24,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:24,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:24,041 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:24,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:24,042 INFO L82 PathProgramCache]: Analyzing trace with hash 617884193, now seen corresponding path program 1 times [2019-11-24 04:32:24,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:24,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723461844] [2019-11-24 04:32:24,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:24,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-11-24 04:32:24,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723461844] [2019-11-24 04:32:24,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:24,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:24,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200463536] [2019-11-24 04:32:24,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:24,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:24,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:24,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:24,132 INFO L87 Difference]: Start difference. First operand 136 states and 182 transitions. Second operand 3 states. [2019-11-24 04:32:24,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:24,161 INFO L93 Difference]: Finished difference Result 182 states and 238 transitions. [2019-11-24 04:32:24,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:24,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 04:32:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:24,163 INFO L225 Difference]: With dead ends: 182 [2019-11-24 04:32:24,163 INFO L226 Difference]: Without dead ends: 150 [2019-11-24 04:32:24,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-24 04:32:24,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2019-11-24 04:32:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-24 04:32:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 181 transitions. [2019-11-24 04:32:24,175 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 181 transitions. Word has length 18 [2019-11-24 04:32:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:24,176 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 181 transitions. [2019-11-24 04:32:24,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2019-11-24 04:32:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:32:24,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:24,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:24,180 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:24,183 INFO L82 PathProgramCache]: Analyzing trace with hash -819803429, now seen corresponding path program 1 times [2019-11-24 04:32:24,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:24,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682614543] [2019-11-24 04:32:24,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:24,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682614543] [2019-11-24 04:32:24,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:24,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:24,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347182127] [2019-11-24 04:32:24,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:24,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:24,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:24,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:24,264 INFO L87 Difference]: Start difference. First operand 136 states and 181 transitions. Second operand 3 states. [2019-11-24 04:32:24,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:24,399 INFO L93 Difference]: Finished difference Result 166 states and 218 transitions. [2019-11-24 04:32:24,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:24,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 04:32:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:24,400 INFO L225 Difference]: With dead ends: 166 [2019-11-24 04:32:24,401 INFO L226 Difference]: Without dead ends: 133 [2019-11-24 04:32:24,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-24 04:32:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-24 04:32:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-24 04:32:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions. [2019-11-24 04:32:24,410 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 18 [2019-11-24 04:32:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:24,411 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 177 transitions. [2019-11-24 04:32:24,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions. [2019-11-24 04:32:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:32:24,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:24,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:24,412 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:24,413 INFO L82 PathProgramCache]: Analyzing trace with hash -181215385, now seen corresponding path program 1 times [2019-11-24 04:32:24,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:24,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615320972] [2019-11-24 04:32:24,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:24,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615320972] [2019-11-24 04:32:24,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:24,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:24,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597276445] [2019-11-24 04:32:24,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:24,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:24,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:24,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:24,491 INFO L87 Difference]: Start difference. First operand 133 states and 177 transitions. Second operand 3 states. [2019-11-24 04:32:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:24,512 INFO L93 Difference]: Finished difference Result 177 states and 231 transitions. [2019-11-24 04:32:24,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:24,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:32:24,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:24,514 INFO L225 Difference]: With dead ends: 177 [2019-11-24 04:32:24,514 INFO L226 Difference]: Without dead ends: 145 [2019-11-24 04:32:24,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-24 04:32:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2019-11-24 04:32:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-24 04:32:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2019-11-24 04:32:24,523 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 19 [2019-11-24 04:32:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:24,523 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2019-11-24 04:32:24,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2019-11-24 04:32:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:32:24,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:24,524 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:24,525 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1177275976, now seen corresponding path program 1 times [2019-11-24 04:32:24,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:24,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969718203] [2019-11-24 04:32:24,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:24,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969718203] [2019-11-24 04:32:24,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:24,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:24,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437139872] [2019-11-24 04:32:24,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:24,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:24,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:24,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:24,589 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand 4 states. [2019-11-24 04:32:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:24,729 INFO L93 Difference]: Finished difference Result 161 states and 211 transitions. [2019-11-24 04:32:24,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:24,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-24 04:32:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:24,731 INFO L225 Difference]: With dead ends: 161 [2019-11-24 04:32:24,731 INFO L226 Difference]: Without dead ends: 131 [2019-11-24 04:32:24,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-24 04:32:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-24 04:32:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-24 04:32:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 173 transitions. [2019-11-24 04:32:24,741 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 173 transitions. Word has length 20 [2019-11-24 04:32:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:24,742 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 173 transitions. [2019-11-24 04:32:24,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 173 transitions. [2019-11-24 04:32:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:32:24,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:24,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:24,744 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:24,745 INFO L82 PathProgramCache]: Analyzing trace with hash -557599436, now seen corresponding path program 1 times [2019-11-24 04:32:24,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:24,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483252597] [2019-11-24 04:32:24,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:24,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483252597] [2019-11-24 04:32:24,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:24,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:24,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714207225] [2019-11-24 04:32:24,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:24,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:24,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:24,800 INFO L87 Difference]: Start difference. First operand 131 states and 173 transitions. Second operand 3 states. [2019-11-24 04:32:24,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:24,818 INFO L93 Difference]: Finished difference Result 138 states and 183 transitions. [2019-11-24 04:32:24,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:24,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:32:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:24,823 INFO L225 Difference]: With dead ends: 138 [2019-11-24 04:32:24,823 INFO L226 Difference]: Without dead ends: 29 [2019-11-24 04:32:24,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-24 04:32:24,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-24 04:32:24,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-24 04:32:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-24 04:32:24,829 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 21 [2019-11-24 04:32:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:24,830 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-24 04:32:24,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-24 04:32:24,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:32:24,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:24,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:24,831 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:24,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:24,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1370950513, now seen corresponding path program 1 times [2019-11-24 04:32:24,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:24,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137099261] [2019-11-24 04:32:24,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:24,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137099261] [2019-11-24 04:32:24,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:24,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:24,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007726114] [2019-11-24 04:32:24,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:24,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:24,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:24,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:24,914 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2019-11-24 04:32:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:24,973 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-11-24 04:32:24,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:24,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-24 04:32:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:24,974 INFO L225 Difference]: With dead ends: 33 [2019-11-24 04:32:24,974 INFO L226 Difference]: Without dead ends: 29 [2019-11-24 04:32:24,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:32:24,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-24 04:32:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-24 04:32:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-24 04:32:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-11-24 04:32:24,979 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 21 [2019-11-24 04:32:24,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:24,980 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-11-24 04:32:24,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-11-24 04:32:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:32:24,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:24,980 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:24,981 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:24,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:24,981 INFO L82 PathProgramCache]: Analyzing trace with hash 384562189, now seen corresponding path program 1 times [2019-11-24 04:32:24,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:24,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190572233] [2019-11-24 04:32:24,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:25,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190572233] [2019-11-24 04:32:25,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:25,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:25,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547836067] [2019-11-24 04:32:25,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:25,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:25,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:25,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:25,015 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 3 states. [2019-11-24 04:32:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:25,032 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-11-24 04:32:25,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:25,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 04:32:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:25,033 INFO L225 Difference]: With dead ends: 33 [2019-11-24 04:32:25,033 INFO L226 Difference]: Without dead ends: 31 [2019-11-24 04:32:25,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-24 04:32:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-24 04:32:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 04:32:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-11-24 04:32:25,038 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 22 [2019-11-24 04:32:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:25,039 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-11-24 04:32:25,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-11-24 04:32:25,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:32:25,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:25,040 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:25,040 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:25,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:25,040 INFO L82 PathProgramCache]: Analyzing trace with hash -971132746, now seen corresponding path program 1 times [2019-11-24 04:32:25,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:25,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32046789] [2019-11-24 04:32:25,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:25,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32046789] [2019-11-24 04:32:25,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:25,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:25,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207203939] [2019-11-24 04:32:25,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:25,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:25,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:25,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:25,084 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 3 states. [2019-11-24 04:32:25,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:25,091 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-11-24 04:32:25,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:25,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 04:32:25,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:25,092 INFO L225 Difference]: With dead ends: 36 [2019-11-24 04:32:25,092 INFO L226 Difference]: Without dead ends: 26 [2019-11-24 04:32:25,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-24 04:32:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-24 04:32:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-24 04:32:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2019-11-24 04:32:25,095 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 23 [2019-11-24 04:32:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:25,096 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2019-11-24 04:32:25,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2019-11-24 04:32:25,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:32:25,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:25,099 INFO L410 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] [2019-11-24 04:32:25,099 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:25,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:25,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1845403150, now seen corresponding path program 1 times [2019-11-24 04:32:25,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:25,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082321976] [2019-11-24 04:32:25,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:25,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082321976] [2019-11-24 04:32:25,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:25,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:32:25,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650053582] [2019-11-24 04:32:25,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:25,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:25,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:25,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:25,153 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand 4 states. [2019-11-24 04:32:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:25,166 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2019-11-24 04:32:25,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:25,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-24 04:32:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:25,167 INFO L225 Difference]: With dead ends: 26 [2019-11-24 04:32:25,167 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 04:32:25,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 04:32:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 04:32:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 04:32:25,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 04:32:25,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-24 04:32:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:25,168 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 04:32:25,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:25,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 04:32:25,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 04:32:25,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 04:32:26,041 INFO L444 ceAbstractionStarter]: For program point L894(lines 894 982) no Hoare annotation was computed. [2019-11-24 04:32:26,042 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,042 INFO L444 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-11-24 04:32:26,042 INFO L440 ceAbstractionStarter]: At program point L366(lines 366 407) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,043 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,043 INFO L440 ceAbstractionStarter]: At program point L169(lines 115 286) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,043 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,043 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 243) no Hoare annotation was computed. [2019-11-24 04:32:26,043 INFO L440 ceAbstractionStarter]: At program point L106(lines 106 289) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,044 INFO L440 ceAbstractionStarter]: At program point L371(lines 371 406) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,044 INFO L444 ceAbstractionStarter]: For program point L636(lines 636 654) no Hoare annotation was computed. [2019-11-24 04:32:26,044 INFO L444 ceAbstractionStarter]: For program point L636-1(lines 636 654) no Hoare annotation was computed. [2019-11-24 04:32:26,044 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 980) no Hoare annotation was computed. [2019-11-24 04:32:26,044 INFO L440 ceAbstractionStarter]: At program point L439(lines 430 457) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,044 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 187) no Hoare annotation was computed. [2019-11-24 04:32:26,044 INFO L440 ceAbstractionStarter]: At program point L109(lines 109 288) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,045 INFO L444 ceAbstractionStarter]: For program point L639(lines 639 653) no Hoare annotation was computed. [2019-11-24 04:32:26,045 INFO L444 ceAbstractionStarter]: For program point L639-1(lines 639 653) no Hoare annotation was computed. [2019-11-24 04:32:26,045 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 445) no Hoare annotation was computed. [2019-11-24 04:32:26,045 INFO L440 ceAbstractionStarter]: At program point L970(lines 865 1004) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,045 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,045 INFO L440 ceAbstractionStarter]: At program point L112(lines 112 287) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,046 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,046 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 652) no Hoare annotation was computed. [2019-11-24 04:32:26,046 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,046 INFO L444 ceAbstractionStarter]: For program point L642-1(lines 642 652) no Hoare annotation was computed. [2019-11-24 04:32:26,046 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,046 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 186) no Hoare annotation was computed. [2019-11-24 04:32:26,046 INFO L440 ceAbstractionStarter]: At program point L180-1(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,047 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,047 INFO L440 ceAbstractionStarter]: At program point L643(lines 636 654) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,047 INFO L440 ceAbstractionStarter]: At program point L643-1(lines 636 654) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,047 INFO L444 ceAbstractionStarter]: For program point L908(lines 908 978) no Hoare annotation was computed. [2019-11-24 04:32:26,047 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,047 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 598) no Hoare annotation was computed. [2019-11-24 04:32:26,047 INFO L444 ceAbstractionStarter]: For program point L580(lines 580 585) no Hoare annotation was computed. [2019-11-24 04:32:26,048 INFO L440 ceAbstractionStarter]: At program point L52(lines 345 347) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,048 INFO L444 ceAbstractionStarter]: For program point L915(lines 915 976) no Hoare annotation was computed. [2019-11-24 04:32:26,048 INFO L440 ceAbstractionStarter]: At program point L651(lines 639 653) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,048 INFO L440 ceAbstractionStarter]: At program point L651-1(lines 639 653) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,048 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 04:32:26,048 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,049 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,049 INFO L440 ceAbstractionStarter]: At program point L587(lines 579 598) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (<= 0 .cse0) (not (= ~MPR3~0 ~s~0)) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1))) [2019-11-24 04:32:26,049 INFO L440 ceAbstractionStarter]: At program point L522(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,049 INFO L440 ceAbstractionStarter]: At program point L522-1(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,049 INFO L440 ceAbstractionStarter]: At program point L522-2(lines 486 550) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1))) [2019-11-24 04:32:26,050 INFO L440 ceAbstractionStarter]: At program point L522-3(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,050 INFO L440 ceAbstractionStarter]: At program point L522-4(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,050 INFO L440 ceAbstractionStarter]: At program point L522-5(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,050 INFO L440 ceAbstractionStarter]: At program point L522-6(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,050 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,050 INFO L440 ceAbstractionStarter]: At program point L787(lines 751 818) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,050 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,050 INFO L440 ceAbstractionStarter]: At program point L722(lines 697 741) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,050 INFO L444 ceAbstractionStarter]: For program point L922(lines 922 974) no Hoare annotation was computed. [2019-11-24 04:32:26,051 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 596) no Hoare annotation was computed. [2019-11-24 04:32:26,051 INFO L440 ceAbstractionStarter]: At program point L592-1(lines 592 596) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0))) [2019-11-24 04:32:26,051 INFO L440 ceAbstractionStarter]: At program point L328(lines 322 463) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,051 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 203) no Hoare annotation was computed. [2019-11-24 04:32:26,051 INFO L444 ceAbstractionStarter]: For program point L197-2(lines 170 266) no Hoare annotation was computed. [2019-11-24 04:32:26,051 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,051 INFO L447 ceAbstractionStarter]: At program point L462(lines 293 464) the Hoare annotation is: true [2019-11-24 04:32:26,051 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 547) no Hoare annotation was computed. [2019-11-24 04:32:26,051 INFO L444 ceAbstractionStarter]: For program point L530-1(lines 530 547) no Hoare annotation was computed. [2019-11-24 04:32:26,051 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 547) no Hoare annotation was computed. [2019-11-24 04:32:26,052 INFO L444 ceAbstractionStarter]: For program point L530-3(lines 530 547) no Hoare annotation was computed. [2019-11-24 04:32:26,052 INFO L444 ceAbstractionStarter]: For program point L530-4(lines 530 547) no Hoare annotation was computed. [2019-11-24 04:32:26,052 INFO L444 ceAbstractionStarter]: For program point L530-5(lines 530 547) no Hoare annotation was computed. [2019-11-24 04:32:26,052 INFO L444 ceAbstractionStarter]: For program point L530-6(lines 530 547) no Hoare annotation was computed. [2019-11-24 04:32:26,052 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 815) no Hoare annotation was computed. [2019-11-24 04:32:26,052 INFO L440 ceAbstractionStarter]: At program point L267(lines 170 268) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,052 INFO L444 ceAbstractionStarter]: For program point L929(lines 929 972) no Hoare annotation was computed. [2019-11-24 04:32:26,052 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,052 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,053 INFO L444 ceAbstractionStarter]: For program point L469(lines 469 475) no Hoare annotation was computed. [2019-11-24 04:32:26,053 INFO L444 ceAbstractionStarter]: For program point L469-2(lines 469 475) no Hoare annotation was computed. [2019-11-24 04:32:26,053 INFO L444 ceAbstractionStarter]: For program point L469-4(lines 469 475) no Hoare annotation was computed. [2019-11-24 04:32:26,053 INFO L444 ceAbstractionStarter]: For program point L469-6(lines 469 475) no Hoare annotation was computed. [2019-11-24 04:32:26,053 INFO L444 ceAbstractionStarter]: For program point L469-8(lines 469 475) no Hoare annotation was computed. [2019-11-24 04:32:26,053 INFO L444 ceAbstractionStarter]: For program point L469-10(lines 469 475) no Hoare annotation was computed. [2019-11-24 04:32:26,053 INFO L444 ceAbstractionStarter]: For program point L469-12(lines 469 475) no Hoare annotation was computed. [2019-11-24 04:32:26,053 INFO L444 ceAbstractionStarter]: For program point L469-14(lines 469 475) no Hoare annotation was computed. [2019-11-24 04:32:26,053 INFO L444 ceAbstractionStarter]: For program point L932(lines 932 971) no Hoare annotation was computed. [2019-11-24 04:32:26,054 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,054 INFO L440 ceAbstractionStarter]: At program point L74(lines 328 411) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,054 INFO L440 ceAbstractionStarter]: At program point L933(lines 873 988) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,054 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,054 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,054 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 546) no Hoare annotation was computed. [2019-11-24 04:32:26,055 INFO L444 ceAbstractionStarter]: For program point L539-2(lines 539 546) no Hoare annotation was computed. [2019-11-24 04:32:26,055 INFO L444 ceAbstractionStarter]: For program point L539-4(lines 539 546) no Hoare annotation was computed. [2019-11-24 04:32:26,055 INFO L444 ceAbstractionStarter]: For program point L539-6(lines 539 546) no Hoare annotation was computed. [2019-11-24 04:32:26,055 INFO L444 ceAbstractionStarter]: For program point L539-8(lines 539 546) no Hoare annotation was computed. [2019-11-24 04:32:26,055 INFO L444 ceAbstractionStarter]: For program point L539-10(lines 539 546) no Hoare annotation was computed. [2019-11-24 04:32:26,055 INFO L444 ceAbstractionStarter]: For program point L539-12(lines 539 546) no Hoare annotation was computed. [2019-11-24 04:32:26,055 INFO L444 ceAbstractionStarter]: For program point L672(lines 672 678) no Hoare annotation was computed. [2019-11-24 04:32:26,055 INFO L444 ceAbstractionStarter]: For program point L672-2(lines 672 678) no Hoare annotation was computed. [2019-11-24 04:32:26,056 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,056 INFO L444 ceAbstractionStarter]: For program point L672-4(lines 672 678) no Hoare annotation was computed. [2019-11-24 04:32:26,056 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,056 INFO L440 ceAbstractionStarter]: At program point L1003(lines 820 1005) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,056 INFO L444 ceAbstractionStarter]: For program point L873(lines 873 988) no Hoare annotation was computed. [2019-11-24 04:32:26,056 INFO L444 ceAbstractionStarter]: For program point L807(lines 807 814) no Hoare annotation was computed. [2019-11-24 04:32:26,056 INFO L444 ceAbstractionStarter]: For program point L413(lines 413 417) no Hoare annotation was computed. [2019-11-24 04:32:26,057 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,057 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,057 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 04:32:26,057 INFO L444 ceAbstractionStarter]: For program point L1011(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,057 INFO L444 ceAbstractionStarter]: For program point L1011-1(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,057 INFO L444 ceAbstractionStarter]: For program point L1011-2(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,057 INFO L444 ceAbstractionStarter]: For program point L1011-3(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,057 INFO L444 ceAbstractionStarter]: For program point L1011-4(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,058 INFO L444 ceAbstractionStarter]: For program point L1011-5(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,058 INFO L444 ceAbstractionStarter]: For program point L1011-6(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,058 INFO L444 ceAbstractionStarter]: For program point L1011-7(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,058 INFO L444 ceAbstractionStarter]: For program point L1011-8(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,058 INFO L444 ceAbstractionStarter]: For program point L1011-9(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,058 INFO L444 ceAbstractionStarter]: For program point L1011-10(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,058 INFO L444 ceAbstractionStarter]: For program point L1011-11(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,058 INFO L444 ceAbstractionStarter]: For program point L1011-12(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,059 INFO L444 ceAbstractionStarter]: For program point L1011-13(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,059 INFO L444 ceAbstractionStarter]: For program point L1011-14(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,059 INFO L444 ceAbstractionStarter]: For program point L1011-15(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,059 INFO L444 ceAbstractionStarter]: For program point L1011-16(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,059 INFO L444 ceAbstractionStarter]: For program point L1011-17(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,059 INFO L444 ceAbstractionStarter]: For program point L1011-18(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,059 INFO L444 ceAbstractionStarter]: For program point L1011-19(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,060 INFO L440 ceAbstractionStarter]: At program point L351(lines 351 410) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,060 INFO L444 ceAbstractionStarter]: For program point L1011-20(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,060 INFO L444 ceAbstractionStarter]: For program point L1011-21(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,060 INFO L444 ceAbstractionStarter]: For program point L1011-22(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,060 INFO L444 ceAbstractionStarter]: For program point L1011-23(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,060 INFO L444 ceAbstractionStarter]: For program point L1011-24(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,060 INFO L444 ceAbstractionStarter]: For program point L1011-25(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,060 INFO L444 ceAbstractionStarter]: For program point L1011-26(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,061 INFO L444 ceAbstractionStarter]: For program point L1011-27(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,061 INFO L444 ceAbstractionStarter]: For program point L1011-28(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,061 INFO L440 ceAbstractionStarter]: At program point L1012(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,061 INFO L440 ceAbstractionStarter]: At program point L1012-2(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,061 INFO L440 ceAbstractionStarter]: At program point L1012-3(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,061 INFO L440 ceAbstractionStarter]: At program point L1012-5(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,062 INFO L440 ceAbstractionStarter]: At program point L1012-9(lines 1 1014) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (or .cse0 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (not (= 1 ~pended~0)) (<= 0 .cse1) (or .cse0 (= ~MPR3~0 ~s~0)) (= ULTIMATE.start_main_~status~1 0) (<= .cse1 0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1))) [2019-11-24 04:32:26,062 INFO L440 ceAbstractionStarter]: At program point L1012-12(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,062 INFO L440 ceAbstractionStarter]: At program point L1012-14(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,062 INFO L440 ceAbstractionStarter]: At program point L1012-15(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,062 INFO L440 ceAbstractionStarter]: At program point L1012-17(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,063 INFO L440 ceAbstractionStarter]: At program point L1012-18(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,063 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,063 INFO L440 ceAbstractionStarter]: At program point L1012-20(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,063 INFO L440 ceAbstractionStarter]: At program point L1012-21(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,063 INFO L440 ceAbstractionStarter]: At program point L1012-23(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,063 INFO L440 ceAbstractionStarter]: At program point L1012-24(lines 552 565) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,064 INFO L440 ceAbstractionStarter]: At program point L1012-25(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,064 INFO L440 ceAbstractionStarter]: At program point L1012-27(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,064 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,064 INFO L440 ceAbstractionStarter]: At program point L881(lines 881 986) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,064 INFO L440 ceAbstractionStarter]: At program point L419(lines 412 461) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,064 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 227) no Hoare annotation was computed. [2019-11-24 04:32:26,064 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,065 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,065 INFO L440 ceAbstractionStarter]: At program point L487(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,065 INFO L440 ceAbstractionStarter]: At program point L487-1(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,065 INFO L440 ceAbstractionStarter]: At program point L487-2(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,065 INFO L444 ceAbstractionStarter]: For program point L421(lines 421 425) no Hoare annotation was computed. [2019-11-24 04:32:26,065 INFO L440 ceAbstractionStarter]: At program point L487-3(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,066 INFO L440 ceAbstractionStarter]: At program point L487-4(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,066 INFO L440 ceAbstractionStarter]: At program point L487-5(lines 487 499) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1))) [2019-11-24 04:32:26,066 INFO L440 ceAbstractionStarter]: At program point L487-6(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,066 INFO L440 ceAbstractionStarter]: At program point L487-7(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,066 INFO L440 ceAbstractionStarter]: At program point L487-8(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,066 INFO L440 ceAbstractionStarter]: At program point L487-9(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,067 INFO L440 ceAbstractionStarter]: At program point L487-10(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,067 INFO L440 ceAbstractionStarter]: At program point L487-11(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,067 INFO L440 ceAbstractionStarter]: At program point L487-12(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,067 INFO L440 ceAbstractionStarter]: At program point L487-13(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,067 INFO L440 ceAbstractionStarter]: At program point L752(lines 752 764) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,067 INFO L440 ceAbstractionStarter]: At program point L752-1(lines 752 764) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:26,068 INFO L440 ceAbstractionStarter]: At program point L356(lines 356 409) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,068 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 562) no Hoare annotation was computed. [2019-11-24 04:32:26,068 INFO L444 ceAbstractionStarter]: For program point L556-2(lines 556 562) no Hoare annotation was computed. [2019-11-24 04:32:26,068 INFO L440 ceAbstractionStarter]: At program point L889(lines 889 984) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,068 INFO L444 ceAbstractionStarter]: For program point L493(lines 493 497) no Hoare annotation was computed. [2019-11-24 04:32:26,068 INFO L444 ceAbstractionStarter]: For program point L493-2(lines 493 497) no Hoare annotation was computed. [2019-11-24 04:32:26,068 INFO L440 ceAbstractionStarter]: At program point L427(lines 420 460) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,069 INFO L440 ceAbstractionStarter]: At program point L361(lines 361 408) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:26,069 INFO L444 ceAbstractionStarter]: For program point L493-4(lines 493 497) no Hoare annotation was computed. [2019-11-24 04:32:26,069 INFO L444 ceAbstractionStarter]: For program point L493-6(lines 493 497) no Hoare annotation was computed. [2019-11-24 04:32:26,069 INFO L444 ceAbstractionStarter]: For program point L493-8(lines 493 497) no Hoare annotation was computed. [2019-11-24 04:32:26,069 INFO L444 ceAbstractionStarter]: For program point L493-10(lines 493 497) no Hoare annotation was computed. [2019-11-24 04:32:26,069 INFO L444 ceAbstractionStarter]: For program point L493-12(lines 493 497) no Hoare annotation was computed. [2019-11-24 04:32:26,069 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 762) no Hoare annotation was computed. [2019-11-24 04:32:26,069 INFO L447 ceAbstractionStarter]: At program point L428(lines 412 461) the Hoare annotation is: true [2019-11-24 04:32:26,069 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 458) no Hoare annotation was computed. [2019-11-24 04:32:26,069 INFO L444 ceAbstractionStarter]: For program point L430(lines 430 457) no Hoare annotation was computed. [2019-11-24 04:32:26,070 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,070 INFO L444 ceAbstractionStarter]: For program point L431(lines 431 437) no Hoare annotation was computed. [2019-11-24 04:32:26,070 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-24 04:32:26,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 04:32:26 BoogieIcfgContainer [2019-11-24 04:32:26,113 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 04:32:26,117 INFO L168 Benchmark]: Toolchain (without parser) took 6243.51 ms. Allocated memory was 135.8 MB in the beginning and 305.7 MB in the end (delta: 169.9 MB). Free memory was 99.5 MB in the beginning and 160.3 MB in the end (delta: -60.8 MB). Peak memory consumption was 144.1 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:26,117 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory is still 118.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 04:32:26,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 549.78 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 99.5 MB in the beginning and 172.7 MB in the end (delta: -73.2 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:26,119 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.79 ms. Allocated memory is still 200.3 MB. Free memory was 172.7 MB in the beginning and 166.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:26,120 INFO L168 Benchmark]: Boogie Preprocessor took 110.21 ms. Allocated memory is still 200.3 MB. Free memory was 166.3 MB in the beginning and 161.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:26,121 INFO L168 Benchmark]: RCFGBuilder took 2274.40 ms. Allocated memory was 200.3 MB in the beginning and 254.8 MB in the end (delta: 54.5 MB). Free memory was 161.7 MB in the beginning and 199.4 MB in the end (delta: -37.7 MB). Peak memory consumption was 119.5 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:26,122 INFO L168 Benchmark]: TraceAbstraction took 3218.39 ms. Allocated memory was 254.8 MB in the beginning and 305.7 MB in the end (delta: 50.9 MB). Free memory was 199.4 MB in the beginning and 160.3 MB in the end (delta: 39.1 MB). Peak memory consumption was 125.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:26,126 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory is still 118.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 549.78 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 99.5 MB in the beginning and 172.7 MB in the end (delta: -73.2 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.79 ms. Allocated memory is still 200.3 MB. Free memory was 172.7 MB in the beginning and 166.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.21 ms. Allocated memory is still 200.3 MB. Free memory was 166.3 MB in the beginning and 161.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2274.40 ms. Allocated memory was 200.3 MB in the beginning and 254.8 MB in the end (delta: 54.5 MB). Free memory was 161.7 MB in the beginning and 199.4 MB in the end (delta: -37.7 MB). Peak memory consumption was 119.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3218.39 ms. Allocated memory was 254.8 MB in the beginning and 305.7 MB in the end (delta: 50.9 MB). Free memory was 199.4 MB in the beginning and 160.3 MB in the end (delta: 39.1 MB). Peak memory consumption was 125.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: (((((s == NP && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 889]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 == compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((((((!(1 == pended) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 == compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 751]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 873]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 293]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 820]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 865]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && !(MPR3 == s)) && NP + 4 <= MPR1 - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((s == NP || (returnVal2 <= 259 && 259 <= returnVal2)) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && (s == NP || MPR3 == s)) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 579]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) && s == NP) && 0 <= __cil_tmp7 + 1073741802) && !(MPR3 == s)) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: ((((((!(1 == pended) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 752]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 752]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 29 error locations. Result: SAFE, OverallTime: 3.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 1722 SDtfs, 972 SDslu, 757 SDs, 0 SdLazy, 445 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 60 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 71 PreInvPairs, 131 NumberOfFragments, 1326 HoareAnnotationTreeSize, 71 FomulaSimplifications, 169 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 71 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 7702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...