/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/loop-invgen/apache-get-tag.i.p+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:18:56,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:18:56,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:18:56,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:18:56,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:18:56,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:18:56,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:18:56,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:18:56,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:18:56,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:18:56,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:18:56,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:18:56,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:18:56,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:18:56,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:18:56,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:18:56,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:18:56,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:18:56,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:18:56,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:18:56,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:18:56,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:18:56,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:18:56,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:18:56,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:18:56,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:18:56,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:18:56,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:18:56,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:18:56,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:18:56,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:18:56,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:18:56,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:18:56,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:18:56,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:18:56,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:18:56,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:18:56,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:18:56,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:18:56,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:18:56,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:18:56,706 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:18:56,721 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:18:56,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:18:56,722 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:18:56,722 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:18:56,722 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:18:56,722 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:18:56,723 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:18:56,723 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:18:56,723 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:18:56,723 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:18:56,723 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:18:56,723 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:18:56,724 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:18:56,724 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:18:56,724 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:18:56,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:18:56,725 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:18:56,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:18:56,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:18:56,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:18:56,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:18:56,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:18:56,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:18:56,726 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:18:56,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:18:56,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:18:56,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:18:56,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:18:56,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:18:56,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:18:56,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:18:56,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:18:56,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:18:56,728 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:18:56,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:18:56,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:18:56,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:18:56,729 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:18:56,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:18:57,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:18:57,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:18:57,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:18:57,017 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:18:57,018 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-11-24 04:18:57,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e64e070/235dd33693474993aae9ff88a9f2fefb/FLAGe23e6c1b0 [2019-11-24 04:18:57,703 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:18:57,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-11-24 04:18:57,723 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e64e070/235dd33693474993aae9ff88a9f2fefb/FLAGe23e6c1b0 [2019-11-24 04:18:57,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e64e070/235dd33693474993aae9ff88a9f2fefb [2019-11-24 04:18:57,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:18:57,906 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:18:57,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:18:57,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:18:57,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:18:57,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:18:57" (1/1) ... [2019-11-24 04:18:57,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6650a629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:57, skipping insertion in model container [2019-11-24 04:18:57,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:18:57" (1/1) ... [2019-11-24 04:18:57,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:18:58,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:18:59,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:18:59,014 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:18:59,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:18:59,334 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:18:59,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:59 WrapperNode [2019-11-24 04:18:59,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:18:59,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:18:59,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:18:59,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:18:59,349 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:18:59" (1/1) ... [2019-11-24 04:18:59,381 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:18:59" (1/1) ... [2019-11-24 04:18:59,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:18:59,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:18:59,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:18:59,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:18:59,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:59" (1/1) ... [2019-11-24 04:18:59,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:59" (1/1) ... [2019-11-24 04:18:59,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:59" (1/1) ... [2019-11-24 04:18:59,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:59" (1/1) ... [2019-11-24 04:18:59,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:59" (1/1) ... [2019-11-24 04:18:59,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:59" (1/1) ... [2019-11-24 04:18:59,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:59" (1/1) ... [2019-11-24 04:18:59,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:18:59,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:18:59,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:18:59,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:18:59,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:59" (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:18:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:18:59,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:19:02,263 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:19:02,263 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 04:19:02,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:19:02 BoogieIcfgContainer [2019-11-24 04:19:02,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:19:02,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:19:02,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:19:02,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:19:02,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:18:57" (1/3) ... [2019-11-24 04:19:02,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354f788f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:19:02, skipping insertion in model container [2019-11-24 04:19:02,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:59" (2/3) ... [2019-11-24 04:19:02,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354f788f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:19:02, skipping insertion in model container [2019-11-24 04:19:02,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:19:02" (3/3) ... [2019-11-24 04:19:02,276 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2019-11-24 04:19:02,287 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:19:02,297 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-24 04:19:02,308 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-24 04:19:02,355 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:19:02,355 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:19:02,356 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:19:02,356 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:19:02,356 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:19:02,356 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:19:02,356 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:19:02,356 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:19:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states. [2019-11-24 04:19:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 04:19:02,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:02,406 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 04:19:02,407 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:19:02,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:02,414 INFO L82 PathProgramCache]: Analyzing trace with hash -662524203, now seen corresponding path program 1 times [2019-11-24 04:19:02,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:02,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840174849] [2019-11-24 04:19:02,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:02,611 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:19:02,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840174849] [2019-11-24 04:19:02,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:02,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:02,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934552694] [2019-11-24 04:19:02,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:02,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:02,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:02,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:02,639 INFO L87 Difference]: Start difference. First operand 473 states. Second operand 4 states. [2019-11-24 04:19:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:04,219 INFO L93 Difference]: Finished difference Result 481 states and 904 transitions. [2019-11-24 04:19:04,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:19:04,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-24 04:19:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:04,241 INFO L225 Difference]: With dead ends: 481 [2019-11-24 04:19:04,241 INFO L226 Difference]: Without dead ends: 296 [2019-11-24 04:19:04,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:19:04,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-24 04:19:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-11-24 04:19:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-24 04:19:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2019-11-24 04:19:04,307 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 6 [2019-11-24 04:19:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:04,307 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2019-11-24 04:19:04,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2019-11-24 04:19:04,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 04:19:04,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:04,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:04,309 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:19:04,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:04,309 INFO L82 PathProgramCache]: Analyzing trace with hash 936590238, now seen corresponding path program 1 times [2019-11-24 04:19:04,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:04,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982357039] [2019-11-24 04:19:04,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:04,349 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:19:04,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982357039] [2019-11-24 04:19:04,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:04,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:04,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452559609] [2019-11-24 04:19:04,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:04,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:04,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:04,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:04,353 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand 4 states. [2019-11-24 04:19:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:04,864 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2019-11-24 04:19:04,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:19:04,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-24 04:19:04,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:04,905 INFO L225 Difference]: With dead ends: 296 [2019-11-24 04:19:04,905 INFO L226 Difference]: Without dead ends: 291 [2019-11-24 04:19:04,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:19:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-24 04:19:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2019-11-24 04:19:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-24 04:19:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 294 transitions. [2019-11-24 04:19:04,923 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 294 transitions. Word has length 7 [2019-11-24 04:19:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:04,924 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 294 transitions. [2019-11-24 04:19:04,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 294 transitions. [2019-11-24 04:19:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-24 04:19:04,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:04,933 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:04,934 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:19:04,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:04,934 INFO L82 PathProgramCache]: Analyzing trace with hash -203403239, now seen corresponding path program 1 times [2019-11-24 04:19:04,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:04,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279488685] [2019-11-24 04:19:04,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:08,291 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:19:08,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279488685] [2019-11-24 04:19:08,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:08,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2019-11-24 04:19:08,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718932836] [2019-11-24 04:19:08,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-11-24 04:19:08,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:08,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-11-24 04:19:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-11-24 04:19:08,297 INFO L87 Difference]: Start difference. First operand 291 states and 294 transitions. Second operand 64 states. [2019-11-24 04:19:09,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:09,799 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-11-24 04:19:09,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-11-24 04:19:09,799 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 243 [2019-11-24 04:19:09,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:09,803 INFO L225 Difference]: With dead ends: 292 [2019-11-24 04:19:09,803 INFO L226 Difference]: Without dead ends: 290 [2019-11-24 04:19:09,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2019-11-24 04:19:09,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-11-24 04:19:09,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-11-24 04:19:09,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-24 04:19:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 292 transitions. [2019-11-24 04:19:09,819 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 292 transitions. Word has length 243 [2019-11-24 04:19:09,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:09,821 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 292 transitions. [2019-11-24 04:19:09,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-11-24 04:19:09,821 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 292 transitions. [2019-11-24 04:19:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-24 04:19:09,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:09,826 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:09,826 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:19:09,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:09,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2010527020, now seen corresponding path program 1 times [2019-11-24 04:19:09,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:09,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019429686] [2019-11-24 04:19:09,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:10,660 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:19:10,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019429686] [2019-11-24 04:19:10,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:10,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:10,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352358751] [2019-11-24 04:19:10,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:10,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:10,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:10,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:10,664 INFO L87 Difference]: Start difference. First operand 289 states and 292 transitions. Second operand 6 states. [2019-11-24 04:19:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:11,281 INFO L93 Difference]: Finished difference Result 291 states and 294 transitions. [2019-11-24 04:19:11,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:11,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 244 [2019-11-24 04:19:11,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:11,284 INFO L225 Difference]: With dead ends: 291 [2019-11-24 04:19:11,284 INFO L226 Difference]: Without dead ends: 289 [2019-11-24 04:19:11,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:19:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-24 04:19:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2019-11-24 04:19:11,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-24 04:19:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 290 transitions. [2019-11-24 04:19:11,298 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 290 transitions. Word has length 244 [2019-11-24 04:19:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:11,299 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 290 transitions. [2019-11-24 04:19:11,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 290 transitions. [2019-11-24 04:19:11,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-24 04:19:11,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:11,309 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:11,310 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:19:11,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:11,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2009449187, now seen corresponding path program 1 times [2019-11-24 04:19:11,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:11,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244600716] [2019-11-24 04:19:11,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:14,244 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:19:14,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244600716] [2019-11-24 04:19:14,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:14,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-11-24 04:19:14,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356528452] [2019-11-24 04:19:14,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-11-24 04:19:14,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:14,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-11-24 04:19:14,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2019-11-24 04:19:14,248 INFO L87 Difference]: Start difference. First operand 287 states and 290 transitions. Second operand 63 states. [2019-11-24 04:19:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:15,980 INFO L93 Difference]: Finished difference Result 287 states and 290 transitions. [2019-11-24 04:19:15,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-11-24 04:19:15,982 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 247 [2019-11-24 04:19:15,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:15,986 INFO L225 Difference]: With dead ends: 287 [2019-11-24 04:19:15,986 INFO L226 Difference]: Without dead ends: 285 [2019-11-24 04:19:15,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2019-11-24 04:19:15,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-24 04:19:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2019-11-24 04:19:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-24 04:19:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 288 transitions. [2019-11-24 04:19:15,995 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 288 transitions. Word has length 247 [2019-11-24 04:19:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:15,997 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 288 transitions. [2019-11-24 04:19:15,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-11-24 04:19:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 288 transitions. [2019-11-24 04:19:16,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-24 04:19:16,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:16,004 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:16,004 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:19:16,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:16,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2131578528, now seen corresponding path program 1 times [2019-11-24 04:19:16,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:16,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369092187] [2019-11-24 04:19:16,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:16,690 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:19:16,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369092187] [2019-11-24 04:19:16,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:16,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:16,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319584333] [2019-11-24 04:19:16,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:16,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:16,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:16,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:16,695 INFO L87 Difference]: Start difference. First operand 285 states and 288 transitions. Second operand 6 states. [2019-11-24 04:19:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:17,354 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2019-11-24 04:19:17,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:17,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-11-24 04:19:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:17,358 INFO L225 Difference]: With dead ends: 285 [2019-11-24 04:19:17,358 INFO L226 Difference]: Without dead ends: 283 [2019-11-24 04:19:17,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:19:17,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-24 04:19:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2019-11-24 04:19:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-24 04:19:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 286 transitions. [2019-11-24 04:19:17,365 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 286 transitions. Word has length 248 [2019-11-24 04:19:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:17,366 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 286 transitions. [2019-11-24 04:19:17,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 286 transitions. [2019-11-24 04:19:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-24 04:19:17,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:17,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:17,370 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:19:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:17,370 INFO L82 PathProgramCache]: Analyzing trace with hash 252627716, now seen corresponding path program 1 times [2019-11-24 04:19:17,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:17,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011014116] [2019-11-24 04:19:17,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:20,264 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:19:20,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011014116] [2019-11-24 04:19:20,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:20,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-11-24 04:19:20,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544794213] [2019-11-24 04:19:20,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-24 04:19:20,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:20,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-24 04:19:20,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2019-11-24 04:19:20,269 INFO L87 Difference]: Start difference. First operand 283 states and 286 transitions. Second operand 65 states. [2019-11-24 04:19:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:22,159 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-11-24 04:19:22,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-11-24 04:19:22,159 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 250 [2019-11-24 04:19:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:22,163 INFO L225 Difference]: With dead ends: 286 [2019-11-24 04:19:22,163 INFO L226 Difference]: Without dead ends: 284 [2019-11-24 04:19:22,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2019-11-24 04:19:22,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-24 04:19:22,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-11-24 04:19:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-24 04:19:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 284 transitions. [2019-11-24 04:19:22,172 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 284 transitions. Word has length 250 [2019-11-24 04:19:22,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:22,173 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 284 transitions. [2019-11-24 04:19:22,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-24 04:19:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 284 transitions. [2019-11-24 04:19:22,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-24 04:19:22,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:22,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:22,177 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:19:22,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:22,177 INFO L82 PathProgramCache]: Analyzing trace with hash -758469263, now seen corresponding path program 1 times [2019-11-24 04:19:22,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:22,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881198980] [2019-11-24 04:19:22,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:22,362 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:19:22,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881198980] [2019-11-24 04:19:22,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:22,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:22,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498083970] [2019-11-24 04:19:22,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:22,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:22,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:22,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:22,365 INFO L87 Difference]: Start difference. First operand 281 states and 284 transitions. Second operand 4 states. [2019-11-24 04:19:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:22,744 INFO L93 Difference]: Finished difference Result 281 states and 284 transitions. [2019-11-24 04:19:22,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:19:22,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-11-24 04:19:22,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:22,747 INFO L225 Difference]: With dead ends: 281 [2019-11-24 04:19:22,748 INFO L226 Difference]: Without dead ends: 277 [2019-11-24 04:19:22,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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:19:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-24 04:19:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2019-11-24 04:19:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-24 04:19:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 280 transitions. [2019-11-24 04:19:22,756 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 280 transitions. Word has length 251 [2019-11-24 04:19:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:22,756 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 280 transitions. [2019-11-24 04:19:22,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 280 transitions. [2019-11-24 04:19:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-24 04:19:22,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:22,758 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:22,759 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:19:22,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:22,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2020838857, now seen corresponding path program 1 times [2019-11-24 04:19:22,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:22,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308460910] [2019-11-24 04:19:22,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:25,799 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:19:25,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308460910] [2019-11-24 04:19:25,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:25,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-11-24 04:19:25,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477965282] [2019-11-24 04:19:25,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-24 04:19:25,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:25,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-24 04:19:25,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2019-11-24 04:19:25,803 INFO L87 Difference]: Start difference. First operand 277 states and 280 transitions. Second operand 65 states. [2019-11-24 04:19:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:27,617 INFO L93 Difference]: Finished difference Result 287 states and 291 transitions. [2019-11-24 04:19:27,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-11-24 04:19:27,618 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-11-24 04:19:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:27,621 INFO L225 Difference]: With dead ends: 287 [2019-11-24 04:19:27,621 INFO L226 Difference]: Without dead ends: 285 [2019-11-24 04:19:27,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2019-11-24 04:19:27,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-24 04:19:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 275. [2019-11-24 04:19:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-24 04:19:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 278 transitions. [2019-11-24 04:19:27,630 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 278 transitions. Word has length 252 [2019-11-24 04:19:27,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:27,630 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 278 transitions. [2019-11-24 04:19:27,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-24 04:19:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 278 transitions. [2019-11-24 04:19:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-24 04:19:27,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:27,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:27,634 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:19:27,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:27,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2022562761, now seen corresponding path program 1 times [2019-11-24 04:19:27,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:27,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101819939] [2019-11-24 04:19:27,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:30,423 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:19:30,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101819939] [2019-11-24 04:19:30,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:30,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-11-24 04:19:30,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876446398] [2019-11-24 04:19:30,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-11-24 04:19:30,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:30,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-11-24 04:19:30,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-11-24 04:19:30,427 INFO L87 Difference]: Start difference. First operand 275 states and 278 transitions. Second operand 66 states. [2019-11-24 04:19:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:32,374 INFO L93 Difference]: Finished difference Result 300 states and 306 transitions. [2019-11-24 04:19:32,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-11-24 04:19:32,377 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 252 [2019-11-24 04:19:32,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:32,380 INFO L225 Difference]: With dead ends: 300 [2019-11-24 04:19:32,380 INFO L226 Difference]: Without dead ends: 298 [2019-11-24 04:19:32,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2019-11-24 04:19:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-24 04:19:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 273. [2019-11-24 04:19:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-24 04:19:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 276 transitions. [2019-11-24 04:19:32,396 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 276 transitions. Word has length 252 [2019-11-24 04:19:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:32,396 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 276 transitions. [2019-11-24 04:19:32,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-11-24 04:19:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 276 transitions. [2019-11-24 04:19:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-11-24 04:19:32,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:32,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:32,399 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:19:32,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:32,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1778511084, now seen corresponding path program 1 times [2019-11-24 04:19:32,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:32,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671275637] [2019-11-24 04:19:32,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:32,851 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:19:32,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671275637] [2019-11-24 04:19:32,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:32,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:32,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211782885] [2019-11-24 04:19:32,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:32,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:32,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:32,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:32,853 INFO L87 Difference]: Start difference. First operand 273 states and 276 transitions. Second operand 6 states. [2019-11-24 04:19:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:33,486 INFO L93 Difference]: Finished difference Result 273 states and 276 transitions. [2019-11-24 04:19:33,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:33,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-11-24 04:19:33,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:33,491 INFO L225 Difference]: With dead ends: 273 [2019-11-24 04:19:33,491 INFO L226 Difference]: Without dead ends: 269 [2019-11-24 04:19:33,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-24 04:19:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-11-24 04:19:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-24 04:19:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 272 transitions. [2019-11-24 04:19:33,498 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 272 transitions. Word has length 253 [2019-11-24 04:19:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:33,498 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 272 transitions. [2019-11-24 04:19:33,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 272 transitions. [2019-11-24 04:19:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-11-24 04:19:33,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:33,500 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:33,500 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:19:33,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1778961922, now seen corresponding path program 1 times [2019-11-24 04:19:33,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:33,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666501221] [2019-11-24 04:19:33,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:36,228 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:19:36,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666501221] [2019-11-24 04:19:36,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:36,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-11-24 04:19:36,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148485988] [2019-11-24 04:19:36,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-24 04:19:36,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:36,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-24 04:19:36,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2019-11-24 04:19:36,232 INFO L87 Difference]: Start difference. First operand 269 states and 272 transitions. Second operand 65 states. [2019-11-24 04:19:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:37,764 INFO L93 Difference]: Finished difference Result 295 states and 301 transitions. [2019-11-24 04:19:37,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-11-24 04:19:37,764 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 253 [2019-11-24 04:19:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:37,767 INFO L225 Difference]: With dead ends: 295 [2019-11-24 04:19:37,767 INFO L226 Difference]: Without dead ends: 293 [2019-11-24 04:19:37,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2019-11-24 04:19:37,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-24 04:19:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 267. [2019-11-24 04:19:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-24 04:19:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 270 transitions. [2019-11-24 04:19:37,777 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 270 transitions. Word has length 253 [2019-11-24 04:19:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:37,777 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 270 transitions. [2019-11-24 04:19:37,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-24 04:19:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 270 transitions. [2019-11-24 04:19:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-11-24 04:19:37,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:37,779 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:37,779 INFO L410 AbstractCegarLoop]: === Iteration 13 === [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:19:37,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:37,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1725070004, now seen corresponding path program 1 times [2019-11-24 04:19:37,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:37,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604992995] [2019-11-24 04:19:37,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:38,253 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:19:38,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604992995] [2019-11-24 04:19:38,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:38,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:38,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853721745] [2019-11-24 04:19:38,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:38,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:38,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:38,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:38,255 INFO L87 Difference]: Start difference. First operand 267 states and 270 transitions. Second operand 6 states. [2019-11-24 04:19:38,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:38,829 INFO L93 Difference]: Finished difference Result 277 states and 282 transitions. [2019-11-24 04:19:38,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:38,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-11-24 04:19:38,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:38,831 INFO L225 Difference]: With dead ends: 277 [2019-11-24 04:19:38,832 INFO L226 Difference]: Without dead ends: 275 [2019-11-24 04:19:38,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:19:38,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-24 04:19:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 265. [2019-11-24 04:19:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-11-24 04:19:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 268 transitions. [2019-11-24 04:19:38,841 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 268 transitions. Word has length 253 [2019-11-24 04:19:38,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:38,841 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 268 transitions. [2019-11-24 04:19:38,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 268 transitions. [2019-11-24 04:19:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-24 04:19:38,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:38,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:38,844 INFO L410 AbstractCegarLoop]: === Iteration 14 === [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:19:38,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:38,846 INFO L82 PathProgramCache]: Analyzing trace with hash -686749074, now seen corresponding path program 1 times [2019-11-24 04:19:38,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:38,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939783261] [2019-11-24 04:19:38,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:39,274 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:19:39,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939783261] [2019-11-24 04:19:39,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:39,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:39,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891079618] [2019-11-24 04:19:39,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:39,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:39,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:39,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:39,277 INFO L87 Difference]: Start difference. First operand 265 states and 268 transitions. Second operand 6 states. [2019-11-24 04:19:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:39,929 INFO L93 Difference]: Finished difference Result 280 states and 285 transitions. [2019-11-24 04:19:39,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:39,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 254 [2019-11-24 04:19:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:39,933 INFO L225 Difference]: With dead ends: 280 [2019-11-24 04:19:39,933 INFO L226 Difference]: Without dead ends: 278 [2019-11-24 04:19:39,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:19:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-24 04:19:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 263. [2019-11-24 04:19:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-24 04:19:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 266 transitions. [2019-11-24 04:19:39,940 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 266 transitions. Word has length 254 [2019-11-24 04:19:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:39,940 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 266 transitions. [2019-11-24 04:19:39,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 266 transitions. [2019-11-24 04:19:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-24 04:19:39,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:39,942 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:39,942 INFO L410 AbstractCegarLoop]: === Iteration 15 === [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:19:39,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:39,943 INFO L82 PathProgramCache]: Analyzing trace with hash -64909193, now seen corresponding path program 1 times [2019-11-24 04:19:39,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:39,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474178114] [2019-11-24 04:19:39,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:42,684 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:19:42,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474178114] [2019-11-24 04:19:42,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:42,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2019-11-24 04:19:42,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911291584] [2019-11-24 04:19:42,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-11-24 04:19:42,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:42,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-11-24 04:19:42,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-11-24 04:19:42,687 INFO L87 Difference]: Start difference. First operand 263 states and 266 transitions. Second operand 67 states. [2019-11-24 04:19:44,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:44,116 INFO L93 Difference]: Finished difference Result 289 states and 296 transitions. [2019-11-24 04:19:44,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-11-24 04:19:44,117 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 255 [2019-11-24 04:19:44,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:44,119 INFO L225 Difference]: With dead ends: 289 [2019-11-24 04:19:44,119 INFO L226 Difference]: Without dead ends: 287 [2019-11-24 04:19:44,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2019-11-24 04:19:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-24 04:19:44,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 261. [2019-11-24 04:19:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-24 04:19:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 264 transitions. [2019-11-24 04:19:44,129 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 264 transitions. Word has length 255 [2019-11-24 04:19:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:44,129 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 264 transitions. [2019-11-24 04:19:44,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-11-24 04:19:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 264 transitions. [2019-11-24 04:19:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-11-24 04:19:44,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:44,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:44,133 INFO L410 AbstractCegarLoop]: === Iteration 16 === [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:19:44,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:44,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2012178811, now seen corresponding path program 1 times [2019-11-24 04:19:44,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:44,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769301326] [2019-11-24 04:19:44,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:44,277 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:19:44,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769301326] [2019-11-24 04:19:44,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:44,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:44,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742533392] [2019-11-24 04:19:44,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:44,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:44,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:44,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:44,281 INFO L87 Difference]: Start difference. First operand 261 states and 264 transitions. Second operand 4 states. [2019-11-24 04:19:44,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:44,694 INFO L93 Difference]: Finished difference Result 261 states and 264 transitions. [2019-11-24 04:19:44,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:19:44,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-11-24 04:19:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:44,695 INFO L225 Difference]: With dead ends: 261 [2019-11-24 04:19:44,695 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 04:19:44,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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:19:44,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 04:19:44,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 04:19:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 04:19:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 04:19:44,699 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 256 [2019-11-24 04:19:44,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:44,699 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 04:19:44,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 04:19:44,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 04:19:44,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 04:19:45,021 INFO L444 ceAbstractionStarter]: For program point L4065(lines 4065 4983) no Hoare annotation was computed. [2019-11-24 04:19:45,021 INFO L444 ceAbstractionStarter]: For program point L3801(lines 3801 5006) no Hoare annotation was computed. [2019-11-24 04:19:45,021 INFO L444 ceAbstractionStarter]: For program point L3537(lines 3537 5029) no Hoare annotation was computed. [2019-11-24 04:19:45,022 INFO L444 ceAbstractionStarter]: For program point L4462(lines 4462 4949) no Hoare annotation was computed. [2019-11-24 04:19:45,022 INFO L444 ceAbstractionStarter]: For program point L4859(lines 4859 4869) no Hoare annotation was computed. [2019-11-24 04:19:45,022 INFO L444 ceAbstractionStarter]: For program point L1028(lines 1028 1052) no Hoare annotation was computed. [2019-11-24 04:19:45,022 INFO L444 ceAbstractionStarter]: For program point L1821(lines 1821 5181) no Hoare annotation was computed. [2019-11-24 04:19:45,022 INFO L444 ceAbstractionStarter]: For program point L1557(lines 1557 5204) no Hoare annotation was computed. [2019-11-24 04:19:45,022 INFO L444 ceAbstractionStarter]: For program point L1293(lines 1293 5227) no Hoare annotation was computed. [2019-11-24 04:19:45,022 INFO L444 ceAbstractionStarter]: For program point L2218(lines 2218 5147) no Hoare annotation was computed. [2019-11-24 04:19:45,023 INFO L444 ceAbstractionStarter]: For program point L3011(lines 3011 3022) no Hoare annotation was computed. [2019-11-24 04:19:45,023 INFO L444 ceAbstractionStarter]: For program point L4861(line 4861) no Hoare annotation was computed. [2019-11-24 04:19:45,023 INFO L440 ceAbstractionStarter]: At program point L501(lines 355 549) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-11-24 04:19:45,023 INFO L444 ceAbstractionStarter]: For program point L3408(lines 3408 3432) no Hoare annotation was computed. [2019-11-24 04:19:45,023 INFO L444 ceAbstractionStarter]: For program point L4201(lines 4201 4971) no Hoare annotation was computed. [2019-11-24 04:19:45,023 INFO L444 ceAbstractionStarter]: For program point L3937(lines 3937 4994) no Hoare annotation was computed. [2019-11-24 04:19:45,024 INFO L444 ceAbstractionStarter]: For program point L3673(lines 3673 5017) no Hoare annotation was computed. [2019-11-24 04:19:45,024 INFO L444 ceAbstractionStarter]: For program point L4598(lines 4598 4937) no Hoare annotation was computed. [2019-11-24 04:19:45,024 INFO L444 ceAbstractionStarter]: For program point L767(lines 767 778) no Hoare annotation was computed. [2019-11-24 04:19:45,024 INFO L444 ceAbstractionStarter]: For program point L1164(lines 1164 1188) no Hoare annotation was computed. [2019-11-24 04:19:45,024 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 114) no Hoare annotation was computed. [2019-11-24 04:19:45,024 INFO L444 ceAbstractionStarter]: For program point L1957(lines 1957 5169) no Hoare annotation was computed. [2019-11-24 04:19:45,024 INFO L444 ceAbstractionStarter]: For program point L1693(lines 1693 5192) no Hoare annotation was computed. [2019-11-24 04:19:45,024 INFO L444 ceAbstractionStarter]: For program point L1429(lines 1429 5215) no Hoare annotation was computed. [2019-11-24 04:19:45,024 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 392) no Hoare annotation was computed. [2019-11-24 04:19:45,025 INFO L444 ceAbstractionStarter]: For program point L2354(lines 2354 5135) no Hoare annotation was computed. [2019-11-24 04:19:45,025 INFO L444 ceAbstractionStarter]: For program point L3147(lines 3147 3158) no Hoare annotation was computed. [2019-11-24 04:19:45,025 INFO L444 ceAbstractionStarter]: For program point L3544(lines 3544 3568) no Hoare annotation was computed. [2019-11-24 04:19:45,025 INFO L444 ceAbstractionStarter]: For program point L4337(lines 4337 4959) no Hoare annotation was computed. [2019-11-24 04:19:45,025 INFO L444 ceAbstractionStarter]: For program point L4073(lines 4073 4982) no Hoare annotation was computed. [2019-11-24 04:19:45,025 INFO L444 ceAbstractionStarter]: For program point L3809(lines 3809 5005) no Hoare annotation was computed. [2019-11-24 04:19:45,025 INFO L440 ceAbstractionStarter]: At program point L638(lines 123 640) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-11-24 04:19:45,025 INFO L444 ceAbstractionStarter]: For program point L903(lines 903 914) no Hoare annotation was computed. [2019-11-24 04:19:45,026 INFO L444 ceAbstractionStarter]: For program point L1300(lines 1300 1324) no Hoare annotation was computed. [2019-11-24 04:19:45,026 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 250) no Hoare annotation was computed. [2019-11-24 04:19:45,026 INFO L444 ceAbstractionStarter]: For program point L2093(lines 2093 5157) no Hoare annotation was computed. [2019-11-24 04:19:45,026 INFO L444 ceAbstractionStarter]: For program point L1829(lines 1829 5180) no Hoare annotation was computed. [2019-11-24 04:19:45,026 INFO L440 ceAbstractionStarter]: At program point L4868(lines 4725 4917) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~271 0)) (<= 61 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~273 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~270 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~272 0))) [2019-11-24 04:19:45,026 INFO L444 ceAbstractionStarter]: For program point L4736(lines 4736 4758) no Hoare annotation was computed. [2019-11-24 04:19:45,026 INFO L444 ceAbstractionStarter]: For program point L1565(lines 1565 5203) no Hoare annotation was computed. [2019-11-24 04:19:45,026 INFO L444 ceAbstractionStarter]: For program point L2490(lines 2490 5123) no Hoare annotation was computed. [2019-11-24 04:19:45,027 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4685) no Hoare annotation was computed. [2019-11-24 04:19:45,027 INFO L444 ceAbstractionStarter]: For program point L3283(lines 3283 3294) no Hoare annotation was computed. [2019-11-24 04:19:45,027 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 4888) no Hoare annotation was computed. [2019-11-24 04:19:45,027 INFO L444 ceAbstractionStarter]: For program point L3680(lines 3680 3704) no Hoare annotation was computed. [2019-11-24 04:19:45,027 INFO L444 ceAbstractionStarter]: For program point L4473(lines 4473 4947) no Hoare annotation was computed. [2019-11-24 04:19:45,027 INFO L444 ceAbstractionStarter]: For program point L4209(lines 4209 4970) no Hoare annotation was computed. [2019-11-24 04:19:45,027 INFO L444 ceAbstractionStarter]: For program point L3945(lines 3945 4993) no Hoare annotation was computed. [2019-11-24 04:19:45,028 INFO L444 ceAbstractionStarter]: For program point L4738(line 4738) no Hoare annotation was computed. [2019-11-24 04:19:45,028 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1050) no Hoare annotation was computed. [2019-11-24 04:19:45,028 INFO L444 ceAbstractionStarter]: For program point L1436(lines 1436 1460) no Hoare annotation was computed. [2019-11-24 04:19:45,028 INFO L444 ceAbstractionStarter]: For program point L2229(lines 2229 5145) no Hoare annotation was computed. [2019-11-24 04:19:45,028 INFO L444 ceAbstractionStarter]: For program point L1965(lines 1965 5168) no Hoare annotation was computed. [2019-11-24 04:19:45,028 INFO L444 ceAbstractionStarter]: For program point L1701(lines 1701 5191) no Hoare annotation was computed. [2019-11-24 04:19:45,028 INFO L444 ceAbstractionStarter]: For program point L2626(lines 2626 5111) no Hoare annotation was computed. [2019-11-24 04:19:45,028 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 546) no Hoare annotation was computed. [2019-11-24 04:19:45,028 INFO L444 ceAbstractionStarter]: For program point L3419(lines 3419 3430) no Hoare annotation was computed. [2019-11-24 04:19:45,028 INFO L444 ceAbstractionStarter]: For program point L3816(lines 3816 3840) no Hoare annotation was computed. [2019-11-24 04:19:45,029 INFO L444 ceAbstractionStarter]: For program point L4609(lines 4609 4935) no Hoare annotation was computed. [2019-11-24 04:19:45,029 INFO L444 ceAbstractionStarter]: For program point L4345(lines 4345 4958) no Hoare annotation was computed. [2019-11-24 04:19:45,029 INFO L444 ceAbstractionStarter]: For program point L4081(lines 4081 4981) no Hoare annotation was computed. [2019-11-24 04:19:45,029 INFO L444 ceAbstractionStarter]: For program point L1175(lines 1175 1186) no Hoare annotation was computed. [2019-11-24 04:19:45,029 INFO L444 ceAbstractionStarter]: For program point L1572(lines 1572 1596) no Hoare annotation was computed. [2019-11-24 04:19:45,029 INFO L444 ceAbstractionStarter]: For program point L383(lines 383 390) no Hoare annotation was computed. [2019-11-24 04:19:45,029 INFO L444 ceAbstractionStarter]: For program point L2365(lines 2365 5133) no Hoare annotation was computed. [2019-11-24 04:19:45,029 INFO L444 ceAbstractionStarter]: For program point L2101(lines 2101 5156) no Hoare annotation was computed. [2019-11-24 04:19:45,029 INFO L444 ceAbstractionStarter]: For program point L1837(lines 1837 5179) no Hoare annotation was computed. [2019-11-24 04:19:45,029 INFO L444 ceAbstractionStarter]: For program point L2762(lines 2762 5099) no Hoare annotation was computed. [2019-11-24 04:19:45,030 INFO L444 ceAbstractionStarter]: For program point L3555(lines 3555 3566) no Hoare annotation was computed. [2019-11-24 04:19:45,030 INFO L444 ceAbstractionStarter]: For program point L3952(lines 3952 3976) no Hoare annotation was computed. [2019-11-24 04:19:45,030 INFO L444 ceAbstractionStarter]: For program point L4481(lines 4481 4946) no Hoare annotation was computed. [2019-11-24 04:19:45,030 INFO L444 ceAbstractionStarter]: For program point L4217(lines 4217 4969) no Hoare annotation was computed. [2019-11-24 04:19:45,030 INFO L444 ceAbstractionStarter]: For program point L1311(lines 1311 1322) no Hoare annotation was computed. [2019-11-24 04:19:45,030 INFO L444 ceAbstractionStarter]: For program point L4879(lines 4879 4914) no Hoare annotation was computed. [2019-11-24 04:19:45,030 INFO L444 ceAbstractionStarter]: For program point L1708(lines 1708 1732) no Hoare annotation was computed. [2019-11-24 04:19:45,030 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 539) no Hoare annotation was computed. [2019-11-24 04:19:45,030 INFO L444 ceAbstractionStarter]: For program point L2501(lines 2501 5121) no Hoare annotation was computed. [2019-11-24 04:19:45,031 INFO L444 ceAbstractionStarter]: For program point L2237(lines 2237 5144) no Hoare annotation was computed. [2019-11-24 04:19:45,031 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 640) no Hoare annotation was computed. [2019-11-24 04:19:45,031 INFO L444 ceAbstractionStarter]: For program point L1973(lines 1973 5167) no Hoare annotation was computed. [2019-11-24 04:19:45,031 INFO L444 ceAbstractionStarter]: For program point L2898(lines 2898 5087) no Hoare annotation was computed. [2019-11-24 04:19:45,031 INFO L444 ceAbstractionStarter]: For program point L3691(lines 3691 3702) no Hoare annotation was computed. [2019-11-24 04:19:45,031 INFO L444 ceAbstractionStarter]: For program point L4748(lines 4748 4756) no Hoare annotation was computed. [2019-11-24 04:19:45,032 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4750) no Hoare annotation was computed. [2019-11-24 04:19:45,032 INFO L444 ceAbstractionStarter]: For program point L4088(lines 4088 4112) no Hoare annotation was computed. [2019-11-24 04:19:45,032 INFO L444 ceAbstractionStarter]: For program point L4617(lines 4617 4934) no Hoare annotation was computed. [2019-11-24 04:19:45,032 INFO L444 ceAbstractionStarter]: For program point L4353(lines 4353 4957) no Hoare annotation was computed. [2019-11-24 04:19:45,032 INFO L444 ceAbstractionStarter]: For program point L4750(line 4750) no Hoare annotation was computed. [2019-11-24 04:19:45,032 INFO L444 ceAbstractionStarter]: For program point L654(lines 654 5285) no Hoare annotation was computed. [2019-11-24 04:19:45,033 INFO L444 ceAbstractionStarter]: For program point L1447(lines 1447 1458) no Hoare annotation was computed. [2019-11-24 04:19:45,033 INFO L444 ceAbstractionStarter]: For program point L1844(lines 1844 1868) no Hoare annotation was computed. [2019-11-24 04:19:45,033 INFO L444 ceAbstractionStarter]: For program point L2637(lines 2637 5109) no Hoare annotation was computed. [2019-11-24 04:19:45,033 INFO L444 ceAbstractionStarter]: For program point L2373(lines 2373 5132) no Hoare annotation was computed. [2019-11-24 04:19:45,033 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 594) no Hoare annotation was computed. [2019-11-24 04:19:45,033 INFO L444 ceAbstractionStarter]: For program point L127(lines 127 600) no Hoare annotation was computed. [2019-11-24 04:19:45,034 INFO L444 ceAbstractionStarter]: For program point L2109(lines 2109 5155) no Hoare annotation was computed. [2019-11-24 04:19:45,034 INFO L444 ceAbstractionStarter]: For program point L3034(lines 3034 5075) no Hoare annotation was computed. [2019-11-24 04:19:45,034 INFO L444 ceAbstractionStarter]: For program point L3827(lines 3827 3838) no Hoare annotation was computed. [2019-11-24 04:19:45,034 INFO L444 ceAbstractionStarter]: For program point L4224(lines 4224 4248) no Hoare annotation was computed. [2019-11-24 04:19:45,034 INFO L444 ceAbstractionStarter]: For program point L4489(lines 4489 4945) no Hoare annotation was computed. [2019-11-24 04:19:45,034 INFO L444 ceAbstractionStarter]: For program point L4886(lines 4886 4908) no Hoare annotation was computed. [2019-11-24 04:19:45,034 INFO L444 ceAbstractionStarter]: For program point L790(lines 790 5273) no Hoare annotation was computed. [2019-11-24 04:19:45,034 INFO L444 ceAbstractionStarter]: For program point L1583(lines 1583 1594) no Hoare annotation was computed. [2019-11-24 04:19:45,034 INFO L444 ceAbstractionStarter]: For program point L1980(lines 1980 2004) no Hoare annotation was computed. [2019-11-24 04:19:45,035 INFO L444 ceAbstractionStarter]: For program point L2773(lines 2773 5097) no Hoare annotation was computed. [2019-11-24 04:19:45,035 INFO L444 ceAbstractionStarter]: For program point L2509(lines 2509 5120) no Hoare annotation was computed. [2019-11-24 04:19:45,035 INFO L444 ceAbstractionStarter]: For program point L263(lines 263 553) no Hoare annotation was computed. [2019-11-24 04:19:45,035 INFO L444 ceAbstractionStarter]: For program point L2245(lines 2245 5143) no Hoare annotation was computed. [2019-11-24 04:19:45,035 INFO L444 ceAbstractionStarter]: For program point L3170(lines 3170 5063) no Hoare annotation was computed. [2019-11-24 04:19:45,035 INFO L444 ceAbstractionStarter]: For program point L3963(lines 3963 3974) no Hoare annotation was computed. [2019-11-24 04:19:45,035 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2019-11-24 04:19:45,036 INFO L444 ceAbstractionStarter]: For program point L4888(line 4888) no Hoare annotation was computed. [2019-11-24 04:19:45,036 INFO L444 ceAbstractionStarter]: For program point L4360(lines 4360 4384) no Hoare annotation was computed. [2019-11-24 04:19:45,036 INFO L444 ceAbstractionStarter]: For program point L4625(lines 4625 4933) no Hoare annotation was computed. [2019-11-24 04:19:45,036 INFO L444 ceAbstractionStarter]: For program point L926(lines 926 5261) no Hoare annotation was computed. [2019-11-24 04:19:45,036 INFO L444 ceAbstractionStarter]: For program point L1719(lines 1719 1730) no Hoare annotation was computed. [2019-11-24 04:19:45,036 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 537) no Hoare annotation was computed. [2019-11-24 04:19:45,037 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 189) no Hoare annotation was computed. [2019-11-24 04:19:45,037 INFO L444 ceAbstractionStarter]: For program point L2116(lines 2116 2140) no Hoare annotation was computed. [2019-11-24 04:19:45,037 INFO L444 ceAbstractionStarter]: For program point L2909(lines 2909 5085) no Hoare annotation was computed. [2019-11-24 04:19:45,037 INFO L444 ceAbstractionStarter]: For program point L2645(lines 2645 5108) no Hoare annotation was computed. [2019-11-24 04:19:45,037 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 547) no Hoare annotation was computed. [2019-11-24 04:19:45,037 INFO L444 ceAbstractionStarter]: For program point L2381(lines 2381 5131) no Hoare annotation was computed. [2019-11-24 04:19:45,037 INFO L444 ceAbstractionStarter]: For program point L3306(lines 3306 5051) no Hoare annotation was computed. [2019-11-24 04:19:45,038 INFO L444 ceAbstractionStarter]: For program point L4099(lines 4099 4110) no Hoare annotation was computed. [2019-11-24 04:19:45,038 INFO L444 ceAbstractionStarter]: For program point L4496(lines 4496 4520) no Hoare annotation was computed. [2019-11-24 04:19:45,038 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4818) no Hoare annotation was computed. [2019-11-24 04:19:45,038 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 5283) no Hoare annotation was computed. [2019-11-24 04:19:45,039 INFO L444 ceAbstractionStarter]: For program point L1062(lines 1062 5249) no Hoare annotation was computed. [2019-11-24 04:19:45,039 INFO L444 ceAbstractionStarter]: For program point L1855(lines 1855 1866) no Hoare annotation was computed. [2019-11-24 04:19:45,039 INFO L444 ceAbstractionStarter]: For program point L270(lines 270 325) no Hoare annotation was computed. [2019-11-24 04:19:45,039 INFO L444 ceAbstractionStarter]: For program point L2252(lines 2252 2276) no Hoare annotation was computed. [2019-11-24 04:19:45,039 INFO L444 ceAbstractionStarter]: For program point L3045(lines 3045 5073) no Hoare annotation was computed. [2019-11-24 04:19:45,039 INFO L444 ceAbstractionStarter]: For program point L2781(lines 2781 5096) no Hoare annotation was computed. [2019-11-24 04:19:45,039 INFO L444 ceAbstractionStarter]: For program point L2517(lines 2517 5119) no Hoare annotation was computed. [2019-11-24 04:19:45,040 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 506) no Hoare annotation was computed. [2019-11-24 04:19:45,040 INFO L444 ceAbstractionStarter]: For program point L3442(lines 3442 5039) no Hoare annotation was computed. [2019-11-24 04:19:45,040 INFO L444 ceAbstractionStarter]: For program point L4235(lines 4235 4246) no Hoare annotation was computed. [2019-11-24 04:19:45,040 INFO L447 ceAbstractionStarter]: At program point L5292(lines 22 5295) the Hoare annotation is: true [2019-11-24 04:19:45,040 INFO L444 ceAbstractionStarter]: For program point L4632(lines 4632 4656) no Hoare annotation was computed. [2019-11-24 04:19:45,040 INFO L444 ceAbstractionStarter]: For program point L801(lines 801 5271) no Hoare annotation was computed. [2019-11-24 04:19:45,040 INFO L444 ceAbstractionStarter]: For program point L4765(lines 4765 4915) no Hoare annotation was computed. [2019-11-24 04:19:45,041 INFO L447 ceAbstractionStarter]: At program point L5294(lines 17 5296) the Hoare annotation is: true [2019-11-24 04:19:45,041 INFO L444 ceAbstractionStarter]: For program point L1198(lines 1198 5237) no Hoare annotation was computed. [2019-11-24 04:19:45,041 INFO L444 ceAbstractionStarter]: For program point L1991(lines 1991 2002) no Hoare annotation was computed. [2019-11-24 04:19:45,041 INFO L444 ceAbstractionStarter]: For program point L4898(lines 4898 4906) no Hoare annotation was computed. [2019-11-24 04:19:45,041 INFO L444 ceAbstractionStarter]: For program point L2388(lines 2388 2412) no Hoare annotation was computed. [2019-11-24 04:19:45,041 INFO L444 ceAbstractionStarter]: For program point L3181(lines 3181 5061) no Hoare annotation was computed. [2019-11-24 04:19:45,042 INFO L444 ceAbstractionStarter]: For program point L2917(lines 2917 5084) no Hoare annotation was computed. [2019-11-24 04:19:45,042 INFO L444 ceAbstractionStarter]: For program point L2653(lines 2653 5107) no Hoare annotation was computed. [2019-11-24 04:19:45,042 INFO L444 ceAbstractionStarter]: For program point L3578(lines 3578 5027) no Hoare annotation was computed. [2019-11-24 04:19:45,042 INFO L444 ceAbstractionStarter]: For program point L4371(lines 4371 4382) no Hoare annotation was computed. [2019-11-24 04:19:45,042 INFO L444 ceAbstractionStarter]: For program point L4900(line 4900) no Hoare annotation was computed. [2019-11-24 04:19:45,043 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4709) no Hoare annotation was computed. [2019-11-24 04:19:45,043 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 4900) no Hoare annotation was computed. [2019-11-24 04:19:45,043 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 5259) no Hoare annotation was computed. [2019-11-24 04:19:45,043 INFO L444 ceAbstractionStarter]: For program point L673(lines 673 5282) no Hoare annotation was computed. [2019-11-24 04:19:45,043 INFO L444 ceAbstractionStarter]: For program point L4769(lines 4769 4873) no Hoare annotation was computed. [2019-11-24 04:19:45,043 INFO L444 ceAbstractionStarter]: For program point L1334(lines 1334 5225) no Hoare annotation was computed. [2019-11-24 04:19:45,044 INFO L444 ceAbstractionStarter]: For program point L145(lines 145 187) no Hoare annotation was computed. [2019-11-24 04:19:45,044 INFO L444 ceAbstractionStarter]: For program point L2127(lines 2127 2138) no Hoare annotation was computed. [2019-11-24 04:19:45,044 INFO L444 ceAbstractionStarter]: For program point L2524(lines 2524 2548) no Hoare annotation was computed. [2019-11-24 04:19:45,044 INFO L444 ceAbstractionStarter]: For program point L410(lines 410 465) no Hoare annotation was computed. [2019-11-24 04:19:45,044 INFO L444 ceAbstractionStarter]: For program point L3317(lines 3317 5049) no Hoare annotation was computed. [2019-11-24 04:19:45,044 INFO L444 ceAbstractionStarter]: For program point L3053(lines 3053 5072) no Hoare annotation was computed. [2019-11-24 04:19:45,044 INFO L444 ceAbstractionStarter]: For program point L2789(lines 2789 5095) no Hoare annotation was computed. [2019-11-24 04:19:45,044 INFO L444 ceAbstractionStarter]: For program point L3714(lines 3714 5015) no Hoare annotation was computed. [2019-11-24 04:19:45,045 INFO L444 ceAbstractionStarter]: For program point L4507(lines 4507 4518) no Hoare annotation was computed. [2019-11-24 04:19:45,045 INFO L444 ceAbstractionStarter]: For program point L1073(lines 1073 5247) no Hoare annotation was computed. [2019-11-24 04:19:45,045 INFO L444 ceAbstractionStarter]: For program point L809(lines 809 5270) no Hoare annotation was computed. [2019-11-24 04:19:45,045 INFO L440 ceAbstractionStarter]: At program point L545(lines 399 547) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-11-24 04:19:45,045 INFO L444 ceAbstractionStarter]: For program point L1470(lines 1470 5213) no Hoare annotation was computed. [2019-11-24 04:19:45,046 INFO L444 ceAbstractionStarter]: For program point L281(lines 281 323) no Hoare annotation was computed. [2019-11-24 04:19:45,046 INFO L444 ceAbstractionStarter]: For program point L2263(lines 2263 2274) no Hoare annotation was computed. [2019-11-24 04:19:45,046 INFO L444 ceAbstractionStarter]: For program point L2660(lines 2660 2684) no Hoare annotation was computed. [2019-11-24 04:19:45,046 INFO L444 ceAbstractionStarter]: For program point L3453(lines 3453 5037) no Hoare annotation was computed. [2019-11-24 04:19:45,046 INFO L444 ceAbstractionStarter]: For program point L3189(lines 3189 5060) no Hoare annotation was computed. [2019-11-24 04:19:45,046 INFO L444 ceAbstractionStarter]: For program point L2925(lines 2925 5083) no Hoare annotation was computed. [2019-11-24 04:19:45,047 INFO L444 ceAbstractionStarter]: For program point L3850(lines 3850 5003) no Hoare annotation was computed. [2019-11-24 04:19:45,047 INFO L444 ceAbstractionStarter]: For program point L4643(lines 4643 4654) no Hoare annotation was computed. [2019-11-24 04:19:45,047 INFO L444 ceAbstractionStarter]: For program point L4776(lines 4776 4835) no Hoare annotation was computed. [2019-11-24 04:19:45,047 INFO L444 ceAbstractionStarter]: For program point L1209(lines 1209 5235) no Hoare annotation was computed. [2019-11-24 04:19:45,047 INFO L444 ceAbstractionStarter]: For program point L945(lines 945 5258) no Hoare annotation was computed. [2019-11-24 04:19:45,047 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 5281) no Hoare annotation was computed. [2019-11-24 04:19:45,048 INFO L444 ceAbstractionStarter]: For program point L1606(lines 1606 5201) no Hoare annotation was computed. [2019-11-24 04:19:45,048 INFO L444 ceAbstractionStarter]: For program point L2399(lines 2399 2410) no Hoare annotation was computed. [2019-11-24 04:19:45,048 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 186) no Hoare annotation was computed. [2019-11-24 04:19:45,048 INFO L444 ceAbstractionStarter]: For program point L2796(lines 2796 2820) no Hoare annotation was computed. [2019-11-24 04:19:45,048 INFO L444 ceAbstractionStarter]: For program point L4778(line 4778) no Hoare annotation was computed. [2019-11-24 04:19:45,048 INFO L444 ceAbstractionStarter]: For program point L3589(lines 3589 5025) no Hoare annotation was computed. [2019-11-24 04:19:45,049 INFO L444 ceAbstractionStarter]: For program point L3325(lines 3325 5048) no Hoare annotation was computed. [2019-11-24 04:19:45,049 INFO L444 ceAbstractionStarter]: For program point L22(lines 22 5295) no Hoare annotation was computed. [2019-11-24 04:19:45,049 INFO L444 ceAbstractionStarter]: For program point L3061(lines 3061 5071) no Hoare annotation was computed. [2019-11-24 04:19:45,049 INFO L444 ceAbstractionStarter]: For program point L3986(lines 3986 4991) no Hoare annotation was computed. [2019-11-24 04:19:45,049 INFO L444 ceAbstractionStarter]: For program point L1345(lines 1345 5223) no Hoare annotation was computed. [2019-11-24 04:19:45,049 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4778) no Hoare annotation was computed. [2019-11-24 04:19:45,049 INFO L444 ceAbstractionStarter]: For program point L1081(lines 1081 5246) no Hoare annotation was computed. [2019-11-24 04:19:45,049 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 5269) no Hoare annotation was computed. [2019-11-24 04:19:45,050 INFO L440 ceAbstractionStarter]: At program point L4913(lines 4765 4915) the Hoare annotation is: (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~271 0)) (<= 61 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~273 0)) (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~270 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~272 0))) [2019-11-24 04:19:45,050 INFO L444 ceAbstractionStarter]: For program point L1742(lines 1742 5189) no Hoare annotation was computed. [2019-11-24 04:19:45,050 INFO L444 ceAbstractionStarter]: For program point L2535(lines 2535 2546) no Hoare annotation was computed. [2019-11-24 04:19:45,050 INFO L444 ceAbstractionStarter]: For program point L421(lines 421 463) no Hoare annotation was computed. [2019-11-24 04:19:45,050 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 322) no Hoare annotation was computed. [2019-11-24 04:19:45,050 INFO L444 ceAbstractionStarter]: For program point L2932(lines 2932 2956) no Hoare annotation was computed. [2019-11-24 04:19:45,050 INFO L444 ceAbstractionStarter]: For program point L3725(lines 3725 5013) no Hoare annotation was computed. [2019-11-24 04:19:45,050 INFO L444 ceAbstractionStarter]: For program point L3461(lines 3461 5036) no Hoare annotation was computed. [2019-11-24 04:19:45,050 INFO L444 ceAbstractionStarter]: For program point L3197(lines 3197 5059) no Hoare annotation was computed. [2019-11-24 04:19:45,051 INFO L444 ceAbstractionStarter]: For program point L4122(lines 4122 4979) no Hoare annotation was computed. [2019-11-24 04:19:45,051 INFO L444 ceAbstractionStarter]: For program point L26(lines 26 5288) no Hoare annotation was computed. [2019-11-24 04:19:45,051 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 712) no Hoare annotation was computed. [2019-11-24 04:19:45,051 INFO L444 ceAbstractionStarter]: For program point L1481(lines 1481 5211) no Hoare annotation was computed. [2019-11-24 04:19:45,051 INFO L444 ceAbstractionStarter]: For program point L1217(lines 1217 5234) no Hoare annotation was computed. [2019-11-24 04:19:45,051 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 180) no Hoare annotation was computed. [2019-11-24 04:19:45,051 INFO L444 ceAbstractionStarter]: For program point L953(lines 953 5257) no Hoare annotation was computed. [2019-11-24 04:19:45,051 INFO L444 ceAbstractionStarter]: For program point L1878(lines 1878 5177) no Hoare annotation was computed. [2019-11-24 04:19:45,051 INFO L444 ceAbstractionStarter]: For program point L2671(lines 2671 2682) no Hoare annotation was computed. [2019-11-24 04:19:45,051 INFO L440 ceAbstractionStarter]: At program point L4653(lines 63 5287) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-11-24 04:19:45,052 INFO L444 ceAbstractionStarter]: For program point L3068(lines 3068 3092) no Hoare annotation was computed. [2019-11-24 04:19:45,052 INFO L444 ceAbstractionStarter]: For program point L3861(lines 3861 5001) no Hoare annotation was computed. [2019-11-24 04:19:45,052 INFO L444 ceAbstractionStarter]: For program point L3597(lines 3597 5024) no Hoare annotation was computed. [2019-11-24 04:19:45,052 INFO L444 ceAbstractionStarter]: For program point L3333(lines 3333 5047) no Hoare annotation was computed. [2019-11-24 04:19:45,052 INFO L444 ceAbstractionStarter]: For program point L4258(lines 4258 4967) no Hoare annotation was computed. [2019-11-24 04:19:45,052 INFO L444 ceAbstractionStarter]: For program point L559(lines 559 593) no Hoare annotation was computed. [2019-11-24 04:19:45,052 INFO L444 ceAbstractionStarter]: For program point L824(lines 824 848) no Hoare annotation was computed. [2019-11-24 04:19:45,052 INFO L444 ceAbstractionStarter]: For program point L4788(lines 4788 4833) no Hoare annotation was computed. [2019-11-24 04:19:45,052 INFO L444 ceAbstractionStarter]: For program point L1617(lines 1617 5199) no Hoare annotation was computed. [2019-11-24 04:19:45,053 INFO L444 ceAbstractionStarter]: For program point L1353(lines 1353 5222) no Hoare annotation was computed. [2019-11-24 04:19:45,053 INFO L444 ceAbstractionStarter]: For program point L296(lines 296 316) no Hoare annotation was computed. [2019-11-24 04:19:45,053 INFO L444 ceAbstractionStarter]: For program point L1089(lines 1089 5245) no Hoare annotation was computed. [2019-11-24 04:19:45,053 INFO L444 ceAbstractionStarter]: For program point L2014(lines 2014 5165) no Hoare annotation was computed. [2019-11-24 04:19:45,053 INFO L444 ceAbstractionStarter]: For program point L2807(lines 2807 2818) no Hoare annotation was computed. [2019-11-24 04:19:45,053 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 462) no Hoare annotation was computed. [2019-11-24 04:19:45,053 INFO L444 ceAbstractionStarter]: For program point L3204(lines 3204 3228) no Hoare annotation was computed. [2019-11-24 04:19:45,053 INFO L444 ceAbstractionStarter]: For program point L3997(lines 3997 4989) no Hoare annotation was computed. [2019-11-24 04:19:45,053 INFO L444 ceAbstractionStarter]: For program point L4790(line 4790) no Hoare annotation was computed. [2019-11-24 04:19:45,053 INFO L444 ceAbstractionStarter]: For program point L3733(lines 3733 5012) no Hoare annotation was computed. [2019-11-24 04:19:45,054 INFO L444 ceAbstractionStarter]: For program point L3469(lines 3469 5035) no Hoare annotation was computed. [2019-11-24 04:19:45,054 INFO L444 ceAbstractionStarter]: For program point L4394(lines 4394 4955) no Hoare annotation was computed. [2019-11-24 04:19:45,054 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 56) no Hoare annotation was computed. [2019-11-24 04:19:45,054 INFO L444 ceAbstractionStarter]: For program point L960(lines 960 984) no Hoare annotation was computed. [2019-11-24 04:19:45,054 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-11-24 04:19:45,054 INFO L444 ceAbstractionStarter]: For program point L1753(lines 1753 5187) no Hoare annotation was computed. [2019-11-24 04:19:45,055 INFO L444 ceAbstractionStarter]: For program point L1489(lines 1489 5210) no Hoare annotation was computed. [2019-11-24 04:19:45,055 INFO L444 ceAbstractionStarter]: For program point L1225(lines 1225 5233) no Hoare annotation was computed. [2019-11-24 04:19:45,055 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 4849) no Hoare annotation was computed. [2019-11-24 04:19:45,055 INFO L444 ceAbstractionStarter]: For program point L2150(lines 2150 5153) no Hoare annotation was computed. [2019-11-24 04:19:45,055 INFO L444 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-24 04:19:45,055 INFO L444 ceAbstractionStarter]: For program point L2943(lines 2943 2954) no Hoare annotation was computed. [2019-11-24 04:19:45,056 INFO L444 ceAbstractionStarter]: For program point L3340(lines 3340 3364) no Hoare annotation was computed. [2019-11-24 04:19:45,056 INFO L444 ceAbstractionStarter]: For program point L4133(lines 4133 4977) no Hoare annotation was computed. [2019-11-24 04:19:45,056 INFO L440 ceAbstractionStarter]: At program point L4926(lines 4660 4933) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 59 ULTIMATE.start_main_~main__t~0)) [2019-11-24 04:19:45,056 INFO L444 ceAbstractionStarter]: For program point L3869(lines 3869 5000) no Hoare annotation was computed. [2019-11-24 04:19:45,056 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 586) no Hoare annotation was computed. [2019-11-24 04:19:45,057 INFO L444 ceAbstractionStarter]: For program point L3605(lines 3605 5023) no Hoare annotation was computed. [2019-11-24 04:19:45,057 INFO L444 ceAbstractionStarter]: For program point L4530(lines 4530 4943) no Hoare annotation was computed. [2019-11-24 04:19:45,059 INFO L444 ceAbstractionStarter]: For program point L699(lines 699 710) no Hoare annotation was computed. [2019-11-24 04:19:45,060 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 178) no Hoare annotation was computed. [2019-11-24 04:19:45,060 INFO L444 ceAbstractionStarter]: For program point L1096(lines 1096 1120) no Hoare annotation was computed. [2019-11-24 04:19:45,060 INFO L444 ceAbstractionStarter]: For program point L1889(lines 1889 5175) no Hoare annotation was computed. [2019-11-24 04:19:45,060 INFO L444 ceAbstractionStarter]: For program point L1625(lines 1625 5198) no Hoare annotation was computed. [2019-11-24 04:19:45,060 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 456) no Hoare annotation was computed. [2019-11-24 04:19:45,060 INFO L444 ceAbstractionStarter]: For program point L1361(lines 1361 5221) no Hoare annotation was computed. [2019-11-24 04:19:45,060 INFO L444 ceAbstractionStarter]: For program point L2286(lines 2286 5141) no Hoare annotation was computed. [2019-11-24 04:19:45,060 INFO L444 ceAbstractionStarter]: For program point L3079(lines 3079 3090) no Hoare annotation was computed. [2019-11-24 04:19:45,061 INFO L444 ceAbstractionStarter]: For program point L4797(lines 4797 4832) no Hoare annotation was computed. [2019-11-24 04:19:45,061 INFO L444 ceAbstractionStarter]: For program point L3476(lines 3476 3500) no Hoare annotation was computed. [2019-11-24 04:19:45,061 INFO L444 ceAbstractionStarter]: For program point L4269(lines 4269 4965) no Hoare annotation was computed. [2019-11-24 04:19:45,061 INFO L444 ceAbstractionStarter]: For program point L4005(lines 4005 4988) no Hoare annotation was computed. [2019-11-24 04:19:45,061 INFO L444 ceAbstractionStarter]: For program point L3741(lines 3741 5011) no Hoare annotation was computed. [2019-11-24 04:19:45,061 INFO L444 ceAbstractionStarter]: For program point L835(lines 835 846) no Hoare annotation was computed. [2019-11-24 04:19:45,061 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 314) no Hoare annotation was computed. [2019-11-24 04:19:45,061 INFO L444 ceAbstractionStarter]: For program point L1232(lines 1232 1256) no Hoare annotation was computed. [2019-11-24 04:19:45,061 INFO L444 ceAbstractionStarter]: For program point L2025(lines 2025 5163) no Hoare annotation was computed. [2019-11-24 04:19:45,062 INFO L444 ceAbstractionStarter]: For program point L1761(lines 1761 5186) no Hoare annotation was computed. [2019-11-24 04:19:45,062 INFO L444 ceAbstractionStarter]: For program point L1497(lines 1497 5209) no Hoare annotation was computed. [2019-11-24 04:19:45,062 INFO L444 ceAbstractionStarter]: For program point L2422(lines 2422 5129) no Hoare annotation was computed. [2019-11-24 04:19:45,062 INFO L444 ceAbstractionStarter]: For program point L3215(lines 3215 3226) no Hoare annotation was computed. [2019-11-24 04:19:45,062 INFO L444 ceAbstractionStarter]: For program point L3612(lines 3612 3636) no Hoare annotation was computed. [2019-11-24 04:19:45,062 INFO L444 ceAbstractionStarter]: For program point L4405(lines 4405 4953) no Hoare annotation was computed. [2019-11-24 04:19:45,062 INFO L444 ceAbstractionStarter]: For program point L4141(lines 4141 4976) no Hoare annotation was computed. [2019-11-24 04:19:45,063 INFO L444 ceAbstractionStarter]: For program point L3877(lines 3877 4999) no Hoare annotation was computed. [2019-11-24 04:19:45,063 INFO L444 ceAbstractionStarter]: For program point L46(lines 46 54) no Hoare annotation was computed. [2019-11-24 04:19:45,063 INFO L444 ceAbstractionStarter]: For program point L971(lines 971 982) no Hoare annotation was computed. [2019-11-24 04:19:45,063 INFO L444 ceAbstractionStarter]: For program point L4671(lines 4671 4931) no Hoare annotation was computed. [2019-11-24 04:19:45,063 INFO L444 ceAbstractionStarter]: For program point L1368(lines 1368 1392) no Hoare annotation was computed. [2019-11-24 04:19:45,063 INFO L444 ceAbstractionStarter]: For program point L2161(lines 2161 5151) no Hoare annotation was computed. [2019-11-24 04:19:45,063 INFO L444 ceAbstractionStarter]: For program point L1897(lines 1897 5174) no Hoare annotation was computed. [2019-11-24 04:19:45,064 INFO L444 ceAbstractionStarter]: For program point L4804(lines 4804 4826) no Hoare annotation was computed. [2019-11-24 04:19:45,064 INFO L444 ceAbstractionStarter]: For program point L1633(lines 1633 5197) no Hoare annotation was computed. [2019-11-24 04:19:45,064 INFO L444 ceAbstractionStarter]: For program point L2558(lines 2558 5117) no Hoare annotation was computed. [2019-11-24 04:19:45,064 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4721) no Hoare annotation was computed. [2019-11-24 04:19:45,064 INFO L444 ceAbstractionStarter]: For program point L3351(lines 3351 3362) no Hoare annotation was computed. [2019-11-24 04:19:45,064 INFO L444 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-24 04:19:45,065 INFO L444 ceAbstractionStarter]: For program point L3748(lines 3748 3772) no Hoare annotation was computed. [2019-11-24 04:19:45,065 INFO L444 ceAbstractionStarter]: For program point L577(lines 577 584) no Hoare annotation was computed. [2019-11-24 04:19:45,065 INFO L444 ceAbstractionStarter]: For program point L4673(line 4673) no Hoare annotation was computed. [2019-11-24 04:19:45,065 INFO L444 ceAbstractionStarter]: For program point L4541(lines 4541 4941) no Hoare annotation was computed. [2019-11-24 04:19:45,065 INFO L444 ceAbstractionStarter]: For program point L4277(lines 4277 4964) no Hoare annotation was computed. [2019-11-24 04:19:45,065 INFO L444 ceAbstractionStarter]: For program point L4013(lines 4013 4987) no Hoare annotation was computed. [2019-11-24 04:19:45,065 INFO L444 ceAbstractionStarter]: For program point L4806(line 4806) no Hoare annotation was computed. [2019-11-24 04:19:45,066 INFO L444 ceAbstractionStarter]: For program point L1107(lines 1107 1118) no Hoare annotation was computed. [2019-11-24 04:19:45,066 INFO L444 ceAbstractionStarter]: For program point L1504(lines 1504 1528) no Hoare annotation was computed. [2019-11-24 04:19:45,066 INFO L444 ceAbstractionStarter]: For program point L447(lines 447 454) no Hoare annotation was computed. [2019-11-24 04:19:45,066 INFO L444 ceAbstractionStarter]: For program point L2297(lines 2297 5139) no Hoare annotation was computed. [2019-11-24 04:19:45,066 INFO L444 ceAbstractionStarter]: For program point L2033(lines 2033 5162) no Hoare annotation was computed. [2019-11-24 04:19:45,066 INFO L444 ceAbstractionStarter]: For program point L1769(lines 1769 5185) no Hoare annotation was computed. [2019-11-24 04:19:45,066 INFO L444 ceAbstractionStarter]: For program point L2694(lines 2694 5105) no Hoare annotation was computed. [2019-11-24 04:19:45,067 INFO L444 ceAbstractionStarter]: For program point L3487(lines 3487 3498) no Hoare annotation was computed. [2019-11-24 04:19:45,067 INFO L444 ceAbstractionStarter]: For program point L3884(lines 3884 3908) no Hoare annotation was computed. [2019-11-24 04:19:45,067 INFO L444 ceAbstractionStarter]: For program point L4413(lines 4413 4952) no Hoare annotation was computed. [2019-11-24 04:19:45,067 INFO L444 ceAbstractionStarter]: For program point L4149(lines 4149 4975) no Hoare annotation was computed. [2019-11-24 04:19:45,067 INFO L444 ceAbstractionStarter]: For program point L1243(lines 1243 1254) no Hoare annotation was computed. [2019-11-24 04:19:45,067 INFO L444 ceAbstractionStarter]: For program point L1640(lines 1640 1664) no Hoare annotation was computed. [2019-11-24 04:19:45,067 INFO L444 ceAbstractionStarter]: For program point L2433(lines 2433 5127) no Hoare annotation was computed. [2019-11-24 04:19:45,068 INFO L444 ceAbstractionStarter]: For program point L2169(lines 2169 5150) no Hoare annotation was computed. [2019-11-24 04:19:45,068 INFO L444 ceAbstractionStarter]: For program point L1905(lines 1905 5173) no Hoare annotation was computed. [2019-11-24 04:19:45,068 INFO L444 ceAbstractionStarter]: For program point L2830(lines 2830 5093) no Hoare annotation was computed. [2019-11-24 04:19:45,068 INFO L444 ceAbstractionStarter]: For program point L3623(lines 3623 3634) no Hoare annotation was computed. [2019-11-24 04:19:45,068 INFO L444 ceAbstractionStarter]: For program point L4020(lines 4020 4044) no Hoare annotation was computed. [2019-11-24 04:19:45,068 INFO L444 ceAbstractionStarter]: For program point L4549(lines 4549 4940) no Hoare annotation was computed. [2019-11-24 04:19:45,068 INFO L444 ceAbstractionStarter]: For program point L4285(lines 4285 4963) no Hoare annotation was computed. [2019-11-24 04:19:45,069 INFO L444 ceAbstractionStarter]: For program point L1379(lines 1379 1390) no Hoare annotation was computed. [2019-11-24 04:19:45,069 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 04:19:45,069 INFO L444 ceAbstractionStarter]: For program point L1776(lines 1776 1800) no Hoare annotation was computed. [2019-11-24 04:19:45,069 INFO L444 ceAbstractionStarter]: For program point L4683(lines 4683 4929) no Hoare annotation was computed. [2019-11-24 04:19:45,069 INFO L444 ceAbstractionStarter]: For program point L2569(lines 2569 5115) no Hoare annotation was computed. [2019-11-24 04:19:45,069 INFO L444 ceAbstractionStarter]: For program point L2305(lines 2305 5138) no Hoare annotation was computed. [2019-11-24 04:19:45,070 INFO L444 ceAbstractionStarter]: For program point L2041(lines 2041 5161) no Hoare annotation was computed. [2019-11-24 04:19:45,070 INFO L444 ceAbstractionStarter]: For program point L2966(lines 2966 5081) no Hoare annotation was computed. [2019-11-24 04:19:45,070 INFO L444 ceAbstractionStarter]: For program point L3759(lines 3759 3770) no Hoare annotation was computed. [2019-11-24 04:19:45,070 INFO L444 ceAbstractionStarter]: For program point L4816(lines 4816 4824) no Hoare annotation was computed. [2019-11-24 04:19:45,070 INFO L444 ceAbstractionStarter]: For program point L4156(lines 4156 4180) no Hoare annotation was computed. [2019-11-24 04:19:45,070 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4790) no Hoare annotation was computed. [2019-11-24 04:19:45,071 INFO L444 ceAbstractionStarter]: For program point L4685(line 4685) no Hoare annotation was computed. [2019-11-24 04:19:45,071 INFO L444 ceAbstractionStarter]: For program point L4421(lines 4421 4951) no Hoare annotation was computed. [2019-11-24 04:19:45,071 INFO L444 ceAbstractionStarter]: For program point L4818(line 4818) no Hoare annotation was computed. [2019-11-24 04:19:45,071 INFO L444 ceAbstractionStarter]: For program point L722(lines 722 5279) no Hoare annotation was computed. [2019-11-24 04:19:45,071 INFO L444 ceAbstractionStarter]: For program point L1515(lines 1515 1526) no Hoare annotation was computed. [2019-11-24 04:19:45,071 INFO L444 ceAbstractionStarter]: For program point L1912(lines 1912 1936) no Hoare annotation was computed. [2019-11-24 04:19:45,071 INFO L444 ceAbstractionStarter]: For program point L2705(lines 2705 5103) no Hoare annotation was computed. [2019-11-24 04:19:45,072 INFO L444 ceAbstractionStarter]: For program point L2441(lines 2441 5126) no Hoare annotation was computed. [2019-11-24 04:19:45,072 INFO L444 ceAbstractionStarter]: For program point L2177(lines 2177 5149) no Hoare annotation was computed. [2019-11-24 04:19:45,072 INFO L444 ceAbstractionStarter]: For program point L63(lines 63 5287) no Hoare annotation was computed. [2019-11-24 04:19:45,072 INFO L444 ceAbstractionStarter]: For program point L3102(lines 3102 5069) no Hoare annotation was computed. [2019-11-24 04:19:45,072 INFO L444 ceAbstractionStarter]: For program point L3895(lines 3895 3906) no Hoare annotation was computed. [2019-11-24 04:19:45,072 INFO L440 ceAbstractionStarter]: At program point L592(lines 259 594) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-11-24 04:19:45,073 INFO L444 ceAbstractionStarter]: For program point L4292(lines 4292 4316) no Hoare annotation was computed. [2019-11-24 04:19:45,073 INFO L444 ceAbstractionStarter]: For program point L4557(lines 4557 4939) no Hoare annotation was computed. [2019-11-24 04:19:45,073 INFO L444 ceAbstractionStarter]: For program point L858(lines 858 5267) no Hoare annotation was computed. [2019-11-24 04:19:45,073 INFO L444 ceAbstractionStarter]: For program point L1651(lines 1651 1662) no Hoare annotation was computed. [2019-11-24 04:19:45,073 INFO L440 ceAbstractionStarter]: At program point L330(lines 263 553) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-11-24 04:19:45,073 INFO L444 ceAbstractionStarter]: For program point L2048(lines 2048 2072) no Hoare annotation was computed. [2019-11-24 04:19:45,074 INFO L444 ceAbstractionStarter]: For program point L2841(lines 2841 5091) no Hoare annotation was computed. [2019-11-24 04:19:45,074 INFO L444 ceAbstractionStarter]: For program point L2577(lines 2577 5114) no Hoare annotation was computed. [2019-11-24 04:19:45,074 INFO L444 ceAbstractionStarter]: For program point L2313(lines 2313 5137) no Hoare annotation was computed. [2019-11-24 04:19:45,074 INFO L444 ceAbstractionStarter]: For program point L3238(lines 3238 5057) no Hoare annotation was computed. [2019-11-24 04:19:45,074 INFO L444 ceAbstractionStarter]: For program point L4031(lines 4031 4042) no Hoare annotation was computed. [2019-11-24 04:19:45,074 INFO L444 ceAbstractionStarter]: For program point L4692(lines 4692 4928) no Hoare annotation was computed. [2019-11-24 04:19:45,075 INFO L444 ceAbstractionStarter]: For program point L4428(lines 4428 4452) no Hoare annotation was computed. [2019-11-24 04:19:45,075 INFO L444 ceAbstractionStarter]: For program point L201(lines 201 598) no Hoare annotation was computed. [2019-11-24 04:19:45,075 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 5255) no Hoare annotation was computed. [2019-11-24 04:19:45,075 INFO L444 ceAbstractionStarter]: For program point L1787(lines 1787 1798) no Hoare annotation was computed. [2019-11-24 04:19:45,075 INFO L440 ceAbstractionStarter]: At program point L4694(lines 26 5288) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-11-24 04:19:45,075 INFO L444 ceAbstractionStarter]: For program point L2184(lines 2184 2208) no Hoare annotation was computed. [2019-11-24 04:19:45,075 INFO L444 ceAbstractionStarter]: For program point L70(lines 70 644) no Hoare annotation was computed. [2019-11-24 04:19:45,076 INFO L444 ceAbstractionStarter]: For program point L2977(lines 2977 5079) no Hoare annotation was computed. [2019-11-24 04:19:45,076 INFO L444 ceAbstractionStarter]: For program point L2713(lines 2713 5102) no Hoare annotation was computed. [2019-11-24 04:19:45,076 INFO L444 ceAbstractionStarter]: For program point L2449(lines 2449 5125) no Hoare annotation was computed. [2019-11-24 04:19:45,076 INFO L444 ceAbstractionStarter]: For program point L3374(lines 3374 5045) no Hoare annotation was computed. [2019-11-24 04:19:45,076 INFO L444 ceAbstractionStarter]: For program point L4167(lines 4167 4178) no Hoare annotation was computed. [2019-11-24 04:19:45,076 INFO L444 ceAbstractionStarter]: For program point L4564(lines 4564 4588) no Hoare annotation was computed. [2019-11-24 04:19:45,076 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 5277) no Hoare annotation was computed. [2019-11-24 04:19:45,076 INFO L444 ceAbstractionStarter]: For program point L1130(lines 1130 5243) no Hoare annotation was computed. [2019-11-24 04:19:45,076 INFO L444 ceAbstractionStarter]: For program point L1923(lines 1923 1934) no Hoare annotation was computed. [2019-11-24 04:19:45,077 INFO L440 ceAbstractionStarter]: At program point L470(lines 403 506) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~main__t~0) [2019-11-24 04:19:45,077 INFO L444 ceAbstractionStarter]: For program point L2320(lines 2320 2344) no Hoare annotation was computed. [2019-11-24 04:19:45,077 INFO L444 ceAbstractionStarter]: For program point L3113(lines 3113 5067) no Hoare annotation was computed. [2019-11-24 04:19:45,077 INFO L444 ceAbstractionStarter]: For program point L2849(lines 2849 5090) no Hoare annotation was computed. [2019-11-24 04:19:45,077 INFO L444 ceAbstractionStarter]: For program point L2585(lines 2585 5113) no Hoare annotation was computed. [2019-11-24 04:19:45,077 INFO L444 ceAbstractionStarter]: For program point L3510(lines 3510 5033) no Hoare annotation was computed. [2019-11-24 04:19:45,077 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 551) no Hoare annotation was computed. [2019-11-24 04:19:45,077 INFO L444 ceAbstractionStarter]: For program point L4303(lines 4303 4314) no Hoare annotation was computed. [2019-11-24 04:19:45,077 INFO L444 ceAbstractionStarter]: For program point L4700(lines 4700 4927) no Hoare annotation was computed. [2019-11-24 04:19:45,077 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4673) no Hoare annotation was computed. [2019-11-24 04:19:45,078 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 4861) no Hoare annotation was computed. [2019-11-24 04:19:45,078 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 5265) no Hoare annotation was computed. [2019-11-24 04:19:45,078 INFO L444 ceAbstractionStarter]: For program point L1266(lines 1266 5231) no Hoare annotation was computed. [2019-11-24 04:19:45,078 INFO L444 ceAbstractionStarter]: For program point L2059(lines 2059 2070) no Hoare annotation was computed. [2019-11-24 04:19:45,078 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 639) no Hoare annotation was computed. [2019-11-24 04:19:45,078 INFO L444 ceAbstractionStarter]: For program point L2456(lines 2456 2480) no Hoare annotation was computed. [2019-11-24 04:19:45,078 INFO L444 ceAbstractionStarter]: For program point L3249(lines 3249 5055) no Hoare annotation was computed. [2019-11-24 04:19:45,078 INFO L444 ceAbstractionStarter]: For program point L2985(lines 2985 5078) no Hoare annotation was computed. [2019-11-24 04:19:45,078 INFO L444 ceAbstractionStarter]: For program point L2721(lines 2721 5101) no Hoare annotation was computed. [2019-11-24 04:19:45,079 INFO L444 ceAbstractionStarter]: For program point L3646(lines 3646 5021) no Hoare annotation was computed. [2019-11-24 04:19:45,079 INFO L444 ceAbstractionStarter]: For program point L4439(lines 4439 4450) no Hoare annotation was computed. [2019-11-24 04:19:45,079 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 596) no Hoare annotation was computed. [2019-11-24 04:19:45,079 INFO L444 ceAbstractionStarter]: For program point L1005(lines 1005 5253) no Hoare annotation was computed. [2019-11-24 04:19:45,079 INFO L444 ceAbstractionStarter]: For program point L741(lines 741 5276) no Hoare annotation was computed. [2019-11-24 04:19:45,079 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 5219) no Hoare annotation was computed. [2019-11-24 04:19:45,079 INFO L444 ceAbstractionStarter]: For program point L2195(lines 2195 2206) no Hoare annotation was computed. [2019-11-24 04:19:45,079 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 642) no Hoare annotation was computed. [2019-11-24 04:19:45,079 INFO L444 ceAbstractionStarter]: For program point L2592(lines 2592 2616) no Hoare annotation was computed. [2019-11-24 04:19:45,079 INFO L444 ceAbstractionStarter]: For program point L3385(lines 3385 5043) no Hoare annotation was computed. [2019-11-24 04:19:45,081 INFO L444 ceAbstractionStarter]: For program point L3121(lines 3121 5066) no Hoare annotation was computed. [2019-11-24 04:19:45,082 INFO L444 ceAbstractionStarter]: For program point L2857(lines 2857 5089) no Hoare annotation was computed. [2019-11-24 04:19:45,082 INFO L444 ceAbstractionStarter]: For program point L3782(lines 3782 5009) no Hoare annotation was computed. [2019-11-24 04:19:45,082 INFO L444 ceAbstractionStarter]: For program point L4707(lines 4707 4919) no Hoare annotation was computed. [2019-11-24 04:19:45,082 INFO L444 ceAbstractionStarter]: For program point L4575(lines 4575 4586) no Hoare annotation was computed. [2019-11-24 04:19:45,082 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 504) no Hoare annotation was computed. [2019-11-24 04:19:45,082 INFO L444 ceAbstractionStarter]: For program point L1141(lines 1141 5241) no Hoare annotation was computed. [2019-11-24 04:19:45,082 INFO L444 ceAbstractionStarter]: For program point L877(lines 877 5264) no Hoare annotation was computed. [2019-11-24 04:19:45,082 INFO L444 ceAbstractionStarter]: For program point L613(lines 613 633) no Hoare annotation was computed. [2019-11-24 04:19:45,082 INFO L444 ceAbstractionStarter]: For program point L4709(line 4709) no Hoare annotation was computed. [2019-11-24 04:19:45,082 INFO L444 ceAbstractionStarter]: For program point L1538(lines 1538 5207) no Hoare annotation was computed. [2019-11-24 04:19:45,083 INFO L444 ceAbstractionStarter]: For program point L2331(lines 2331 2342) no Hoare annotation was computed. [2019-11-24 04:19:45,083 INFO L444 ceAbstractionStarter]: For program point L2728(lines 2728 2752) no Hoare annotation was computed. [2019-11-24 04:19:45,083 INFO L444 ceAbstractionStarter]: For program point L3521(lines 3521 5031) no Hoare annotation was computed. [2019-11-24 04:19:45,083 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 549) no Hoare annotation was computed. [2019-11-24 04:19:45,083 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 04:19:45,083 INFO L444 ceAbstractionStarter]: For program point L3257(lines 3257 5054) no Hoare annotation was computed. [2019-11-24 04:19:45,083 INFO L444 ceAbstractionStarter]: For program point L2993(lines 2993 5077) no Hoare annotation was computed. [2019-11-24 04:19:45,083 INFO L444 ceAbstractionStarter]: For program point L3918(lines 3918 4997) no Hoare annotation was computed. [2019-11-24 04:19:45,083 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4738) no Hoare annotation was computed. [2019-11-24 04:19:45,084 INFO L444 ceAbstractionStarter]: For program point L1277(lines 1277 5229) no Hoare annotation was computed. [2019-11-24 04:19:45,084 INFO L444 ceAbstractionStarter]: For program point L1013(lines 1013 5252) no Hoare annotation was computed. [2019-11-24 04:19:45,084 INFO L444 ceAbstractionStarter]: For program point L749(lines 749 5275) no Hoare annotation was computed. [2019-11-24 04:19:45,084 INFO L444 ceAbstractionStarter]: For program point L1674(lines 1674 5195) no Hoare annotation was computed. [2019-11-24 04:19:45,084 INFO L444 ceAbstractionStarter]: For program point L2467(lines 2467 2478) no Hoare annotation was computed. [2019-11-24 04:19:45,084 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 641) no Hoare annotation was computed. [2019-11-24 04:19:45,084 INFO L444 ceAbstractionStarter]: For program point L2864(lines 2864 2888) no Hoare annotation was computed. [2019-11-24 04:19:45,084 INFO L444 ceAbstractionStarter]: For program point L3657(lines 3657 5019) no Hoare annotation was computed. [2019-11-24 04:19:45,084 INFO L444 ceAbstractionStarter]: For program point L3393(lines 3393 5042) no Hoare annotation was computed. [2019-11-24 04:19:45,084 INFO L444 ceAbstractionStarter]: For program point L3129(lines 3129 5065) no Hoare annotation was computed. [2019-11-24 04:19:45,085 INFO L444 ceAbstractionStarter]: For program point L4054(lines 4054 4985) no Hoare annotation was computed. [2019-11-24 04:19:45,085 INFO L444 ceAbstractionStarter]: For program point L4847(lines 4847 4871) no Hoare annotation was computed. [2019-11-24 04:19:45,085 INFO L444 ceAbstractionStarter]: For program point L1413(lines 1413 5217) no Hoare annotation was computed. [2019-11-24 04:19:45,085 INFO L444 ceAbstractionStarter]: For program point L1149(lines 1149 5240) no Hoare annotation was computed. [2019-11-24 04:19:45,085 INFO L444 ceAbstractionStarter]: For program point L885(lines 885 5263) no Hoare annotation was computed. [2019-11-24 04:19:45,085 INFO L444 ceAbstractionStarter]: For program point L1810(lines 1810 5183) no Hoare annotation was computed. [2019-11-24 04:19:45,085 INFO L444 ceAbstractionStarter]: For program point L4849(line 4849) no Hoare annotation was computed. [2019-11-24 04:19:45,085 INFO L444 ceAbstractionStarter]: For program point L2603(lines 2603 2614) no Hoare annotation was computed. [2019-11-24 04:19:45,085 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 595) no Hoare annotation was computed. [2019-11-24 04:19:45,086 INFO L444 ceAbstractionStarter]: For program point L3000(lines 3000 3024) no Hoare annotation was computed. [2019-11-24 04:19:45,086 INFO L444 ceAbstractionStarter]: For program point L3793(lines 3793 5007) no Hoare annotation was computed. [2019-11-24 04:19:45,086 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 502) no Hoare annotation was computed. [2019-11-24 04:19:45,086 INFO L444 ceAbstractionStarter]: For program point L3529(lines 3529 5030) no Hoare annotation was computed. [2019-11-24 04:19:45,086 INFO L444 ceAbstractionStarter]: For program point L3265(lines 3265 5053) no Hoare annotation was computed. [2019-11-24 04:19:45,086 INFO L444 ceAbstractionStarter]: For program point L4190(lines 4190 4973) no Hoare annotation was computed. [2019-11-24 04:19:45,087 INFO L444 ceAbstractionStarter]: For program point L4719(lines 4719 4917) no Hoare annotation was computed. [2019-11-24 04:19:45,087 INFO L444 ceAbstractionStarter]: For program point L756(lines 756 780) no Hoare annotation was computed. [2019-11-24 04:19:45,087 INFO L444 ceAbstractionStarter]: For program point L624(lines 624 631) no Hoare annotation was computed. [2019-11-24 04:19:45,087 INFO L444 ceAbstractionStarter]: For program point L1549(lines 1549 5205) no Hoare annotation was computed. [2019-11-24 04:19:45,087 INFO L444 ceAbstractionStarter]: For program point L1285(lines 1285 5228) no Hoare annotation was computed. [2019-11-24 04:19:45,087 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 116) no Hoare annotation was computed. [2019-11-24 04:19:45,088 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 5251) no Hoare annotation was computed. [2019-11-24 04:19:45,088 INFO L444 ceAbstractionStarter]: For program point L1946(lines 1946 5171) no Hoare annotation was computed. [2019-11-24 04:19:45,088 INFO L444 ceAbstractionStarter]: For program point L2739(lines 2739 2750) no Hoare annotation was computed. [2019-11-24 04:19:45,088 INFO L444 ceAbstractionStarter]: For program point L4721(line 4721) no Hoare annotation was computed. [2019-11-24 04:19:45,088 INFO L444 ceAbstractionStarter]: For program point L3136(lines 3136 3160) no Hoare annotation was computed. [2019-11-24 04:19:45,088 INFO L444 ceAbstractionStarter]: For program point L3929(lines 3929 4995) no Hoare annotation was computed. [2019-11-24 04:19:45,088 INFO L444 ceAbstractionStarter]: For program point L3665(lines 3665 5018) no Hoare annotation was computed. [2019-11-24 04:19:45,088 INFO L444 ceAbstractionStarter]: For program point L3401(lines 3401 5041) no Hoare annotation was computed. [2019-11-24 04:19:45,088 INFO L444 ceAbstractionStarter]: For program point L4326(lines 4326 4961) no Hoare annotation was computed. [2019-11-24 04:19:45,089 INFO L444 ceAbstractionStarter]: For program point L892(lines 892 916) no Hoare annotation was computed. [2019-11-24 04:19:45,089 INFO L444 ceAbstractionStarter]: For program point L1685(lines 1685 5193) no Hoare annotation was computed. [2019-11-24 04:19:45,089 INFO L444 ceAbstractionStarter]: For program point L1421(lines 1421 5216) no Hoare annotation was computed. [2019-11-24 04:19:45,089 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 252) no Hoare annotation was computed. [2019-11-24 04:19:45,089 INFO L444 ceAbstractionStarter]: For program point L1157(lines 1157 5239) no Hoare annotation was computed. [2019-11-24 04:19:45,089 INFO L444 ceAbstractionStarter]: For program point L2082(lines 2082 5159) no Hoare annotation was computed. [2019-11-24 04:19:45,089 INFO L444 ceAbstractionStarter]: For program point L2875(lines 2875 2886) no Hoare annotation was computed. [2019-11-24 04:19:45,089 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4806) no Hoare annotation was computed. [2019-11-24 04:19:45,090 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 548) no Hoare annotation was computed. [2019-11-24 04:19:45,090 INFO L444 ceAbstractionStarter]: For program point L3272(lines 3272 3296) no Hoare annotation was computed. [2019-11-24 04:19:45,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 04:19:45 BoogieIcfgContainer [2019-11-24 04:19:45,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 04:19:45,124 INFO L168 Benchmark]: Toolchain (without parser) took 47217.03 ms. Allocated memory was 136.8 MB in the beginning and 898.6 MB in the end (delta: 761.8 MB). Free memory was 98.7 MB in the beginning and 289.7 MB in the end (delta: -191.0 MB). Peak memory consumption was 570.8 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:45,127 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-24 04:19:45,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1428.69 ms. Allocated memory was 136.8 MB in the beginning and 228.6 MB in the end (delta: 91.8 MB). Free memory was 98.3 MB in the beginning and 182.7 MB in the end (delta: -84.4 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:45,134 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.85 ms. Allocated memory is still 228.6 MB. Free memory was 182.7 MB in the beginning and 171.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:45,135 INFO L168 Benchmark]: Boogie Preprocessor took 140.88 ms. Allocated memory is still 228.6 MB. Free memory was 171.6 MB in the beginning and 163.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:45,136 INFO L168 Benchmark]: RCFGBuilder took 2642.28 ms. Allocated memory was 228.6 MB in the beginning and 264.8 MB in the end (delta: 36.2 MB). Free memory was 163.7 MB in the beginning and 127.2 MB in the end (delta: 36.4 MB). Peak memory consumption was 116.5 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:45,140 INFO L168 Benchmark]: TraceAbstraction took 42855.10 ms. Allocated memory was 264.8 MB in the beginning and 898.6 MB in the end (delta: 633.9 MB). Free memory was 127.2 MB in the beginning and 289.7 MB in the end (delta: -162.5 MB). Peak memory consumption was 471.4 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:45,148 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.28 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1428.69 ms. Allocated memory was 136.8 MB in the beginning and 228.6 MB in the end (delta: 91.8 MB). Free memory was 98.3 MB in the beginning and 182.7 MB in the end (delta: -84.4 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 144.85 ms. Allocated memory is still 228.6 MB. Free memory was 182.7 MB in the beginning and 171.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.88 ms. Allocated memory is still 228.6 MB. Free memory was 171.6 MB in the beginning and 163.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2642.28 ms. Allocated memory was 228.6 MB in the beginning and 264.8 MB in the end (delta: 36.2 MB). Free memory was 163.7 MB in the beginning and 127.2 MB in the end (delta: 36.4 MB). Peak memory consumption was 116.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42855.10 ms. Allocated memory was 264.8 MB in the beginning and 898.6 MB in the end (delta: 633.9 MB). Free memory was 127.2 MB in the beginning and 289.7 MB in the end (delta: -162.5 MB). Peak memory consumption was 471.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4778]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4750]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4685]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4673]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4849]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4709]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4721]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4738]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4806]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4888]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4861]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4818]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4790]: 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: 63]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4725]: Loop Invariant Derived loop invariant: ((((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 61 <= main__t) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 4660]: Loop Invariant Derived loop invariant: main__t < main__tagbuf_len && 59 <= main__t - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 4765]: Loop Invariant Derived loop invariant: ((((!(__VERIFIER_assert__cond == 0) && 61 <= main__t) && !(__VERIFIER_assert__cond == 0)) && main__t < main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 473 locations, 16 error locations. Result: SAFE, OverallTime: 42.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 1527 SDtfs, 45612 SDslu, 1444 SDs, 0 SdLazy, 10496 SolverSat, 12257 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1440 GetRequests, 944 SyntacticMatches, 7 SemanticMatches, 489 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 18.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred 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, 16 MinimizatonAttempts, 118 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 18 NumberOfFragments, 83 HoareAnnotationTreeSize, 13 FomulaSimplifications, 14760 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 1574 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 3524 NumberOfCodeBlocks, 3524 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3508 ConstructedInterpolants, 0 QuantifiedInterpolants, 2370961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...