/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_label56.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:36:26,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:36:26,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:36:26,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:36:26,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:36:26,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:36:26,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:36:26,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:36:26,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:36:26,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:36:26,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:36:26,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:36:26,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:36:26,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:36:26,856 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:36:26,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:36:26,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:36:26,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:36:26,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:36:26,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:36:26,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:36:26,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:36:26,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:36:26,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:36:26,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:36:26,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:36:26,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:36:26,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:36:26,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:36:26,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:36:26,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:36:26,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:36:26,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:36:26,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:36:26,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:36:26,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:36:26,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:36:26,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:36:26,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:36:26,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:36:26,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:36:26,905 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:36:26,930 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:36:26,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:36:26,931 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:36:26,935 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:36:26,936 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:36:26,936 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:36:26,936 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:36:26,936 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:36:26,937 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:36:26,937 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:36:26,938 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:36:26,938 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:36:26,938 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:36:26,939 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:36:26,939 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:36:26,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:36:26,940 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:36:26,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:36:26,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:36:26,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:36:26,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:36:26,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:36:26,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:36:26,942 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:36:26,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:36:26,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:36:26,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:36:26,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:36:26,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:36:26,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:36:26,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:36:26,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:36:26,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:36:26,945 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:36:26,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:36:26,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:36:26,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:36:26,946 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:36:27,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:36:27,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:36:27,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:36:27,278 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:36:27,279 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:36:27,279 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label56.c [2019-11-23 23:36:27,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/316b9f8d7/b837cfc0a76843dcb5917f068adad74c/FLAG145457755 [2019-11-23 23:36:27,998 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:36:27,999 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label56.c [2019-11-23 23:36:28,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/316b9f8d7/b837cfc0a76843dcb5917f068adad74c/FLAG145457755 [2019-11-23 23:36:28,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/316b9f8d7/b837cfc0a76843dcb5917f068adad74c [2019-11-23 23:36:28,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:36:28,173 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:36:28,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:36:28,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:36:28,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:36:28,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:28" (1/1) ... [2019-11-23 23:36:28,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba4308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28, skipping insertion in model container [2019-11-23 23:36:28,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:28" (1/1) ... [2019-11-23 23:36:28,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:36:28,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:36:29,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:36:29,266 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:36:29,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:36:29,574 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:36:29,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:29 WrapperNode [2019-11-23 23:36:29,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:36:29,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:36:29,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:36:29,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:36:29,594 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:36:29" (1/1) ... [2019-11-23 23:36:29,629 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:36:29" (1/1) ... [2019-11-23 23:36:29,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:36:29,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:36:29,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:36:29,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:36:29,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:29" (1/1) ... [2019-11-23 23:36:29,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:29" (1/1) ... [2019-11-23 23:36:29,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:29" (1/1) ... [2019-11-23 23:36:29,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:29" (1/1) ... [2019-11-23 23:36:29,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:29" (1/1) ... [2019-11-23 23:36:29,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:29" (1/1) ... [2019-11-23 23:36:29,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:29" (1/1) ... [2019-11-23 23:36:29,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:36:29,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:36:29,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:36:29,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:36:29,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:29" (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:36:29,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:36:29,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:36:33,129 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:36:33,129 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:36:33,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:33 BoogieIcfgContainer [2019-11-23 23:36:33,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:36:33,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:36:33,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:36:33,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:36:33,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:36:28" (1/3) ... [2019-11-23 23:36:33,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414a043a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:33, skipping insertion in model container [2019-11-23 23:36:33,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:29" (2/3) ... [2019-11-23 23:36:33,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414a043a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:33, skipping insertion in model container [2019-11-23 23:36:33,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:33" (3/3) ... [2019-11-23 23:36:33,140 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label56.c [2019-11-23 23:36:33,151 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:36:33,159 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:36:33,171 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:36:33,199 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:36:33,199 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:36:33,200 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:36:33,200 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:36:33,200 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:36:33,200 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:36:33,200 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:36:33,200 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:36:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:36:33,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:36:33,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:33,237 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:36:33,238 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:33,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1467445471, now seen corresponding path program 1 times [2019-11-23 23:36:33,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:33,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374209927] [2019-11-23 23:36:33,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:33,987 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:36:33,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374209927] [2019-11-23 23:36:33,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:33,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:33,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060409012] [2019-11-23 23:36:34,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:34,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:34,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:34,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:34,024 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-23 23:36:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:35,916 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-23 23:36:35,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:35,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 23:36:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:35,947 INFO L225 Difference]: With dead ends: 585 [2019-11-23 23:36:35,947 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 23:36:35,951 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:36:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 23:36:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 289. [2019-11-23 23:36:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-23 23:36:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 521 transitions. [2019-11-23 23:36:36,017 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 521 transitions. Word has length 143 [2019-11-23 23:36:36,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:36,019 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 521 transitions. [2019-11-23 23:36:36,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 521 transitions. [2019-11-23 23:36:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 23:36:36,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:36,023 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:36:36,024 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1977872448, now seen corresponding path program 1 times [2019-11-23 23:36:36,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:36,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608092890] [2019-11-23 23:36:36,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:36,183 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:36:36,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608092890] [2019-11-23 23:36:36,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:36,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:36:36,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284298807] [2019-11-23 23:36:36,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:36,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:36,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:36,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:36,189 INFO L87 Difference]: Start difference. First operand 289 states and 521 transitions. Second operand 3 states. [2019-11-23 23:36:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:37,131 INFO L93 Difference]: Finished difference Result 863 states and 1560 transitions. [2019-11-23 23:36:37,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:37,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 23:36:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:37,136 INFO L225 Difference]: With dead ends: 863 [2019-11-23 23:36:37,136 INFO L226 Difference]: Without dead ends: 575 [2019-11-23 23:36:37,138 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:36:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-11-23 23:36:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-11-23 23:36:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-23 23:36:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1015 transitions. [2019-11-23 23:36:37,183 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1015 transitions. Word has length 151 [2019-11-23 23:36:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:37,183 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1015 transitions. [2019-11-23 23:36:37,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1015 transitions. [2019-11-23 23:36:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 23:36:37,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:37,190 INFO L410 BasicCegarLoop]: trace histogram [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, 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:36:37,190 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:37,191 INFO L82 PathProgramCache]: Analyzing trace with hash -119308039, now seen corresponding path program 1 times [2019-11-23 23:36:37,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:37,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51587171] [2019-11-23 23:36:37,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:37,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51587171] [2019-11-23 23:36:37,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:37,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:37,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009482521] [2019-11-23 23:36:37,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:37,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:37,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:37,276 INFO L87 Difference]: Start difference. First operand 575 states and 1015 transitions. Second operand 4 states. [2019-11-23 23:36:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:38,927 INFO L93 Difference]: Finished difference Result 2295 states and 4056 transitions. [2019-11-23 23:36:38,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:38,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-23 23:36:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:38,938 INFO L225 Difference]: With dead ends: 2295 [2019-11-23 23:36:38,938 INFO L226 Difference]: Without dead ends: 1721 [2019-11-23 23:36:38,940 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:36:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-11-23 23:36:38,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1147. [2019-11-23 23:36:38,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-11-23 23:36:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1882 transitions. [2019-11-23 23:36:38,988 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1882 transitions. Word has length 152 [2019-11-23 23:36:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:38,989 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1882 transitions. [2019-11-23 23:36:38,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1882 transitions. [2019-11-23 23:36:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 23:36:38,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:38,996 INFO L410 BasicCegarLoop]: trace histogram [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, 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:36:38,997 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:38,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:38,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1787634629, now seen corresponding path program 1 times [2019-11-23 23:36:38,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:38,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751518613] [2019-11-23 23:36:38,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:39,074 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:39,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751518613] [2019-11-23 23:36:39,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:39,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:36:39,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921406528] [2019-11-23 23:36:39,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:39,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:39,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:39,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:39,077 INFO L87 Difference]: Start difference. First operand 1147 states and 1882 transitions. Second operand 3 states. [2019-11-23 23:36:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:40,025 INFO L93 Difference]: Finished difference Result 2865 states and 4680 transitions. [2019-11-23 23:36:40,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:40,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-23 23:36:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:40,035 INFO L225 Difference]: With dead ends: 2865 [2019-11-23 23:36:40,035 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:36:40,038 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:36:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:36:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-11-23 23:36:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:36:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2745 transitions. [2019-11-23 23:36:40,094 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2745 transitions. Word has length 153 [2019-11-23 23:36:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:40,094 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2745 transitions. [2019-11-23 23:36:40,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2745 transitions. [2019-11-23 23:36:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:36:40,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:40,100 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:36:40,101 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:40,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash 351585021, now seen corresponding path program 1 times [2019-11-23 23:36:40,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:40,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028313288] [2019-11-23 23:36:40,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:40,329 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:36:40,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028313288] [2019-11-23 23:36:40,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:40,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:40,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538665034] [2019-11-23 23:36:40,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:40,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:40,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:40,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:40,332 INFO L87 Difference]: Start difference. First operand 1719 states and 2745 transitions. Second operand 3 states. [2019-11-23 23:36:41,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:41,332 INFO L93 Difference]: Finished difference Result 5153 states and 8232 transitions. [2019-11-23 23:36:41,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:41,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 23:36:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:41,351 INFO L225 Difference]: With dead ends: 5153 [2019-11-23 23:36:41,352 INFO L226 Difference]: Without dead ends: 3435 [2019-11-23 23:36:41,354 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:36:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2019-11-23 23:36:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2019-11-23 23:36:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-11-23 23:36:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 5027 transitions. [2019-11-23 23:36:41,425 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 5027 transitions. Word has length 158 [2019-11-23 23:36:41,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:41,425 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 5027 transitions. [2019-11-23 23:36:41,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:41,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 5027 transitions. [2019-11-23 23:36:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 23:36:41,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:41,432 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2019-11-23 23:36:41,433 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:41,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash -856968136, now seen corresponding path program 1 times [2019-11-23 23:36:41,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:41,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380613109] [2019-11-23 23:36:41,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:41,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380613109] [2019-11-23 23:36:41,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758760311] [2019-11-23 23:36:41,555 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:36:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:41,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:36:41,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:41,791 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:41,792 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:41,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:41,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:36:41,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812712256] [2019-11-23 23:36:41,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:41,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:41,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:41,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:41,839 INFO L87 Difference]: Start difference. First operand 3435 states and 5027 transitions. Second operand 3 states. [2019-11-23 23:36:42,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:42,832 INFO L93 Difference]: Finished difference Result 9443 states and 13781 transitions. [2019-11-23 23:36:42,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:42,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-11-23 23:36:42,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:42,859 INFO L225 Difference]: With dead ends: 9443 [2019-11-23 23:36:42,859 INFO L226 Difference]: Without dead ends: 6009 [2019-11-23 23:36:42,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 317 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2019-11-23 23:36:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 6009. [2019-11-23 23:36:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6009 states. [2019-11-23 23:36:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6009 states to 6009 states and 7710 transitions. [2019-11-23 23:36:42,981 INFO L78 Accepts]: Start accepts. Automaton has 6009 states and 7710 transitions. Word has length 160 [2019-11-23 23:36:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:42,981 INFO L462 AbstractCegarLoop]: Abstraction has 6009 states and 7710 transitions. [2019-11-23 23:36:42,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 6009 states and 7710 transitions. [2019-11-23 23:36:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-23 23:36:42,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:42,992 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:43,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:43,197 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:43,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:43,198 INFO L82 PathProgramCache]: Analyzing trace with hash 800207787, now seen corresponding path program 1 times [2019-11-23 23:36:43,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:43,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757923067] [2019-11-23 23:36:43,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 23:36:43,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757923067] [2019-11-23 23:36:43,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:43,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:43,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768714131] [2019-11-23 23:36:43,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:43,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:43,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:43,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:43,297 INFO L87 Difference]: Start difference. First operand 6009 states and 7710 transitions. Second operand 4 states. [2019-11-23 23:36:44,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:44,770 INFO L93 Difference]: Finished difference Result 17310 states and 22502 transitions. [2019-11-23 23:36:44,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:44,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-23 23:36:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:44,832 INFO L225 Difference]: With dead ends: 17310 [2019-11-23 23:36:44,833 INFO L226 Difference]: Without dead ends: 11302 [2019-11-23 23:36:44,844 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:36:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11302 states. [2019-11-23 23:36:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11302 to 8440. [2019-11-23 23:36:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8440 states. [2019-11-23 23:36:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8440 states to 8440 states and 10630 transitions. [2019-11-23 23:36:45,150 INFO L78 Accepts]: Start accepts. Automaton has 8440 states and 10630 transitions. Word has length 178 [2019-11-23 23:36:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:45,150 INFO L462 AbstractCegarLoop]: Abstraction has 8440 states and 10630 transitions. [2019-11-23 23:36:45,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 8440 states and 10630 transitions. [2019-11-23 23:36:45,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-23 23:36:45,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:45,164 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:45,165 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:45,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:45,165 INFO L82 PathProgramCache]: Analyzing trace with hash 954284794, now seen corresponding path program 1 times [2019-11-23 23:36:45,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:45,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850710826] [2019-11-23 23:36:45,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:45,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850710826] [2019-11-23 23:36:45,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:45,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:36:45,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323486663] [2019-11-23 23:36:45,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:36:45,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:45,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:36:45,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:36:45,322 INFO L87 Difference]: Start difference. First operand 8440 states and 10630 transitions. Second operand 5 states. [2019-11-23 23:36:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:47,295 INFO L93 Difference]: Finished difference Result 37906 states and 47937 transitions. [2019-11-23 23:36:47,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:36:47,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-11-23 23:36:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:47,366 INFO L225 Difference]: With dead ends: 37906 [2019-11-23 23:36:47,366 INFO L226 Difference]: Without dead ends: 29467 [2019-11-23 23:36:47,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:36:47,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29467 states. [2019-11-23 23:36:47,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29467 to 29461. [2019-11-23 23:36:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29461 states. [2019-11-23 23:36:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29461 states to 29461 states and 37087 transitions. [2019-11-23 23:36:47,941 INFO L78 Accepts]: Start accepts. Automaton has 29461 states and 37087 transitions. Word has length 203 [2019-11-23 23:36:47,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:47,941 INFO L462 AbstractCegarLoop]: Abstraction has 29461 states and 37087 transitions. [2019-11-23 23:36:47,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:36:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 29461 states and 37087 transitions. [2019-11-23 23:36:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-23 23:36:47,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:47,960 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, 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] [2019-11-23 23:36:47,960 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:47,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2057968644, now seen corresponding path program 1 times [2019-11-23 23:36:47,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:47,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814782425] [2019-11-23 23:36:47,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:48,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814782425] [2019-11-23 23:36:48,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:48,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:48,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830316756] [2019-11-23 23:36:48,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:48,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:48,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:48,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:48,140 INFO L87 Difference]: Start difference. First operand 29461 states and 37087 transitions. Second operand 4 states. [2019-11-23 23:36:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:49,634 INFO L93 Difference]: Finished difference Result 69360 states and 86557 transitions. [2019-11-23 23:36:49,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:49,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-11-23 23:36:49,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:49,704 INFO L225 Difference]: With dead ends: 69360 [2019-11-23 23:36:49,705 INFO L226 Difference]: Without dead ends: 39900 [2019-11-23 23:36:49,739 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:36:49,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39900 states. [2019-11-23 23:36:50,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39900 to 31606. [2019-11-23 23:36:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31606 states. [2019-11-23 23:36:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31606 states to 31606 states and 39045 transitions. [2019-11-23 23:36:50,305 INFO L78 Accepts]: Start accepts. Automaton has 31606 states and 39045 transitions. Word has length 206 [2019-11-23 23:36:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:50,305 INFO L462 AbstractCegarLoop]: Abstraction has 31606 states and 39045 transitions. [2019-11-23 23:36:50,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 31606 states and 39045 transitions. [2019-11-23 23:36:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-23 23:36:50,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:50,321 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:50,321 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:50,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:50,322 INFO L82 PathProgramCache]: Analyzing trace with hash -491403225, now seen corresponding path program 1 times [2019-11-23 23:36:50,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:50,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052820635] [2019-11-23 23:36:50,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:50,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052820635] [2019-11-23 23:36:50,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693637071] [2019-11-23 23:36:50,496 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:36:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:50,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:36:50,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:50,907 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:50,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:50,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:36:50,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367399101] [2019-11-23 23:36:50,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:50,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:50,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:50,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:50,965 INFO L87 Difference]: Start difference. First operand 31606 states and 39045 transitions. Second operand 3 states. [2019-11-23 23:36:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:52,040 INFO L93 Difference]: Finished difference Result 67930 states and 84034 transitions. [2019-11-23 23:36:52,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:52,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-11-23 23:36:52,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:52,111 INFO L225 Difference]: With dead ends: 67930 [2019-11-23 23:36:52,111 INFO L226 Difference]: Without dead ends: 36325 [2019-11-23 23:36:52,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36325 states. [2019-11-23 23:36:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36325 to 36039. [2019-11-23 23:36:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36039 states. [2019-11-23 23:36:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36039 states to 36039 states and 43504 transitions. [2019-11-23 23:36:53,624 INFO L78 Accepts]: Start accepts. Automaton has 36039 states and 43504 transitions. Word has length 213 [2019-11-23 23:36:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:53,625 INFO L462 AbstractCegarLoop]: Abstraction has 36039 states and 43504 transitions. [2019-11-23 23:36:53,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 36039 states and 43504 transitions. [2019-11-23 23:36:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-23 23:36:53,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:53,647 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, 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] [2019-11-23 23:36:53,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:53,859 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:53,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:53,860 INFO L82 PathProgramCache]: Analyzing trace with hash 745216681, now seen corresponding path program 1 times [2019-11-23 23:36:53,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:53,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309069913] [2019-11-23 23:36:53,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:54,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309069913] [2019-11-23 23:36:54,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:54,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:54,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197074908] [2019-11-23 23:36:54,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:54,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:54,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:54,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:54,059 INFO L87 Difference]: Start difference. First operand 36039 states and 43504 transitions. Second operand 4 states. [2019-11-23 23:36:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:55,512 INFO L93 Difference]: Finished difference Result 80085 states and 96755 transitions. [2019-11-23 23:36:55,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:55,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-11-23 23:36:55,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:55,593 INFO L225 Difference]: With dead ends: 80085 [2019-11-23 23:36:55,593 INFO L226 Difference]: Without dead ends: 44047 [2019-11-23 23:36:55,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 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:36:55,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44047 states. [2019-11-23 23:36:56,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44047 to 43332. [2019-11-23 23:36:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43332 states. [2019-11-23 23:36:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43332 states to 43332 states and 50948 transitions. [2019-11-23 23:36:56,423 INFO L78 Accepts]: Start accepts. Automaton has 43332 states and 50948 transitions. Word has length 254 [2019-11-23 23:36:56,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:56,424 INFO L462 AbstractCegarLoop]: Abstraction has 43332 states and 50948 transitions. [2019-11-23 23:36:56,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 43332 states and 50948 transitions. [2019-11-23 23:36:56,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-23 23:36:56,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:56,443 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-23 23:36:56,443 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:56,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:56,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1458388847, now seen corresponding path program 1 times [2019-11-23 23:36:56,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:56,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772785320] [2019-11-23 23:36:56,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:56,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772785320] [2019-11-23 23:36:56,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:56,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:56,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395618576] [2019-11-23 23:36:56,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:56,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:56,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:56,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:56,817 INFO L87 Difference]: Start difference. First operand 43332 states and 50948 transitions. Second operand 3 states. [2019-11-23 23:36:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:58,954 INFO L93 Difference]: Finished difference Result 97531 states and 114937 transitions. [2019-11-23 23:36:58,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:58,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-11-23 23:36:58,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:59,024 INFO L225 Difference]: With dead ends: 97531 [2019-11-23 23:36:59,024 INFO L226 Difference]: Without dead ends: 54200 [2019-11-23 23:36:59,051 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:36:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54200 states. [2019-11-23 23:36:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54200 to 48480. [2019-11-23 23:36:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48480 states. [2019-11-23 23:36:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48480 states to 48480 states and 57080 transitions. [2019-11-23 23:36:59,572 INFO L78 Accepts]: Start accepts. Automaton has 48480 states and 57080 transitions. Word has length 271 [2019-11-23 23:36:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:59,573 INFO L462 AbstractCegarLoop]: Abstraction has 48480 states and 57080 transitions. [2019-11-23 23:36:59,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:59,573 INFO L276 IsEmpty]: Start isEmpty. Operand 48480 states and 57080 transitions. [2019-11-23 23:36:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-11-23 23:36:59,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:59,591 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, 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, 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] [2019-11-23 23:36:59,591 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:59,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:59,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1527423419, now seen corresponding path program 1 times [2019-11-23 23:36:59,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:59,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015834534] [2019-11-23 23:36:59,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:36:59,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015834534] [2019-11-23 23:36:59,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986062747] [2019-11-23 23:36:59,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:59,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 23:36:59,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:37:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:37:00,179 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:37:00,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:37:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:37:00,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:37:00,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:37:00,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511199070] [2019-11-23 23:37:00,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:37:00,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:37:00,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:37:00,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:37:00,257 INFO L87 Difference]: Start difference. First operand 48480 states and 57080 transitions. Second operand 4 states. [2019-11-23 23:37:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:37:01,780 INFO L93 Difference]: Finished difference Result 147440 states and 173523 transitions. [2019-11-23 23:37:01,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:37:01,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-11-23 23:37:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:37:01,871 INFO L225 Difference]: With dead ends: 147440 [2019-11-23 23:37:01,871 INFO L226 Difference]: Without dead ends: 98961 [2019-11-23 23:37:01,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 600 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:37:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98961 states. [2019-11-23 23:37:02,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98961 to 95670. [2019-11-23 23:37:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95670 states. [2019-11-23 23:37:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95670 states to 95670 states and 112393 transitions. [2019-11-23 23:37:03,061 INFO L78 Accepts]: Start accepts. Automaton has 95670 states and 112393 transitions. Word has length 302 [2019-11-23 23:37:03,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:37:03,061 INFO L462 AbstractCegarLoop]: Abstraction has 95670 states and 112393 transitions. [2019-11-23 23:37:03,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:37:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 95670 states and 112393 transitions. [2019-11-23 23:37:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-23 23:37:03,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:37:03,076 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, 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, 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] [2019-11-23 23:37:03,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:37:03,280 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:37:03,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:37:03,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1768398502, now seen corresponding path program 1 times [2019-11-23 23:37:03,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:37:03,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847625752] [2019-11-23 23:37:03,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:37:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:37:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:37:03,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847625752] [2019-11-23 23:37:03,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:37:03,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:37:03,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660844603] [2019-11-23 23:37:03,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:37:03,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:37:03,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:37:03,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:37:03,428 INFO L87 Difference]: Start difference. First operand 95670 states and 112393 transitions. Second operand 5 states. [2019-11-23 23:37:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:37:06,052 INFO L93 Difference]: Finished difference Result 262412 states and 309916 transitions. [2019-11-23 23:37:06,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:37:06,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 305 [2019-11-23 23:37:06,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:37:06,211 INFO L225 Difference]: With dead ends: 262412 [2019-11-23 23:37:06,211 INFO L226 Difference]: Without dead ends: 166743 [2019-11-23 23:37:06,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:37:06,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166743 states. [2019-11-23 23:37:10,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166743 to 164882. [2019-11-23 23:37:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164882 states. [2019-11-23 23:37:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164882 states to 164882 states and 194608 transitions. [2019-11-23 23:37:10,176 INFO L78 Accepts]: Start accepts. Automaton has 164882 states and 194608 transitions. Word has length 305 [2019-11-23 23:37:10,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:37:10,176 INFO L462 AbstractCegarLoop]: Abstraction has 164882 states and 194608 transitions. [2019-11-23 23:37:10,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:37:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 164882 states and 194608 transitions. [2019-11-23 23:37:10,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-11-23 23:37:10,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:37:10,194 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, 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, 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:37:10,195 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:37:10,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:37:10,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1538255854, now seen corresponding path program 1 times [2019-11-23 23:37:10,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:37:10,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234114297] [2019-11-23 23:37:10,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:37:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:37:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:37:10,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234114297] [2019-11-23 23:37:10,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:37:10,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:37:10,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421990362] [2019-11-23 23:37:10,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:37:10,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:37:10,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:37:10,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:37:10,433 INFO L87 Difference]: Start difference. First operand 164882 states and 194608 transitions. Second operand 4 states. [2019-11-23 23:37:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:37:12,740 INFO L93 Difference]: Finished difference Result 333195 states and 393258 transitions. [2019-11-23 23:37:12,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:37:12,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 334 [2019-11-23 23:37:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:37:12,921 INFO L225 Difference]: With dead ends: 333195 [2019-11-23 23:37:12,921 INFO L226 Difference]: Without dead ends: 168314 [2019-11-23 23:37:13,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:37:13,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168314 states. [2019-11-23 23:37:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168314 to 166741. [2019-11-23 23:37:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166741 states. [2019-11-23 23:37:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166741 states to 166741 states and 196145 transitions. [2019-11-23 23:37:17,826 INFO L78 Accepts]: Start accepts. Automaton has 166741 states and 196145 transitions. Word has length 334 [2019-11-23 23:37:17,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:37:17,826 INFO L462 AbstractCegarLoop]: Abstraction has 166741 states and 196145 transitions. [2019-11-23 23:37:17,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:37:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 166741 states and 196145 transitions. [2019-11-23 23:37:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-11-23 23:37:17,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:37:17,848 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-23 23:37:17,848 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:37:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:37:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1326284943, now seen corresponding path program 1 times [2019-11-23 23:37:17,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:37:17,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332594201] [2019-11-23 23:37:17,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:37:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:37:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-23 23:37:18,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332594201] [2019-11-23 23:37:18,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:37:18,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:37:18,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898700333] [2019-11-23 23:37:18,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:37:18,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:37:18,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:37:18,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:37:18,013 INFO L87 Difference]: Start difference. First operand 166741 states and 196145 transitions. Second operand 4 states. [2019-11-23 23:37:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:37:20,851 INFO L93 Difference]: Finished difference Result 467617 states and 545640 transitions. [2019-11-23 23:37:20,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:37:20,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2019-11-23 23:37:20,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:37:21,160 INFO L225 Difference]: With dead ends: 467617 [2019-11-23 23:37:21,161 INFO L226 Difference]: Without dead ends: 300877 [2019-11-23 23:37:21,235 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:37:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300877 states. [2019-11-23 23:37:27,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300877 to 295298. [2019-11-23 23:37:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295298 states. [2019-11-23 23:37:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295298 states to 295298 states and 343263 transitions. [2019-11-23 23:37:27,868 INFO L78 Accepts]: Start accepts. Automaton has 295298 states and 343263 transitions. Word has length 339 [2019-11-23 23:37:27,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:37:27,868 INFO L462 AbstractCegarLoop]: Abstraction has 295298 states and 343263 transitions. [2019-11-23 23:37:27,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:37:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 295298 states and 343263 transitions. [2019-11-23 23:37:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-11-23 23:37:27,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:37:27,891 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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, 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, 1, 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:37:27,892 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:37:27,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:37:27,892 INFO L82 PathProgramCache]: Analyzing trace with hash 660276608, now seen corresponding path program 1 times [2019-11-23 23:37:27,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:37:27,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103266055] [2019-11-23 23:37:27,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:37:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:37:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 196 proven. 8 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:37:28,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103266055] [2019-11-23 23:37:28,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133994855] [2019-11-23 23:37:28,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:37:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:37:29,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 23:37:29,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:37:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-23 23:37:29,307 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:37:29,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:37:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-23 23:37:29,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1011860354] [2019-11-23 23:37:29,628 INFO L159 IcfgInterpreter]: Started Sifa with 145 locations of interest [2019-11-23 23:37:29,628 INFO L166 IcfgInterpreter]: Building call graph [2019-11-23 23:37:29,639 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-23 23:37:29,653 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-23 23:37:29,654 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-23 23:37:31,515 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 160 [2019-11-23 23:37:35,323 WARN L192 SmtUtils]: Spent 2.87 s on a formula simplification that was a NOOP. DAG size: 153