/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+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:18:54,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:18:54,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:18:54,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:18:54,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:18:54,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:18:54,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:18:54,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:18:54,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:18:54,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:18:54,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:18:54,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:18:54,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:18:54,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:18:54,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:18:54,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:18:54,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:18:54,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:18:54,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:18:54,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:18:54,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:18:54,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:18:54,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:18:54,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:18:54,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:18:54,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:18:54,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:18:54,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:18:54,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:18:54,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:18:54,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:18:54,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:18:54,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:18:54,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:18:54,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:18:54,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:18:54,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:18:54,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:18:54,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:18:54,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:18:54,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:18:54,771 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:54,789 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:18:54,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:18:54,790 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:18:54,790 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:18:54,790 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:18:54,790 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:18:54,791 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:18:54,791 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:18:54,791 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:18:54,791 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:18:54,791 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:18:54,792 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:18:54,793 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:18:54,793 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:18:54,793 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:18:54,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:18:54,794 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:18:54,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:18:54,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:18:54,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:18:54,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:18:54,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:18:54,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:18:54,796 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:18:54,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:18:54,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:18:54,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:18:54,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:18:54,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:18:54,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:18:54,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:18:54,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:18:54,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:18:54,799 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:18:54,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:18:54,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:18:54,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:18:54,800 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:18:55,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:18:55,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:18:55,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:18:55,070 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:18:55,070 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:18:55,071 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+lhb-reducer.c [2019-11-24 04:18:55,131 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e10f2392/9821ab5debf4450187e7be62b545ace3/FLAGc5895dd62 [2019-11-24 04:18:55,617 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:18:55,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-11-24 04:18:55,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e10f2392/9821ab5debf4450187e7be62b545ace3/FLAGc5895dd62 [2019-11-24 04:18:55,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e10f2392/9821ab5debf4450187e7be62b545ace3 [2019-11-24 04:18:55,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:18:55,970 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:18:55,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:18:55,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:18:55,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:18:55,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:18:55" (1/1) ... [2019-11-24 04:18:55,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62caf65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:55, skipping insertion in model container [2019-11-24 04:18:55,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:18:55" (1/1) ... [2019-11-24 04:18:55,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:18:56,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:18:56,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:18:56,370 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:18:56,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:18:56,544 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:18:56,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:56 WrapperNode [2019-11-24 04:18:56,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:18:56,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:18:56,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:18:56,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:18:56,564 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:56" (1/1) ... [2019-11-24 04:18:56,578 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:56" (1/1) ... [2019-11-24 04:18:56,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:18:56,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:18:56,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:18:56,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:18:56,650 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:56" (1/1) ... [2019-11-24 04:18:56,651 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:56" (1/1) ... [2019-11-24 04:18:56,654 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:56" (1/1) ... [2019-11-24 04:18:56,656 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:56" (1/1) ... [2019-11-24 04:18:56,673 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:56" (1/1) ... [2019-11-24 04:18:56,686 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:56" (1/1) ... [2019-11-24 04:18:56,690 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:56" (1/1) ... [2019-11-24 04:18:56,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:18:56,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:18:56,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:18:56,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:18:56,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:56" (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:56,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:18:56,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:18:57,490 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:18:57,491 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 04:18:57,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:18:57 BoogieIcfgContainer [2019-11-24 04:18:57,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:18:57,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:18:57,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:18:57,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:18:57,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:18:55" (1/3) ... [2019-11-24 04:18:57,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed2ee44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:18:57, skipping insertion in model container [2019-11-24 04:18:57,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:56" (2/3) ... [2019-11-24 04:18:57,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed2ee44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:18:57, skipping insertion in model container [2019-11-24 04:18:57,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:18:57" (3/3) ... [2019-11-24 04:18:57,499 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2019-11-24 04:18:57,506 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:18:57,513 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-24 04:18:57,524 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-24 04:18:57,549 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:18:57,549 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:18:57,549 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:18:57,549 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:18:57,549 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:18:57,550 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:18:57,550 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:18:57,550 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:18:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2019-11-24 04:18:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 04:18:57,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:57,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 04:18:57,576 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:18:57,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:57,582 INFO L82 PathProgramCache]: Analyzing trace with hash 547035891, now seen corresponding path program 1 times [2019-11-24 04:18:57,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:57,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377530441] [2019-11-24 04:18:57,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:57,756 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:18:57,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377530441] [2019-11-24 04:18:57,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:57,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:18:57,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840477208] [2019-11-24 04:18:57,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:18:57,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:57,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:18:57,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:18:57,781 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 4 states. [2019-11-24 04:18:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:58,152 INFO L93 Difference]: Finished difference Result 126 states and 200 transitions. [2019-11-24 04:18:58,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:18:58,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-24 04:18:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:58,167 INFO L225 Difference]: With dead ends: 126 [2019-11-24 04:18:58,168 INFO L226 Difference]: Without dead ends: 113 [2019-11-24 04:18:58,170 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:18:58,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-24 04:18:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-24 04:18:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-24 04:18:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2019-11-24 04:18:58,211 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 6 [2019-11-24 04:18:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:58,212 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2019-11-24 04:18:58,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:18:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2019-11-24 04:18:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 04:18:58,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:58,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:58,213 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:18:58,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:58,214 INFO L82 PathProgramCache]: Analyzing trace with hash -221752512, now seen corresponding path program 1 times [2019-11-24 04:18:58,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:58,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107751376] [2019-11-24 04:18:58,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:58,252 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:18:58,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107751376] [2019-11-24 04:18:58,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:58,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:18:58,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346525613] [2019-11-24 04:18:58,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:18:58,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:58,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:18:58,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:18:58,256 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 4 states. [2019-11-24 04:18:58,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:58,433 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2019-11-24 04:18:58,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:18:58,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-24 04:18:58,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:58,435 INFO L225 Difference]: With dead ends: 113 [2019-11-24 04:18:58,435 INFO L226 Difference]: Without dead ends: 108 [2019-11-24 04:18:58,436 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:18:58,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-24 04:18:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-24 04:18:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-24 04:18:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2019-11-24 04:18:58,446 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 7 [2019-11-24 04:18:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:58,447 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2019-11-24 04:18:58,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:18:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2019-11-24 04:18:58,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:18:58,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:58,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:58,448 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:18:58,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:58,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1948841692, now seen corresponding path program 1 times [2019-11-24 04:18:58,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:58,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29295842] [2019-11-24 04:18:58,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:58,508 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:18:58,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29295842] [2019-11-24 04:18:58,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:58,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:58,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472308742] [2019-11-24 04:18:58,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:58,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:58,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:58,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:58,511 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand 5 states. [2019-11-24 04:18:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:58,729 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2019-11-24 04:18:58,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:58,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-24 04:18:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:58,731 INFO L225 Difference]: With dead ends: 108 [2019-11-24 04:18:58,731 INFO L226 Difference]: Without dead ends: 106 [2019-11-24 04:18:58,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:18:58,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-24 04:18:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-24 04:18:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-24 04:18:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2019-11-24 04:18:58,748 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 10 [2019-11-24 04:18:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:58,752 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2019-11-24 04:18:58,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2019-11-24 04:18:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:18:58,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:58,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:58,753 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:18:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash 284554395, now seen corresponding path program 1 times [2019-11-24 04:18:58,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:58,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441505630] [2019-11-24 04:18:58,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:58,835 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:18:58,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441505630] [2019-11-24 04:18:58,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:58,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:18:58,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090321035] [2019-11-24 04:18:58,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:18:58,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:58,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:18:58,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:18:58,838 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 4 states. [2019-11-24 04:18:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:58,987 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2019-11-24 04:18:58,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:18:58,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-24 04:18:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:58,989 INFO L225 Difference]: With dead ends: 106 [2019-11-24 04:18:58,989 INFO L226 Difference]: Without dead ends: 102 [2019-11-24 04:18:58,990 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:18:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-24 04:18:58,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-24 04:18:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-24 04:18:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2019-11-24 04:18:58,998 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 11 [2019-11-24 04:18:58,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:58,998 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2019-11-24 04:18:58,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:18:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2019-11-24 04:18:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:18:59,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:59,000 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:59,000 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:18:59,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:59,001 INFO L82 PathProgramCache]: Analyzing trace with hash 246397519, now seen corresponding path program 1 times [2019-11-24 04:18:59,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:59,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489900577] [2019-11-24 04:18:59,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:59,070 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:18:59,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489900577] [2019-11-24 04:18:59,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:59,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:59,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998243577] [2019-11-24 04:18:59,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:59,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:59,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:59,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:59,076 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 5 states. [2019-11-24 04:18:59,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:59,276 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-11-24 04:18:59,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:59,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-24 04:18:59,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:59,278 INFO L225 Difference]: With dead ends: 120 [2019-11-24 04:18:59,278 INFO L226 Difference]: Without dead ends: 118 [2019-11-24 04:18:59,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:18:59,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-24 04:18:59,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2019-11-24 04:18:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-24 04:18:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2019-11-24 04:18:59,286 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 12 [2019-11-24 04:18:59,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:59,287 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2019-11-24 04:18:59,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2019-11-24 04:18:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:18:59,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:59,288 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:59,288 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:18:59,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:59,289 INFO L82 PathProgramCache]: Analyzing trace with hash 248121423, now seen corresponding path program 1 times [2019-11-24 04:18:59,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:59,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318179263] [2019-11-24 04:18:59,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:59,378 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:18:59,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318179263] [2019-11-24 04:18:59,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:59,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:18:59,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869539873] [2019-11-24 04:18:59,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:18:59,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:59,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:18:59,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:18:59,381 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 6 states. [2019-11-24 04:18:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:59,569 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2019-11-24 04:18:59,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:59,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-24 04:18:59,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:59,571 INFO L225 Difference]: With dead ends: 100 [2019-11-24 04:18:59,571 INFO L226 Difference]: Without dead ends: 98 [2019-11-24 04:18:59,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:18:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-24 04:18:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-24 04:18:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-24 04:18:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-11-24 04:18:59,587 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 12 [2019-11-24 04:18:59,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:59,588 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-11-24 04:18:59,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:18:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-11-24 04:18:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:18:59,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:59,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:59,589 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:18:59,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:59,590 INFO L82 PathProgramCache]: Analyzing trace with hash -951607394, now seen corresponding path program 1 times [2019-11-24 04:18:59,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:59,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144292582] [2019-11-24 04:18:59,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:59,667 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:18:59,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144292582] [2019-11-24 04:18:59,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:59,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:59,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592020497] [2019-11-24 04:18:59,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:59,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:59,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:59,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:59,669 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 5 states. [2019-11-24 04:18:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:59,901 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2019-11-24 04:18:59,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:18:59,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 04:18:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:59,902 INFO L225 Difference]: With dead ends: 115 [2019-11-24 04:18:59,902 INFO L226 Difference]: Without dead ends: 113 [2019-11-24 04:18:59,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:18:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-24 04:18:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2019-11-24 04:18:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-24 04:18:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-11-24 04:18:59,908 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 13 [2019-11-24 04:18:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:59,909 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-11-24 04:18:59,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-11-24 04:18:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:18:59,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:59,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:59,910 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:18:59,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:59,911 INFO L82 PathProgramCache]: Analyzing trace with hash -950060249, now seen corresponding path program 1 times [2019-11-24 04:18:59,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:59,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244112546] [2019-11-24 04:18:59,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:59,984 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:18:59,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244112546] [2019-11-24 04:18:59,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:59,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:59,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889117937] [2019-11-24 04:18:59,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:59,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:59,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:59,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:59,986 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 5 states. [2019-11-24 04:19:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:00,183 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2019-11-24 04:19:00,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:00,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 04:19:00,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:00,185 INFO L225 Difference]: With dead ends: 115 [2019-11-24 04:19:00,185 INFO L226 Difference]: Without dead ends: 113 [2019-11-24 04:19:00,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-24 04:19:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2019-11-24 04:19:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-24 04:19:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2019-11-24 04:19:00,191 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 13 [2019-11-24 04:19:00,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:00,191 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2019-11-24 04:19:00,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2019-11-24 04:19:00,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:19:00,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:00,192 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:00,193 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:00,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:00,193 INFO L82 PathProgramCache]: Analyzing trace with hash -898166314, now seen corresponding path program 1 times [2019-11-24 04:19:00,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:00,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907401828] [2019-11-24 04:19:00,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:00,257 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:00,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907401828] [2019-11-24 04:19:00,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:00,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:19:00,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168085157] [2019-11-24 04:19:00,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:19:00,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:00,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:19:00,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:00,260 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 5 states. [2019-11-24 04:19:00,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:00,427 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2019-11-24 04:19:00,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:00,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 04:19:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:00,429 INFO L225 Difference]: With dead ends: 94 [2019-11-24 04:19:00,429 INFO L226 Difference]: Without dead ends: 90 [2019-11-24 04:19:00,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-24 04:19:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-24 04:19:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-24 04:19:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2019-11-24 04:19:00,433 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 13 [2019-11-24 04:19:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:00,433 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2019-11-24 04:19:00,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2019-11-24 04:19:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:19:00,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:00,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:00,435 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:00,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:00,435 INFO L82 PathProgramCache]: Analyzing trace with hash 612907497, now seen corresponding path program 1 times [2019-11-24 04:19:00,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:00,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179823983] [2019-11-24 04:19:00,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:00,491 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:00,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179823983] [2019-11-24 04:19:00,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:00,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:19:00,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806437295] [2019-11-24 04:19:00,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:19:00,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:00,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:19:00,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:00,493 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 5 states. [2019-11-24 04:19:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:00,678 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2019-11-24 04:19:00,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:00,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-24 04:19:00,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:00,684 INFO L225 Difference]: With dead ends: 106 [2019-11-24 04:19:00,685 INFO L226 Difference]: Without dead ends: 104 [2019-11-24 04:19:00,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-24 04:19:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 88. [2019-11-24 04:19:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-24 04:19:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2019-11-24 04:19:00,689 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 14 [2019-11-24 04:19:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:00,691 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2019-11-24 04:19:00,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2019-11-24 04:19:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:19:00,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:00,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:00,692 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:00,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:00,693 INFO L82 PathProgramCache]: Analyzing trace with hash 333456161, now seen corresponding path program 1 times [2019-11-24 04:19:00,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:00,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444844381] [2019-11-24 04:19:00,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:00,783 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:00,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444844381] [2019-11-24 04:19:00,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:00,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:00,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232061622] [2019-11-24 04:19:00,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:00,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:00,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:00,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:00,785 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 6 states. [2019-11-24 04:19:01,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:01,023 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2019-11-24 04:19:01,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:01,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-24 04:19:01,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:01,024 INFO L225 Difference]: With dead ends: 98 [2019-11-24 04:19:01,024 INFO L226 Difference]: Without dead ends: 96 [2019-11-24 04:19:01,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:01,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-24 04:19:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2019-11-24 04:19:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-24 04:19:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2019-11-24 04:19:01,029 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 15 [2019-11-24 04:19:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:01,029 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2019-11-24 04:19:01,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2019-11-24 04:19:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:19:01,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:01,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:01,030 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:01,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:01,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1747210525, now seen corresponding path program 1 times [2019-11-24 04:19:01,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:01,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790451838] [2019-11-24 04:19:01,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:01,075 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:01,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790451838] [2019-11-24 04:19:01,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:01,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:01,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001113048] [2019-11-24 04:19:01,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:01,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:01,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:01,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:01,077 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 4 states. [2019-11-24 04:19:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:01,183 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2019-11-24 04:19:01,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:19:01,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 04:19:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:01,184 INFO L225 Difference]: With dead ends: 86 [2019-11-24 04:19:01,185 INFO L226 Difference]: Without dead ends: 53 [2019-11-24 04:19:01,185 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:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-24 04:19:01,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-24 04:19:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-24 04:19:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-11-24 04:19:01,187 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 16 [2019-11-24 04:19:01,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:01,188 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-11-24 04:19:01,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-11-24 04:19:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:19:01,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:01,189 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] [2019-11-24 04:19:01,189 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:01,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:01,190 INFO L82 PathProgramCache]: Analyzing trace with hash -789661849, now seen corresponding path program 1 times [2019-11-24 04:19:01,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:01,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370905361] [2019-11-24 04:19:01,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:01,355 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:01,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370905361] [2019-11-24 04:19:01,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:01,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-24 04:19:01,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117392892] [2019-11-24 04:19:01,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-24 04:19:01,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:01,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-24 04:19:01,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-24 04:19:01,358 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 13 states. [2019-11-24 04:19:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:01,464 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-11-24 04:19:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-24 04:19:01,465 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2019-11-24 04:19:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:01,465 INFO L225 Difference]: With dead ends: 53 [2019-11-24 04:19:01,466 INFO L226 Difference]: Without dead ends: 51 [2019-11-24 04:19:01,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-11-24 04:19:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-24 04:19:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-24 04:19:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-24 04:19:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-11-24 04:19:01,468 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 43 [2019-11-24 04:19:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:01,469 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-11-24 04:19:01,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-24 04:19:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-11-24 04:19:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:19:01,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:01,470 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] [2019-11-24 04:19:01,470 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:01,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash -789645961, now seen corresponding path program 1 times [2019-11-24 04:19:01,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:01,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257466802] [2019-11-24 04:19:01,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:01,631 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:01,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257466802] [2019-11-24 04:19:01,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:01,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-24 04:19:01,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021157611] [2019-11-24 04:19:01,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-24 04:19:01,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:01,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-24 04:19:01,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-24 04:19:01,634 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 13 states. [2019-11-24 04:19:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:01,756 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-11-24 04:19:01,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-24 04:19:01,757 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2019-11-24 04:19:01,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:01,758 INFO L225 Difference]: With dead ends: 58 [2019-11-24 04:19:01,759 INFO L226 Difference]: Without dead ends: 56 [2019-11-24 04:19:01,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-11-24 04:19:01,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-24 04:19:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2019-11-24 04:19:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-24 04:19:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-11-24 04:19:01,762 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 43 [2019-11-24 04:19:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:01,764 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-11-24 04:19:01,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-24 04:19:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-11-24 04:19:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 04:19:01,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:01,765 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] [2019-11-24 04:19:01,765 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:01,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:01,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1290290900, now seen corresponding path program 1 times [2019-11-24 04:19:01,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:01,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602597861] [2019-11-24 04:19:01,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:02,018 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,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602597861] [2019-11-24 04:19:02,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:02,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:19:02,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123610658] [2019-11-24 04:19:02,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:19:02,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:02,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:19:02,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:02,022 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2019-11-24 04:19:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:02,110 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-11-24 04:19:02,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:02,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-24 04:19:02,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:02,111 INFO L225 Difference]: With dead ends: 49 [2019-11-24 04:19:02,111 INFO L226 Difference]: Without dead ends: 45 [2019-11-24 04:19:02,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 25 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:02,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-24 04:19:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-24 04:19:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-24 04:19:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-11-24 04:19:02,117 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 44 [2019-11-24 04:19:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:02,117 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-11-24 04:19:02,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-11-24 04:19:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 04:19:02,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:02,118 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] [2019-11-24 04:19:02,119 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:02,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:02,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1290783444, now seen corresponding path program 1 times [2019-11-24 04:19:02,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:02,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949124488] [2019-11-24 04:19:02,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:02,385 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,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949124488] [2019-11-24 04:19:02,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:02,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:19:02,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440644803] [2019-11-24 04:19:02,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:19:02,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:02,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:19:02,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:02,388 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 5 states. [2019-11-24 04:19:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:02,474 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-11-24 04:19:02,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:02,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-24 04:19:02,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:02,475 INFO L225 Difference]: With dead ends: 49 [2019-11-24 04:19:02,475 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 04:19:02,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 25 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:02,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 04:19:02,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 04:19:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 04:19:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 04:19:02,476 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2019-11-24 04:19:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:02,477 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 04:19:02,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 04:19:02,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 04:19:02,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 04:19:02,581 INFO L444 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2019-11-24 04:19:02,581 INFO L447 ceAbstractionStarter]: At program point L927(lines 12 1001) the Hoare annotation is: true [2019-11-24 04:19:02,581 INFO L444 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2019-11-24 04:19:02,581 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2019-11-24 04:19:02,582 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-11-24 04:19:02,582 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2019-11-24 04:19:02,582 INFO L444 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2019-11-24 04:19:02,582 INFO L444 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2019-11-24 04:19:02,582 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2019-11-24 04:19:02,582 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-24 04:19:02,582 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 04:19:02,582 INFO L444 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2019-11-24 04:19:02,583 INFO L444 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-24 04:19:02,584 INFO L444 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2019-11-24 04:19:02,584 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2019-11-24 04:19:02,584 INFO L444 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2019-11-24 04:19:02,584 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-24 04:19:02,584 INFO L444 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2019-11-24 04:19:02,584 INFO L440 ceAbstractionStarter]: At program point L863(lines 21 995) 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:02,584 INFO L444 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-11-24 04:19:02,585 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2019-11-24 04:19:02,585 INFO L444 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2019-11-24 04:19:02,585 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2019-11-24 04:19:02,585 INFO L444 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2019-11-24 04:19:02,585 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-11-24 04:19:02,585 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2019-11-24 04:19:02,585 INFO L444 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2019-11-24 04:19:02,585 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2019-11-24 04:19:02,585 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2019-11-24 04:19:02,586 INFO L444 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2019-11-24 04:19:02,586 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2019-11-24 04:19:02,586 INFO L444 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2019-11-24 04:19:02,586 INFO L444 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2019-11-24 04:19:02,587 INFO L440 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2019-11-24 04:19:02,587 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2019-11-24 04:19:02,587 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-11-24 04:19:02,587 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2019-11-24 04:19:02,587 INFO L444 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-24 04:19:02,587 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2019-11-24 04:19:02,589 INFO L444 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2019-11-24 04:19:02,589 INFO L447 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true [2019-11-24 04:19:02,589 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2019-11-24 04:19:02,590 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 04:19:02,590 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-11-24 04:19:02,590 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2019-11-24 04:19:02,590 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2019-11-24 04:19:02,590 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2019-11-24 04:19:02,590 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2019-11-24 04:19:02,590 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-11-24 04:19:02,590 INFO L444 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2019-11-24 04:19:02,590 INFO L444 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2019-11-24 04:19:02,591 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-24 04:19:02,591 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2019-11-24 04:19:02,591 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2019-11-24 04:19:02,591 INFO L440 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 8 ULTIMATE.start_main_~main__t~0)) [2019-11-24 04:19:02,591 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2019-11-24 04:19:02,591 INFO L444 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2019-11-24 04:19:02,591 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2019-11-24 04:19:02,591 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-11-24 04:19:02,592 INFO L444 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2019-11-24 04:19:02,592 INFO L444 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2019-11-24 04:19:02,592 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-11-24 04:19:02,592 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2019-11-24 04:19:02,592 INFO L444 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2019-11-24 04:19:02,592 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-24 04:19:02,592 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2019-11-24 04:19:02,592 INFO L444 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2019-11-24 04:19:02,592 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2019-11-24 04:19:02,593 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2019-11-24 04:19:02,593 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2019-11-24 04:19:02,593 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2019-11-24 04:19:02,593 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2019-11-24 04:19:02,593 INFO L444 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2019-11-24 04:19:02,593 INFO L444 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2019-11-24 04:19:02,593 INFO L444 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2019-11-24 04:19:02,593 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-11-24 04:19:02,594 INFO L440 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0)) [2019-11-24 04:19:02,594 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-11-24 04:19:02,594 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-24 04:19:02,595 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2019-11-24 04:19:02,595 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2019-11-24 04:19:02,596 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-11-24 04:19:02,596 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2019-11-24 04:19:02,596 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2019-11-24 04:19:02,596 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2019-11-24 04:19:02,596 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2019-11-24 04:19:02,596 INFO L444 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2019-11-24 04:19:02,596 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-24 04:19:02,597 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-24 04:19:02,597 INFO L444 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-11-24 04:19:02,597 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2019-11-24 04:19:02,597 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-24 04:19:02,597 INFO L444 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2019-11-24 04:19:02,597 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2019-11-24 04:19:02,598 INFO L444 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-11-24 04:19:02,598 INFO L444 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2019-11-24 04:19:02,598 INFO L444 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2019-11-24 04:19:02,598 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2019-11-24 04:19:02,598 INFO L444 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-11-24 04:19:02,598 INFO L444 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2019-11-24 04:19:02,598 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2019-11-24 04:19:02,598 INFO L444 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-11-24 04:19:02,598 INFO L444 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2019-11-24 04:19:02,599 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2019-11-24 04:19:02,599 INFO L444 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2019-11-24 04:19:02,599 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2019-11-24 04:19:02,600 INFO L444 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2019-11-24 04:19:02,600 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-11-24 04:19:02,600 INFO L444 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2019-11-24 04:19:02,600 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-24 04:19:02,600 INFO L444 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2019-11-24 04:19:02,600 INFO L444 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2019-11-24 04:19:02,600 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-11-24 04:19:02,600 INFO L444 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2019-11-24 04:19:02,601 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2019-11-24 04:19:02,601 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2019-11-24 04:19:02,601 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2019-11-24 04:19:02,601 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2019-11-24 04:19:02,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 04:19:02 BoogieIcfgContainer [2019-11-24 04:19:02,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 04:19:02,627 INFO L168 Benchmark]: Toolchain (without parser) took 6656.05 ms. Allocated memory was 137.9 MB in the beginning and 291.0 MB in the end (delta: 153.1 MB). Free memory was 101.2 MB in the beginning and 205.1 MB in the end (delta: -103.9 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:02,628 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-24 04:19:02,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.39 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.7 MB in the beginning and 175.4 MB in the end (delta: -74.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:02,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.22 ms. Allocated memory is still 201.3 MB. Free memory was 175.4 MB in the beginning and 171.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:02,630 INFO L168 Benchmark]: Boogie Preprocessor took 55.87 ms. Allocated memory is still 201.3 MB. Free memory was 171.4 MB in the beginning and 169.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:02,631 INFO L168 Benchmark]: RCFGBuilder took 797.20 ms. Allocated memory is still 201.3 MB. Free memory was 169.4 MB in the beginning and 118.0 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:02,631 INFO L168 Benchmark]: TraceAbstraction took 5131.38 ms. Allocated memory was 201.3 MB in the beginning and 291.0 MB in the end (delta: 89.7 MB). Free memory was 117.4 MB in the beginning and 205.1 MB in the end (delta: -87.7 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:02,635 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.27 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 574.39 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.7 MB in the beginning and 175.4 MB in the end (delta: -74.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 92.22 ms. Allocated memory is still 201.3 MB. Free memory was 175.4 MB in the beginning and 171.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.87 ms. Allocated memory is still 201.3 MB. Free memory was 171.4 MB in the beginning and 169.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 797.20 ms. Allocated memory is still 201.3 MB. Free memory was 169.4 MB in the beginning and 118.0 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5131.38 ms. Allocated memory was 201.3 MB in the beginning and 291.0 MB in the end (delta: 89.7 MB). Free memory was 117.4 MB in the beginning and 205.1 MB in the end (delta: -87.7 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: 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: 127]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t + 1 <= main__tagbuf_len - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 8 <= main__t - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 16 error locations. Result: SAFE, OverallTime: 5.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 678 SDtfs, 1957 SDslu, 689 SDs, 0 SdLazy, 2401 SolverSat, 468 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 48 SyntacticMatches, 55 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred 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, 87 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 32 HoareAnnotationTreeSize, 6 FomulaSimplifications, 1145 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 61 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 30483 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...