/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/eca-rers2012/Problem03_label27.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:34:28,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:34:28,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:34:28,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:34:28,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:34:28,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:34:28,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:34:28,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:34:28,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:34:28,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:34:28,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:34:28,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:34:28,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:34:28,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:34:28,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:34:28,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:34:28,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:34:28,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:34:28,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:34:28,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:34:28,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:34:28,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:34:28,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:34:28,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:34:28,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:34:28,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:34:28,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:34:28,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:34:28,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:34:28,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:34:28,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:34:28,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:34:28,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:34:28,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:34:28,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:34:28,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:34:28,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:34:28,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:34:28,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:34:28,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:34:28,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:34:28,873 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-23 23:34:28,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:34:28,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:34:28,897 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:34:28,897 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:34:28,897 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:34:28,897 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:34:28,898 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:34:28,898 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:34:28,898 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:34:28,898 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:34:28,898 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:34:28,898 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:34:28,899 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:34:28,899 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:34:28,899 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:34:28,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:34:28,900 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:34:28,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:34:28,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:34:28,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:34:28,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:34:28,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:34:28,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:34:28,901 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:34:28,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:34:28,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:34:28,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:34:28,902 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:34:28,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:34:28,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:34:28,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:34:28,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:34:28,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:34:28,903 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:34:28,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:34:28,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:34:28,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:34:28,904 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:34:29,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:34:29,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:34:29,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:34:29,249 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:34:29,250 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:34:29,251 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label27.c [2019-11-23 23:34:29,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cded23b8/569467a7e79847079ee649bafa1ecd50/FLAG5be50b40e [2019-11-23 23:34:29,997 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:34:30,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label27.c [2019-11-23 23:34:30,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cded23b8/569467a7e79847079ee649bafa1ecd50/FLAG5be50b40e [2019-11-23 23:34:30,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cded23b8/569467a7e79847079ee649bafa1ecd50 [2019-11-23 23:34:30,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:34:30,170 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:34:30,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:34:30,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:34:30,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:34:30,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:34:30" (1/1) ... [2019-11-23 23:34:30,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5db580e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:30, skipping insertion in model container [2019-11-23 23:34:30,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:34:30" (1/1) ... [2019-11-23 23:34:30,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:34:30,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:34:31,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:34:31,063 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:34:31,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:34:31,327 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:34:31,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:31 WrapperNode [2019-11-23 23:34:31,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:34:31,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:34:31,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:34:31,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:34:31,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:31" (1/1) ... [2019-11-23 23:34:31,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:31" (1/1) ... [2019-11-23 23:34:31,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:34:31,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:34:31,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:34:31,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:34:31,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:31" (1/1) ... [2019-11-23 23:34:31,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:31" (1/1) ... [2019-11-23 23:34:31,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:31" (1/1) ... [2019-11-23 23:34:31,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:31" (1/1) ... [2019-11-23 23:34:31,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:31" (1/1) ... [2019-11-23 23:34:31,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:31" (1/1) ... [2019-11-23 23:34:31,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:31" (1/1) ... [2019-11-23 23:34:31,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:34:31,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:34:31,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:34:31,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:34:31,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:31" (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-23 23:34:31,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:34:31,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:34:34,792 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:34:34,792 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:34:34,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:34:34 BoogieIcfgContainer [2019-11-23 23:34:34,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:34:34,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:34:34,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:34:34,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:34:34,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:34:30" (1/3) ... [2019-11-23 23:34:34,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666892b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:34:34, skipping insertion in model container [2019-11-23 23:34:34,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:31" (2/3) ... [2019-11-23 23:34:34,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666892b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:34:34, skipping insertion in model container [2019-11-23 23:34:34,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:34:34" (3/3) ... [2019-11-23 23:34:34,804 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label27.c [2019-11-23 23:34:34,815 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:34:34,824 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:34:34,837 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:34:34,867 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:34:34,868 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:34:34,868 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:34:34,869 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:34:34,869 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:34:34,869 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:34:34,869 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:34:34,869 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:34:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:34:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:34:34,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:34,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:34,921 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:34,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:34,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1467462123, now seen corresponding path program 1 times [2019-11-23 23:34:34,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:34,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80687541] [2019-11-23 23:34:34,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:35,521 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-23 23:34:35,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80687541] [2019-11-23 23:34:35,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:35,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:35,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249636730] [2019-11-23 23:34:35,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:35,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:35,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:35,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:35,547 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-23 23:34:37,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:37,436 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-23 23:34:37,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:37,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 23:34:37,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:37,463 INFO L225 Difference]: With dead ends: 585 [2019-11-23 23:34:37,463 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 23:34:37,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:37,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 23:34:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2019-11-23 23:34:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-11-23 23:34:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 728 transitions. [2019-11-23 23:34:37,550 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 728 transitions. Word has length 143 [2019-11-23 23:34:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:37,551 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 728 transitions. [2019-11-23 23:34:37,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 728 transitions. [2019-11-23 23:34:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 23:34:37,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:37,560 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:37,560 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:37,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:37,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1977889100, now seen corresponding path program 1 times [2019-11-23 23:34:37,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:37,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237662093] [2019-11-23 23:34:37,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:37,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237662093] [2019-11-23 23:34:37,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:37,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:37,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674975624] [2019-11-23 23:34:37,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:37,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:37,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:37,685 INFO L87 Difference]: Start difference. First operand 432 states and 728 transitions. Second operand 3 states. [2019-11-23 23:34:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:38,666 INFO L93 Difference]: Finished difference Result 1292 states and 2181 transitions. [2019-11-23 23:34:38,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:38,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 23:34:38,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:38,672 INFO L225 Difference]: With dead ends: 1292 [2019-11-23 23:34:38,673 INFO L226 Difference]: Without dead ends: 861 [2019-11-23 23:34:38,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-11-23 23:34:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2019-11-23 23:34:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-11-23 23:34:38,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1412 transitions. [2019-11-23 23:34:38,727 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1412 transitions. Word has length 151 [2019-11-23 23:34:38,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:38,728 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1412 transitions. [2019-11-23 23:34:38,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1412 transitions. [2019-11-23 23:34:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:34:38,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:38,737 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:38,737 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:38,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:38,738 INFO L82 PathProgramCache]: Analyzing trace with hash 351568369, now seen corresponding path program 1 times [2019-11-23 23:34:38,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:38,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962163684] [2019-11-23 23:34:38,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:38,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962163684] [2019-11-23 23:34:38,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:38,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:38,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723519633] [2019-11-23 23:34:38,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:38,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:38,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:38,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:38,937 INFO L87 Difference]: Start difference. First operand 861 states and 1412 transitions. Second operand 3 states. [2019-11-23 23:34:39,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:39,939 INFO L93 Difference]: Finished difference Result 2579 states and 4233 transitions. [2019-11-23 23:34:39,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:39,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 23:34:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:39,952 INFO L225 Difference]: With dead ends: 2579 [2019-11-23 23:34:39,952 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:34:39,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:34:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-11-23 23:34:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:34:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2572 transitions. [2019-11-23 23:34:40,015 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2572 transitions. Word has length 158 [2019-11-23 23:34:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:40,016 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2572 transitions. [2019-11-23 23:34:40,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:40,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2572 transitions. [2019-11-23 23:34:40,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-23 23:34:40,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:40,024 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:40,025 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:40,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:40,025 INFO L82 PathProgramCache]: Analyzing trace with hash -284906485, now seen corresponding path program 1 times [2019-11-23 23:34:40,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:40,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380215527] [2019-11-23 23:34:40,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:40,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380215527] [2019-11-23 23:34:40,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:40,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:40,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947163381] [2019-11-23 23:34:40,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:40,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:40,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:40,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:40,164 INFO L87 Difference]: Start difference. First operand 1719 states and 2572 transitions. Second operand 4 states. [2019-11-23 23:34:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:41,314 INFO L93 Difference]: Finished difference Result 5153 states and 7713 transitions. [2019-11-23 23:34:41,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:41,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-11-23 23:34:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:41,330 INFO L225 Difference]: With dead ends: 5153 [2019-11-23 23:34:41,331 INFO L226 Difference]: Without dead ends: 3435 [2019-11-23 23:34:41,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2019-11-23 23:34:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2019-11-23 23:34:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-11-23 23:34:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4638 transitions. [2019-11-23 23:34:41,408 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4638 transitions. Word has length 168 [2019-11-23 23:34:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:41,408 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 4638 transitions. [2019-11-23 23:34:41,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4638 transitions. [2019-11-23 23:34:41,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-23 23:34:41,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:41,416 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:41,416 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:41,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:41,417 INFO L82 PathProgramCache]: Analyzing trace with hash -37563002, now seen corresponding path program 1 times [2019-11-23 23:34:41,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:41,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351556306] [2019-11-23 23:34:41,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:41,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351556306] [2019-11-23 23:34:41,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:41,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:41,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881130604] [2019-11-23 23:34:41,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:41,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:41,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:41,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:41,512 INFO L87 Difference]: Start difference. First operand 3435 states and 4638 transitions. Second operand 4 states. [2019-11-23 23:34:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:42,985 INFO L93 Difference]: Finished difference Result 13451 states and 18182 transitions. [2019-11-23 23:34:42,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:42,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-23 23:34:42,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:43,029 INFO L225 Difference]: With dead ends: 13451 [2019-11-23 23:34:43,029 INFO L226 Difference]: Without dead ends: 10017 [2019-11-23 23:34:43,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10017 states. [2019-11-23 23:34:43,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10017 to 10013. [2019-11-23 23:34:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10013 states. [2019-11-23 23:34:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10013 states to 10013 states and 13466 transitions. [2019-11-23 23:34:43,302 INFO L78 Accepts]: Start accepts. Automaton has 10013 states and 13466 transitions. Word has length 170 [2019-11-23 23:34:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:43,303 INFO L462 AbstractCegarLoop]: Abstraction has 10013 states and 13466 transitions. [2019-11-23 23:34:43,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 10013 states and 13466 transitions. [2019-11-23 23:34:43,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-23 23:34:43,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:43,314 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:43,315 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:43,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:43,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1393151756, now seen corresponding path program 1 times [2019-11-23 23:34:43,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:43,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884611165] [2019-11-23 23:34:43,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-23 23:34:43,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884611165] [2019-11-23 23:34:43,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:43,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:43,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348739495] [2019-11-23 23:34:43,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:43,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:43,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:43,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:43,432 INFO L87 Difference]: Start difference. First operand 10013 states and 13466 transitions. Second operand 3 states. [2019-11-23 23:34:44,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:44,323 INFO L93 Difference]: Finished difference Result 22313 states and 30454 transitions. [2019-11-23 23:34:44,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:44,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-23 23:34:44,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:44,371 INFO L225 Difference]: With dead ends: 22313 [2019-11-23 23:34:44,371 INFO L226 Difference]: Without dead ends: 12301 [2019-11-23 23:34:44,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:44,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12301 states. [2019-11-23 23:34:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12301 to 12301. [2019-11-23 23:34:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12301 states. [2019-11-23 23:34:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12301 states to 12301 states and 15812 transitions. [2019-11-23 23:34:44,699 INFO L78 Accepts]: Start accepts. Automaton has 12301 states and 15812 transitions. Word has length 186 [2019-11-23 23:34:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:44,700 INFO L462 AbstractCegarLoop]: Abstraction has 12301 states and 15812 transitions. [2019-11-23 23:34:44,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 12301 states and 15812 transitions. [2019-11-23 23:34:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-23 23:34:44,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:44,707 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:44,708 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:44,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:44,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1123959629, now seen corresponding path program 1 times [2019-11-23 23:34:44,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:44,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723848249] [2019-11-23 23:34:44,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:44,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723848249] [2019-11-23 23:34:44,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:44,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:44,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513046939] [2019-11-23 23:34:44,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:44,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:44,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:44,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:44,885 INFO L87 Difference]: Start difference. First operand 12301 states and 15812 transitions. Second operand 4 states. [2019-11-23 23:34:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:46,224 INFO L93 Difference]: Finished difference Result 30752 states and 40082 transitions. [2019-11-23 23:34:46,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:46,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-23 23:34:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:46,290 INFO L225 Difference]: With dead ends: 30752 [2019-11-23 23:34:46,291 INFO L226 Difference]: Without dead ends: 18452 [2019-11-23 23:34:46,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:46,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18452 states. [2019-11-23 23:34:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18452 to 14732. [2019-11-23 23:34:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14732 states. [2019-11-23 23:34:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14732 states to 14732 states and 18648 transitions. [2019-11-23 23:34:47,403 INFO L78 Accepts]: Start accepts. Automaton has 14732 states and 18648 transitions. Word has length 197 [2019-11-23 23:34:47,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:47,404 INFO L462 AbstractCegarLoop]: Abstraction has 14732 states and 18648 transitions. [2019-11-23 23:34:47,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 14732 states and 18648 transitions. [2019-11-23 23:34:47,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-23 23:34:47,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:47,415 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:47,416 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:47,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:47,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1662210238, now seen corresponding path program 1 times [2019-11-23 23:34:47,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:47,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833142655] [2019-11-23 23:34:47,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 23:34:47,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833142655] [2019-11-23 23:34:47,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:47,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:47,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971043882] [2019-11-23 23:34:47,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:47,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:47,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:47,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:47,618 INFO L87 Difference]: Start difference. First operand 14732 states and 18648 transitions. Second operand 3 states. [2019-11-23 23:34:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:48,591 INFO L93 Difference]: Finished difference Result 36756 states and 46069 transitions. [2019-11-23 23:34:48,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:48,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-11-23 23:34:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:48,638 INFO L225 Difference]: With dead ends: 36756 [2019-11-23 23:34:48,638 INFO L226 Difference]: Without dead ends: 22025 [2019-11-23 23:34:48,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22025 states. [2019-11-23 23:34:49,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22025 to 22025. [2019-11-23 23:34:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22025 states. [2019-11-23 23:34:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22025 states to 22025 states and 26900 transitions. [2019-11-23 23:34:49,108 INFO L78 Accepts]: Start accepts. Automaton has 22025 states and 26900 transitions. Word has length 202 [2019-11-23 23:34:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:49,109 INFO L462 AbstractCegarLoop]: Abstraction has 22025 states and 26900 transitions. [2019-11-23 23:34:49,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:49,109 INFO L276 IsEmpty]: Start isEmpty. Operand 22025 states and 26900 transitions. [2019-11-23 23:34:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-23 23:34:49,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:49,119 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:49,119 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:49,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:49,120 INFO L82 PathProgramCache]: Analyzing trace with hash -851001742, now seen corresponding path program 1 times [2019-11-23 23:34:49,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:49,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016810756] [2019-11-23 23:34:49,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-23 23:34:49,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016810756] [2019-11-23 23:34:49,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:49,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:49,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091704958] [2019-11-23 23:34:49,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:49,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:49,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:49,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:49,208 INFO L87 Difference]: Start difference. First operand 22025 states and 26900 transitions. Second operand 3 states. [2019-11-23 23:34:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:50,200 INFO L93 Difference]: Finished difference Result 55348 states and 67461 transitions. [2019-11-23 23:34:50,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:50,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-23 23:34:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:50,254 INFO L225 Difference]: With dead ends: 55348 [2019-11-23 23:34:50,254 INFO L226 Difference]: Without dead ends: 33324 [2019-11-23 23:34:50,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:50,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33324 states. [2019-11-23 23:34:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33324 to 33322. [2019-11-23 23:34:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33322 states. [2019-11-23 23:34:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33322 states to 33322 states and 40477 transitions. [2019-11-23 23:34:50,989 INFO L78 Accepts]: Start accepts. Automaton has 33322 states and 40477 transitions. Word has length 205 [2019-11-23 23:34:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:50,990 INFO L462 AbstractCegarLoop]: Abstraction has 33322 states and 40477 transitions. [2019-11-23 23:34:50,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 33322 states and 40477 transitions. [2019-11-23 23:34:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-23 23:34:51,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:51,002 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:51,002 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:51,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:51,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1764523537, now seen corresponding path program 1 times [2019-11-23 23:34:51,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:51,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014931153] [2019-11-23 23:34:51,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-23 23:34:51,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014931153] [2019-11-23 23:34:51,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725940939] [2019-11-23 23:34:51,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:51,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:34:51,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:34:51,368 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-23 23:34:51,368 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:34:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-23 23:34:51,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:34:51,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:34:51,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282733273] [2019-11-23 23:34:51,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:51,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:51,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:51,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:34:51,435 INFO L87 Difference]: Start difference. First operand 33322 states and 40477 transitions. Second operand 3 states. [2019-11-23 23:34:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:52,631 INFO L93 Difference]: Finished difference Result 79084 states and 95887 transitions. [2019-11-23 23:34:52,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:52,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-11-23 23:34:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:53,018 INFO L225 Difference]: With dead ends: 79084 [2019-11-23 23:34:53,019 INFO L226 Difference]: Without dead ends: 45763 [2019-11-23 23:34:53,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 421 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:34:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45763 states. [2019-11-23 23:34:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45763 to 38327. [2019-11-23 23:34:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38327 states. [2019-11-23 23:34:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38327 states to 38327 states and 46699 transitions. [2019-11-23 23:34:53,874 INFO L78 Accepts]: Start accepts. Automaton has 38327 states and 46699 transitions. Word has length 212 [2019-11-23 23:34:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:53,875 INFO L462 AbstractCegarLoop]: Abstraction has 38327 states and 46699 transitions. [2019-11-23 23:34:53,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 38327 states and 46699 transitions. [2019-11-23 23:34:53,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-11-23 23:34:53,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:53,896 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:54,100 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:54,100 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:54,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:54,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1568828011, now seen corresponding path program 1 times [2019-11-23 23:34:54,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:54,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330093951] [2019-11-23 23:34:54,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-23 23:34:54,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330093951] [2019-11-23 23:34:54,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:54,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:54,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941542485] [2019-11-23 23:34:54,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:54,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:54,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:54,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:54,395 INFO L87 Difference]: Start difference. First operand 38327 states and 46699 transitions. Second operand 4 states. [2019-11-23 23:34:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:56,632 INFO L93 Difference]: Finished difference Result 84947 states and 103156 transitions. [2019-11-23 23:34:56,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:56,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 276 [2019-11-23 23:34:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:56,687 INFO L225 Difference]: With dead ends: 84947 [2019-11-23 23:34:56,687 INFO L226 Difference]: Without dead ends: 46621 [2019-11-23 23:34:56,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:56,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46621 states. [2019-11-23 23:34:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46621 to 45048. [2019-11-23 23:34:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45048 states. [2019-11-23 23:34:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45048 states to 45048 states and 53248 transitions. [2019-11-23 23:34:57,290 INFO L78 Accepts]: Start accepts. Automaton has 45048 states and 53248 transitions. Word has length 276 [2019-11-23 23:34:57,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:57,291 INFO L462 AbstractCegarLoop]: Abstraction has 45048 states and 53248 transitions. [2019-11-23 23:34:57,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 45048 states and 53248 transitions. [2019-11-23 23:34:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-23 23:34:57,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:57,312 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-23 23:34:57,312 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:57,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:57,313 INFO L82 PathProgramCache]: Analyzing trace with hash -802621019, now seen corresponding path program 1 times [2019-11-23 23:34:57,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:57,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131558340] [2019-11-23 23:34:57,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 160 proven. 39 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:57,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131558340] [2019-11-23 23:34:57,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911437719] [2019-11-23 23:34:57,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:58,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:34:58,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:34:58,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:34:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 160 proven. 39 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:58,331 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:34:58,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:34:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 160 proven. 39 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:58,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [14433667] [2019-11-23 23:34:58,519 INFO L159 IcfgInterpreter]: Started Sifa with 145 locations of interest [2019-11-23 23:34:58,519 INFO L166 IcfgInterpreter]: Building call graph [2019-11-23 23:34:58,530 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-23 23:34:58,541 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-23 23:34:58,542 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-23 23:35:00,549 WARN L192 SmtUtils]: Spent 712.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-11-23 23:35:00,664 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 160 [2019-11-23 23:35:01,269 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-11-23 23:35:01,385 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-11-23 23:35:27,595 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-23 23:35:27,646 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-23 23:35:27,723 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-23 23:35:40,368 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-23 23:35:42,636 WARN L192 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 231 DAG size of output: 203 [2019-11-23 23:35:45,014 WARN L192 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 232 DAG size of output: 206 [2019-11-23 23:35:47,554 WARN L192 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 234 DAG size of output: 204 [2019-11-23 23:35:48,004 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-11-23 23:35:49,627 WARN L192 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 172 [2019-11-23 23:35:51,650 WARN L192 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 195 DAG size of output: 169