/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_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:32:16,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:32:16,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:32:16,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:32:16,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:32:16,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:32:16,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:32:16,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:32:16,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:32:16,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:32:16,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:32:16,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:32:16,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:32:16,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:32:16,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:32:16,252 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:32:16,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:32:16,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:32:16,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:32:16,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:32:16,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:32:16,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:32:16,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:32:16,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:32:16,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:32:16,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:32:16,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:32:16,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:32:16,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:32:16,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:32:16,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:32:16,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:32:16,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:32:16,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:32:16,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:32:16,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:32:16,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:32:16,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:32:16,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:32:16,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:32:16,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:32:16,285 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:16,313 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:32:16,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:32:16,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:32:16,314 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:32:16,314 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:32:16,314 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:32:16,315 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:32:16,315 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:32:16,315 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:32:16,315 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:32:16,315 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:32:16,316 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:32:16,316 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:32:16,316 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:32:16,316 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:32:16,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:32:16,317 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:32:16,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:32:16,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:32:16,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:32:16,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:32:16,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:32:16,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:32:16,319 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:32:16,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:32:16,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:32:16,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:32:16,320 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:32:16,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:32:16,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:32:16,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:32:16,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:32:16,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:32:16,321 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:32:16,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:32:16,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:32:16,321 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:32:16,322 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:32:16,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:32:16,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:32:16,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:32:16,632 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:32:16,632 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:32:16,633 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-11-24 04:32:16,693 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb387afc/650e406d82a340289f3ec48102b43ed1/FLAG6b71fa47b [2019-11-24 04:32:17,183 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:32:17,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-11-24 04:32:17,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb387afc/650e406d82a340289f3ec48102b43ed1/FLAG6b71fa47b [2019-11-24 04:32:17,519 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb387afc/650e406d82a340289f3ec48102b43ed1 [2019-11-24 04:32:17,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:32:17,529 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:32:17,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:32:17,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:32:17,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:32:17,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:32:17" (1/1) ... [2019-11-24 04:32:17,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545f21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:17, skipping insertion in model container [2019-11-24 04:32:17,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:32:17" (1/1) ... [2019-11-24 04:32:17,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:32:17,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:32:17,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:32:17,895 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:32:17,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:32:18,074 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:32:18,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:18 WrapperNode [2019-11-24 04:32:18,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:32:18,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:32:18,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:32:18,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:32:18,084 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:18" (1/1) ... [2019-11-24 04:32:18,093 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:18" (1/1) ... [2019-11-24 04:32:18,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:32:18,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:32:18,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:32:18,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:32:18,160 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:18" (1/1) ... [2019-11-24 04:32:18,160 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:18" (1/1) ... [2019-11-24 04:32:18,164 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:18" (1/1) ... [2019-11-24 04:32:18,164 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:18" (1/1) ... [2019-11-24 04:32:18,175 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:18" (1/1) ... [2019-11-24 04:32:18,183 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:18" (1/1) ... [2019-11-24 04:32:18,187 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:18" (1/1) ... [2019-11-24 04:32:18,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:32:18,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:32:18,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:32:18,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:32:18,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:18" (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:18,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:32:18,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:32:18,402 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:18,410 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:18,422 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:18,430 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:18,440 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:18,449 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:18,458 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:19,160 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##76: assume !false; [2019-11-24 04:32:19,160 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume false; [2019-11-24 04:32:19,160 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##184: assume false; [2019-11-24 04:32:19,161 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##185: assume !false; [2019-11-24 04:32:19,161 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !false; [2019-11-24 04:32:19,161 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume false; [2019-11-24 04:32:19,161 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: assume !false; [2019-11-24 04:32:19,161 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume false; [2019-11-24 04:32:19,162 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-11-24 04:32:19,162 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-11-24 04:32:19,162 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-11-24 04:32:19,162 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-11-24 04:32:19,162 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-11-24 04:32:19,163 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-11-24 04:32:19,739 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:32:19,739 INFO L284 CfgBuilder]: Removed 78 assume(true) statements. [2019-11-24 04:32:19,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:32:19 BoogieIcfgContainer [2019-11-24 04:32:19,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:32:19,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:32:19,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:32:19,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:32:19,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:32:17" (1/3) ... [2019-11-24 04:32:19,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212919fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:32:19, skipping insertion in model container [2019-11-24 04:32:19,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:18" (2/3) ... [2019-11-24 04:32:19,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212919fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:32:19, skipping insertion in model container [2019-11-24 04:32:19,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:32:19" (3/3) ... [2019-11-24 04:32:19,751 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2019-11-24 04:32:19,761 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:32:19,770 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-24 04:32:19,782 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-24 04:32:19,827 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:32:19,827 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:32:19,827 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:32:19,827 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:32:19,828 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:32:19,828 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:32:19,828 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:32:19,828 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:32:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-11-24 04:32:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 04:32:19,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:19,877 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:19,878 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:19,885 INFO L82 PathProgramCache]: Analyzing trace with hash 671809730, now seen corresponding path program 1 times [2019-11-24 04:32:19,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:19,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728133466] [2019-11-24 04:32:19,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,132 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:20,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728133466] [2019-11-24 04:32:20,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:20,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170237926] [2019-11-24 04:32:20,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:20,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:20,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:20,161 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 3 states. [2019-11-24 04:32:20,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:20,325 INFO L93 Difference]: Finished difference Result 182 states and 266 transitions. [2019-11-24 04:32:20,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:20,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-24 04:32:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:20,340 INFO L225 Difference]: With dead ends: 182 [2019-11-24 04:32:20,340 INFO L226 Difference]: Without dead ends: 91 [2019-11-24 04:32:20,344 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:20,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-24 04:32:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-11-24 04:32:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-24 04:32:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2019-11-24 04:32:20,404 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 7 [2019-11-24 04:32:20,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:20,405 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2019-11-24 04:32:20,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2019-11-24 04:32:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:32:20,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:20,406 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:20,410 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:20,410 INFO L82 PathProgramCache]: Analyzing trace with hash -648728712, now seen corresponding path program 1 times [2019-11-24 04:32:20,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:20,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613711236] [2019-11-24 04:32:20,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,495 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:20,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613711236] [2019-11-24 04:32:20,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:20,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795003767] [2019-11-24 04:32:20,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:20,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:20,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:20,504 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand 3 states. [2019-11-24 04:32:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:20,547 INFO L93 Difference]: Finished difference Result 156 states and 195 transitions. [2019-11-24 04:32:20,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:20,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-24 04:32:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:20,552 INFO L225 Difference]: With dead ends: 156 [2019-11-24 04:32:20,553 INFO L226 Difference]: Without dead ends: 110 [2019-11-24 04:32:20,556 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:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-24 04:32:20,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-11-24 04:32:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-24 04:32:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-11-24 04:32:20,576 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 8 [2019-11-24 04:32:20,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:20,578 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-11-24 04:32:20,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-11-24 04:32:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:32:20,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:20,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:20,580 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:20,581 INFO L82 PathProgramCache]: Analyzing trace with hash 207254872, now seen corresponding path program 1 times [2019-11-24 04:32:20,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:20,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419581112] [2019-11-24 04:32:20,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,609 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:20,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419581112] [2019-11-24 04:32:20,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:32:20,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466332585] [2019-11-24 04:32:20,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:20,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:20,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:20,614 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 3 states. [2019-11-24 04:32:20,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:20,646 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2019-11-24 04:32:20,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:20,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-24 04:32:20,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:20,648 INFO L225 Difference]: With dead ends: 93 [2019-11-24 04:32:20,648 INFO L226 Difference]: Without dead ends: 80 [2019-11-24 04:32:20,649 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:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-24 04:32:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-24 04:32:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-24 04:32:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2019-11-24 04:32:20,664 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 10 [2019-11-24 04:32:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:20,664 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2019-11-24 04:32:20,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2019-11-24 04:32:20,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:32:20,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:20,666 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:20,668 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:20,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:20,668 INFO L82 PathProgramCache]: Analyzing trace with hash 535982816, now seen corresponding path program 1 times [2019-11-24 04:32:20,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:20,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11373791] [2019-11-24 04:32:20,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,747 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:20,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11373791] [2019-11-24 04:32:20,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:20,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870445059] [2019-11-24 04:32:20,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:20,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:20,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:20,751 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 3 states. [2019-11-24 04:32:20,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:20,844 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2019-11-24 04:32:20,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:20,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-24 04:32:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:20,846 INFO L225 Difference]: With dead ends: 80 [2019-11-24 04:32:20,847 INFO L226 Difference]: Without dead ends: 74 [2019-11-24 04:32:20,847 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:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-24 04:32:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-24 04:32:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-24 04:32:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-11-24 04:32:20,864 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 14 [2019-11-24 04:32:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:20,866 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-11-24 04:32:20,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-11-24 04:32:20,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:32:20,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:20,869 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:20,870 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:20,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:20,871 INFO L82 PathProgramCache]: Analyzing trace with hash 559806363, now seen corresponding path program 1 times [2019-11-24 04:32:20,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:20,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125207960] [2019-11-24 04:32:20,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,964 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:20,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125207960] [2019-11-24 04:32:20,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:20,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518929088] [2019-11-24 04:32:20,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:20,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:20,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:20,966 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 3 states. [2019-11-24 04:32:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:21,029 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2019-11-24 04:32:21,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:21,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:32:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:21,031 INFO L225 Difference]: With dead ends: 104 [2019-11-24 04:32:21,031 INFO L226 Difference]: Without dead ends: 71 [2019-11-24 04:32:21,032 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:21,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-24 04:32:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-24 04:32:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-24 04:32:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2019-11-24 04:32:21,041 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 15 [2019-11-24 04:32:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:21,041 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2019-11-24 04:32:21,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2019-11-24 04:32:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:32:21,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:21,043 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:21,043 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:21,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:21,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1878512821, now seen corresponding path program 1 times [2019-11-24 04:32:21,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:21,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197072524] [2019-11-24 04:32:21,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:21,140 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:21,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197072524] [2019-11-24 04:32:21,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:21,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:32:21,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515719307] [2019-11-24 04:32:21,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:21,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:21,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:21,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:21,143 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 4 states. [2019-11-24 04:32:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:21,179 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2019-11-24 04:32:21,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:21,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 04:32:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:21,181 INFO L225 Difference]: With dead ends: 115 [2019-11-24 04:32:21,181 INFO L226 Difference]: Without dead ends: 83 [2019-11-24 04:32:21,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:21,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-24 04:32:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2019-11-24 04:32:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-24 04:32:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2019-11-24 04:32:21,200 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 16 [2019-11-24 04:32:21,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:21,201 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2019-11-24 04:32:21,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2019-11-24 04:32:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:32:21,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:21,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:21,202 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:21,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1480986174, now seen corresponding path program 1 times [2019-11-24 04:32:21,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:21,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119855940] [2019-11-24 04:32:21,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:21,281 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:21,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119855940] [2019-11-24 04:32:21,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:21,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:21,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083310081] [2019-11-24 04:32:21,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:21,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:21,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:21,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:21,283 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand 4 states. [2019-11-24 04:32:21,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:21,365 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2019-11-24 04:32:21,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:21,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-24 04:32:21,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:21,366 INFO L225 Difference]: With dead ends: 99 [2019-11-24 04:32:21,366 INFO L226 Difference]: Without dead ends: 69 [2019-11-24 04:32:21,367 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:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-24 04:32:21,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-24 04:32:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-24 04:32:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-11-24 04:32:21,383 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 17 [2019-11-24 04:32:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:21,384 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-11-24 04:32:21,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2019-11-24 04:32:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:32:21,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:21,387 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:21,387 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:21,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:21,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1607917556, now seen corresponding path program 1 times [2019-11-24 04:32:21,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:21,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828407484] [2019-11-24 04:32:21,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:21,463 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:21,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828407484] [2019-11-24 04:32:21,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:21,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:21,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466859042] [2019-11-24 04:32:21,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:21,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:21,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:21,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:21,466 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 5 states. [2019-11-24 04:32:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:21,616 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2019-11-24 04:32:21,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:21,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 04:32:21,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:21,618 INFO L225 Difference]: With dead ends: 90 [2019-11-24 04:32:21,618 INFO L226 Difference]: Without dead ends: 88 [2019-11-24 04:32:21,619 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:21,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-24 04:32:21,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2019-11-24 04:32:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-24 04:32:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-11-24 04:32:21,626 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 18 [2019-11-24 04:32:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:21,626 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-11-24 04:32:21,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2019-11-24 04:32:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:32:21,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:21,627 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:21,628 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:21,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1748577235, now seen corresponding path program 1 times [2019-11-24 04:32:21,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:21,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089066199] [2019-11-24 04:32:21,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:21,656 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:21,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089066199] [2019-11-24 04:32:21,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:21,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:21,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503941405] [2019-11-24 04:32:21,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:21,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:21,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:21,658 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 3 states. [2019-11-24 04:32:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:21,729 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2019-11-24 04:32:21,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:21,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:32:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:21,730 INFO L225 Difference]: With dead ends: 82 [2019-11-24 04:32:21,730 INFO L226 Difference]: Without dead ends: 80 [2019-11-24 04:32:21,730 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:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-24 04:32:21,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-11-24 04:32:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-24 04:32:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2019-11-24 04:32:21,748 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 19 [2019-11-24 04:32:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:21,748 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-11-24 04:32:21,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2019-11-24 04:32:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:32:21,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:21,749 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:21,754 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1621021588, now seen corresponding path program 1 times [2019-11-24 04:32:21,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:21,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078386276] [2019-11-24 04:32:21,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:21,789 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:21,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078386276] [2019-11-24 04:32:21,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:21,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:21,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34665031] [2019-11-24 04:32:21,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:21,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:21,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:21,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:21,791 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 3 states. [2019-11-24 04:32:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:21,805 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2019-11-24 04:32:21,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:21,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:32:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:21,806 INFO L225 Difference]: With dead ends: 110 [2019-11-24 04:32:21,806 INFO L226 Difference]: Without dead ends: 84 [2019-11-24 04:32:21,807 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:21,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-24 04:32:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2019-11-24 04:32:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-24 04:32:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-11-24 04:32:21,815 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 20 [2019-11-24 04:32:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:21,817 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-11-24 04:32:21,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-11-24 04:32:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:32:21,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:21,819 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:21,819 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:21,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:21,820 INFO L82 PathProgramCache]: Analyzing trace with hash -561666676, now seen corresponding path program 1 times [2019-11-24 04:32:21,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:21,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475952315] [2019-11-24 04:32:21,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:21,853 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:21,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475952315] [2019-11-24 04:32:21,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:21,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:32:21,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161102050] [2019-11-24 04:32:21,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:21,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:21,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:21,855 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 4 states. [2019-11-24 04:32:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:21,872 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2019-11-24 04:32:21,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:21,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-24 04:32:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:21,873 INFO L225 Difference]: With dead ends: 74 [2019-11-24 04:32:21,873 INFO L226 Difference]: Without dead ends: 23 [2019-11-24 04:32:21,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-24 04:32:21,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-24 04:32:21,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-24 04:32:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2019-11-24 04:32:21,877 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 21 [2019-11-24 04:32:21,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:21,878 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2019-11-24 04:32:21,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2019-11-24 04:32:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:32:21,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:21,878 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:21,879 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:21,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:21,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1813263430, now seen corresponding path program 1 times [2019-11-24 04:32:21,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:21,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028159544] [2019-11-24 04:32:21,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:21,927 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:21,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028159544] [2019-11-24 04:32:21,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:21,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:21,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247036884] [2019-11-24 04:32:21,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:21,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:21,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:21,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:21,930 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand 5 states. [2019-11-24 04:32:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:21,965 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2019-11-24 04:32:21,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:21,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-24 04:32:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:21,966 INFO L225 Difference]: With dead ends: 23 [2019-11-24 04:32:21,966 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 04:32:21,966 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:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 04:32:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 04:32:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 04:32:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 04:32:21,967 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-24 04:32:21,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:21,967 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 04:32:21,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 04:32:21,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 04:32:21,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 04:32:22,630 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,630 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,630 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 181) no Hoare annotation was computed. [2019-11-24 04:32:22,631 INFO L440 ceAbstractionStarter]: At program point L103(lines 103 281) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,631 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,631 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 372) no Hoare annotation was computed. [2019-11-24 04:32:22,631 INFO L440 ceAbstractionStarter]: At program point L534(lines 526 545) the Hoare annotation is: false [2019-11-24 04:32:22,632 INFO L440 ceAbstractionStarter]: At program point L469(lines 442 497) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-11-24 04:32:22,632 INFO L440 ceAbstractionStarter]: At program point L469-1(lines 442 497) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,633 INFO L440 ceAbstractionStarter]: At program point L469-2(lines 442 497) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,633 INFO L440 ceAbstractionStarter]: At program point L469-3(lines 442 497) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,633 INFO L440 ceAbstractionStarter]: At program point L106(lines 106 280) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,633 INFO L444 ceAbstractionStarter]: For program point L503(lines 503 509) no Hoare annotation was computed. [2019-11-24 04:32:22,633 INFO L444 ceAbstractionStarter]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2019-11-24 04:32:22,634 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 180) no Hoare annotation was computed. [2019-11-24 04:32:22,634 INFO L440 ceAbstractionStarter]: At program point L174-1(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:22,634 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,634 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,634 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 543) no Hoare annotation was computed. [2019-11-24 04:32:22,635 INFO L440 ceAbstractionStarter]: At program point L539-1(lines 539 543) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:22,635 INFO L440 ceAbstractionStarter]: At program point L374(lines 367 416) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:22,635 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,635 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,635 INFO L444 ceAbstractionStarter]: For program point L376(lines 376 380) no Hoare annotation was computed. [2019-11-24 04:32:22,635 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,636 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,636 INFO L440 ceAbstractionStarter]: At program point L443(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:22,636 INFO L440 ceAbstractionStarter]: At program point L443-1(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-11-24 04:32:22,636 INFO L440 ceAbstractionStarter]: At program point L443-2(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,636 INFO L440 ceAbstractionStarter]: At program point L443-3(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,636 INFO L440 ceAbstractionStarter]: At program point L443-4(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,637 INFO L440 ceAbstractionStarter]: At program point L443-5(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,637 INFO L440 ceAbstractionStarter]: At program point L443-6(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,637 INFO L440 ceAbstractionStarter]: At program point L443-7(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,637 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,637 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 494) no Hoare annotation was computed. [2019-11-24 04:32:22,637 INFO L444 ceAbstractionStarter]: For program point L477-1(lines 477 494) no Hoare annotation was computed. [2019-11-24 04:32:22,637 INFO L444 ceAbstractionStarter]: For program point L477-2(lines 477 494) no Hoare annotation was computed. [2019-11-24 04:32:22,637 INFO L444 ceAbstractionStarter]: For program point L477-3(lines 477 494) no Hoare annotation was computed. [2019-11-24 04:32:22,638 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 220) no Hoare annotation was computed. [2019-11-24 04:32:22,638 INFO L444 ceAbstractionStarter]: For program point L579(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,638 INFO L444 ceAbstractionStarter]: For program point L579-1(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,638 INFO L444 ceAbstractionStarter]: For program point L579-2(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,638 INFO L444 ceAbstractionStarter]: For program point L579-3(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,638 INFO L444 ceAbstractionStarter]: For program point L579-4(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,638 INFO L444 ceAbstractionStarter]: For program point L579-5(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,638 INFO L444 ceAbstractionStarter]: For program point L579-6(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,638 INFO L444 ceAbstractionStarter]: For program point L579-7(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,638 INFO L444 ceAbstractionStarter]: For program point L579-8(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,639 INFO L444 ceAbstractionStarter]: For program point L579-9(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,639 INFO L444 ceAbstractionStarter]: For program point L579-10(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,639 INFO L444 ceAbstractionStarter]: For program point L579-11(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,639 INFO L444 ceAbstractionStarter]: For program point L579-12(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,639 INFO L444 ceAbstractionStarter]: For program point L579-13(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,639 INFO L444 ceAbstractionStarter]: For program point L579-14(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,639 INFO L444 ceAbstractionStarter]: For program point L579-15(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,640 INFO L440 ceAbstractionStarter]: At program point L580-3(lines 1 582) the Hoare annotation is: (let ((.cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (or .cse0 (= ~NP~0 ~s~0)) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (or (= ~MPR3~0 ~s~0) (not .cse0)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1))) [2019-11-24 04:32:22,640 INFO L440 ceAbstractionStarter]: At program point L580-6(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,640 INFO L440 ceAbstractionStarter]: At program point L382(lines 375 415) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:22,640 INFO L440 ceAbstractionStarter]: At program point L580-8(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:22,641 INFO L440 ceAbstractionStarter]: At program point L580-9(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,641 INFO L440 ceAbstractionStarter]: At program point L580-11(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:22,641 INFO L440 ceAbstractionStarter]: At program point L580-12(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,641 INFO L440 ceAbstractionStarter]: At program point L580-14(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:22,641 INFO L447 ceAbstractionStarter]: At program point L383(lines 367 416) the Hoare annotation is: true [2019-11-24 04:32:22,641 INFO L440 ceAbstractionStarter]: At program point L350(lines 350 365) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,642 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 04:32:22,642 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 413) no Hoare annotation was computed. [2019-11-24 04:32:22,642 INFO L447 ceAbstractionStarter]: At program point L418(lines 286 420) the Hoare annotation is: true [2019-11-24 04:32:22,642 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,642 INFO L444 ceAbstractionStarter]: For program point L385(lines 385 412) no Hoare annotation was computed. [2019-11-24 04:32:22,642 INFO L444 ceAbstractionStarter]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-11-24 04:32:22,642 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 493) no Hoare annotation was computed. [2019-11-24 04:32:22,643 INFO L444 ceAbstractionStarter]: For program point L486-2(lines 486 493) no Hoare annotation was computed. [2019-11-24 04:32:22,643 INFO L444 ceAbstractionStarter]: For program point L387(lines 387 389) no Hoare annotation was computed. [2019-11-24 04:32:22,643 INFO L444 ceAbstractionStarter]: For program point L486-4(lines 486 493) no Hoare annotation was computed. [2019-11-24 04:32:22,643 INFO L440 ceAbstractionStarter]: At program point L321(lines 295 419) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:22,643 INFO L444 ceAbstractionStarter]: For program point L486-6(lines 486 493) no Hoare annotation was computed. [2019-11-24 04:32:22,643 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,643 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 04:32:22,644 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,644 INFO L444 ceAbstractionStarter]: For program point L190(lines 190 196) no Hoare annotation was computed. [2019-11-24 04:32:22,644 INFO L444 ceAbstractionStarter]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2019-11-24 04:32:22,644 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,644 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 431) no Hoare annotation was computed. [2019-11-24 04:32:22,644 INFO L444 ceAbstractionStarter]: For program point L425-2(lines 425 431) no Hoare annotation was computed. [2019-11-24 04:32:22,644 INFO L444 ceAbstractionStarter]: For program point L425-4(lines 425 431) no Hoare annotation was computed. [2019-11-24 04:32:22,645 INFO L440 ceAbstractionStarter]: At program point L260(lines 164 261) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:22,645 INFO L444 ceAbstractionStarter]: For program point L425-6(lines 425 431) no Hoare annotation was computed. [2019-11-24 04:32:22,645 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 545) no Hoare annotation was computed. [2019-11-24 04:32:22,645 INFO L440 ceAbstractionStarter]: At program point L394(lines 385 412) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-24 04:32:22,645 INFO L440 ceAbstractionStarter]: At program point L163(lines 109 279) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,645 INFO L444 ceAbstractionStarter]: For program point L527(lines 527 532) no Hoare annotation was computed. [2019-11-24 04:32:22,645 INFO L444 ceAbstractionStarter]: For program point L230(lines 230 236) no Hoare annotation was computed. [2019-11-24 04:32:22,645 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,646 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 400) no Hoare annotation was computed. [2019-11-24 04:32:22,646 INFO L440 ceAbstractionStarter]: At program point L100(lines 100 282) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (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:22,646 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-24 04:32:22,646 INFO L440 ceAbstractionStarter]: At program point L68(lines 321 366) 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:22,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 04:32:22 BoogieIcfgContainer [2019-11-24 04:32:22,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 04:32:22,678 INFO L168 Benchmark]: Toolchain (without parser) took 5148.24 ms. Allocated memory was 137.4 MB in the beginning and 251.1 MB in the end (delta: 113.8 MB). Free memory was 101.7 MB in the beginning and 134.9 MB in the end (delta: -33.3 MB). Peak memory consumption was 130.4 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:22,679 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 04:32:22,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.30 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 179.6 MB in the end (delta: -78.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:22,681 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.59 ms. Allocated memory is still 201.9 MB. Free memory was 179.6 MB in the beginning and 175.5 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:22,681 INFO L168 Benchmark]: Boogie Preprocessor took 48.90 ms. Allocated memory is still 201.9 MB. Free memory was 175.5 MB in the beginning and 172.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:22,682 INFO L168 Benchmark]: RCFGBuilder took 1546.81 ms. Allocated memory was 201.9 MB in the beginning and 232.8 MB in the end (delta: 30.9 MB). Free memory was 172.3 MB in the beginning and 162.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 92.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:22,683 INFO L168 Benchmark]: TraceAbstraction took 2932.76 ms. Allocated memory was 232.8 MB in the beginning and 251.1 MB in the end (delta: 18.4 MB). Free memory was 162.0 MB in the beginning and 134.9 MB in the end (delta: 27.1 MB). Peak memory consumption was 95.3 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:22,688 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.21 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 544.30 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 179.6 MB in the end (delta: -78.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.59 ms. Allocated memory is still 201.9 MB. Free memory was 179.6 MB in the beginning and 175.5 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.90 ms. Allocated memory is still 201.9 MB. Free memory was 175.5 MB in the beginning and 172.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1546.81 ms. Allocated memory was 201.9 MB in the beginning and 232.8 MB in the end (delta: 30.9 MB). Free memory was 172.3 MB in the beginning and 162.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 92.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2932.76 ms. Allocated memory was 232.8 MB in the beginning and 251.1 MB in the end (delta: 18.4 MB). Free memory was 162.0 MB in the beginning and 134.9 MB in the end (delta: 27.1 MB). Peak memory consumption was 95.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && NP + 4 <= MPR1 - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && MPR1 == s) && !(0 == compRegistered)) && status == 0) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && NP + 4 <= MPR1 - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 539]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && s == NP) && !(1 == pended)) && !(0 == compRegistered)) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && (259 == returnVal2 || NP == s)) && !(0 == compRegistered)) && status == 0) && (MPR3 == s || !(259 == returnVal2))) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && !(0 == compRegistered)) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && !(0 == compRegistered)) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && MPR1 == s) && !(0 == compRegistered)) && status == 0) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && !(MPR3 == s)) && NP + 4 <= MPR1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && status == 0) && NP + 4 <= MPR1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 99 locations, 16 error locations. Result: SAFE, OverallTime: 2.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 949 SDtfs, 634 SDslu, 438 SDs, 0 SdLazy, 416 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred 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, 12 MinimizatonAttempts, 89 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 35 PreInvPairs, 65 NumberOfFragments, 805 HoareAnnotationTreeSize, 35 FomulaSimplifications, 886 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 35 FomulaSimplificationsInter, 79 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 6207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...