/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/product-lines/elevator_spec2_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:40:44,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:40:44,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:40:44,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:40:44,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:40:44,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:40:44,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:40:44,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:40:44,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:40:44,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:40:44,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:40:44,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:40:44,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:40:44,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:40:44,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:40:44,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:40:44,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:40:44,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:40:44,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:40:44,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:40:44,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:40:44,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:40:44,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:40:44,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:40:44,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:40:44,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:40:44,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:40:44,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:40:44,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:40:44,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:40:44,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:40:44,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:40:44,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:40:44,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:40:44,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:40:44,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:40:44,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:40:44,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:40:44,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:40:44,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:40:44,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:40:44,757 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 04:40:44,792 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:40:44,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:40:44,796 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:40:44,796 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:40:44,796 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:40:44,796 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:40:44,796 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:40:44,797 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:40:44,797 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:40:44,797 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:40:44,797 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:40:44,797 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:40:44,798 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:40:44,798 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:40:44,798 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:40:44,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:40:44,800 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:40:44,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:40:44,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:40:44,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:40:44,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:40:44,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:40:44,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:40:44,802 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:40:44,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:40:44,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:40:44,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:40:44,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:40:44,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:40:44,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:40:44,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:40:44,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:40:44,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:40:44,806 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:40:44,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:40:44,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:40:44,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:40:44,807 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:40:45,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:40:45,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:40:45,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:40:45,091 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:40:45,092 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:40:45,093 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product09.cil.c [2019-11-24 04:40:45,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca072c3c/8130a4df6ffd42bb822d8910afa9157b/FLAGdee75e619 [2019-11-24 04:40:45,687 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:40:45,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product09.cil.c [2019-11-24 04:40:45,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca072c3c/8130a4df6ffd42bb822d8910afa9157b/FLAGdee75e619 [2019-11-24 04:40:45,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca072c3c/8130a4df6ffd42bb822d8910afa9157b [2019-11-24 04:40:45,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:40:45,903 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:40:45,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:40:45,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:40:45,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:40:45,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:40:45" (1/1) ... [2019-11-24 04:40:45,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37480d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:45, skipping insertion in model container [2019-11-24 04:40:45,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:40:45" (1/1) ... [2019-11-24 04:40:45,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:40:46,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:40:46,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:40:46,739 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:40:46,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:40:46,954 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:40:46,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:46 WrapperNode [2019-11-24 04:40:46,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:40:46,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:40:46,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:40:46,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:40:46,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:46" (1/1) ... [2019-11-24 04:40:46,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:46" (1/1) ... [2019-11-24 04:40:47,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:40:47,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:40:47,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:40:47,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:40:47,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:46" (1/1) ... [2019-11-24 04:40:47,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:46" (1/1) ... [2019-11-24 04:40:47,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:46" (1/1) ... [2019-11-24 04:40:47,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:46" (1/1) ... [2019-11-24 04:40:47,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:46" (1/1) ... [2019-11-24 04:40:47,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:46" (1/1) ... [2019-11-24 04:40:47,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:46" (1/1) ... [2019-11-24 04:40:47,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:40:47,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:40:47,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:40:47,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:40:47,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:40:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:40:47,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:40:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:40:47,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:41:14,862 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:41:14,862 INFO L284 CfgBuilder]: Removed 505 assume(true) statements. [2019-11-24 04:41:14,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:41:14 BoogieIcfgContainer [2019-11-24 04:41:14,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:41:14,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:41:14,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:41:14,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:41:14,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:40:45" (1/3) ... [2019-11-24 04:41:14,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98049a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:41:14, skipping insertion in model container [2019-11-24 04:41:14,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:46" (2/3) ... [2019-11-24 04:41:14,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98049a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:41:14, skipping insertion in model container [2019-11-24 04:41:14,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:41:14" (3/3) ... [2019-11-24 04:41:14,873 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product09.cil.c [2019-11-24 04:41:14,882 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:41:14,891 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:41:14,903 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:41:14,937 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:41:14,937 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:41:14,937 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:41:14,937 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:41:14,938 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:41:14,938 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:41:14,938 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:41:14,938 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:41:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-11-24 04:41:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:41:14,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:14,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:14,983 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:14,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:14,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2025533065, now seen corresponding path program 1 times [2019-11-24 04:41:14,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:14,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178943160] [2019-11-24 04:41:15,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:15,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178943160] [2019-11-24 04:41:15,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:15,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:41:15,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712801813] [2019-11-24 04:41:15,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:41:15,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:15,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:41:15,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:41:15,502 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 2 states. [2019-11-24 04:41:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:15,592 INFO L93 Difference]: Finished difference Result 758 states and 1447 transitions. [2019-11-24 04:41:15,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:41:15,594 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-24 04:41:15,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:15,627 INFO L225 Difference]: With dead ends: 758 [2019-11-24 04:41:15,627 INFO L226 Difference]: Without dead ends: 739 [2019-11-24 04:41:15,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:41:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-11-24 04:41:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2019-11-24 04:41:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-11-24 04:41:15,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1417 transitions. [2019-11-24 04:41:15,760 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1417 transitions. Word has length 15 [2019-11-24 04:41:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:15,761 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 1417 transitions. [2019-11-24 04:41:15,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:41:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1417 transitions. [2019-11-24 04:41:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:41:15,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:15,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:15,765 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:15,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:15,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1651329360, now seen corresponding path program 1 times [2019-11-24 04:41:15,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:15,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014598117] [2019-11-24 04:41:15,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:16,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014598117] [2019-11-24 04:41:16,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:16,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:41:16,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880247675] [2019-11-24 04:41:16,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:41:16,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:16,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:41:16,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:41:16,120 INFO L87 Difference]: Start difference. First operand 739 states and 1417 transitions. Second operand 4 states. [2019-11-24 04:41:16,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:16,434 INFO L93 Difference]: Finished difference Result 1493 states and 2802 transitions. [2019-11-24 04:41:16,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:41:16,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 04:41:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:16,442 INFO L225 Difference]: With dead ends: 1493 [2019-11-24 04:41:16,442 INFO L226 Difference]: Without dead ends: 1100 [2019-11-24 04:41:16,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2019-11-24 04:41:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 743. [2019-11-24 04:41:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-11-24 04:41:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1421 transitions. [2019-11-24 04:41:16,476 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1421 transitions. Word has length 16 [2019-11-24 04:41:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:16,476 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1421 transitions. [2019-11-24 04:41:16,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:41:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1421 transitions. [2019-11-24 04:41:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:41:16,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:16,486 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:16,487 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:16,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1419425626, now seen corresponding path program 1 times [2019-11-24 04:41:16,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:16,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534535205] [2019-11-24 04:41:16,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:16,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534535205] [2019-11-24 04:41:16,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:16,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:16,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268336715] [2019-11-24 04:41:16,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:16,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:16,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:16,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:16,619 INFO L87 Difference]: Start difference. First operand 743 states and 1421 transitions. Second operand 3 states. [2019-11-24 04:41:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:16,852 INFO L93 Difference]: Finished difference Result 1329 states and 2534 transitions. [2019-11-24 04:41:16,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:16,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:41:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:16,861 INFO L225 Difference]: With dead ends: 1329 [2019-11-24 04:41:16,868 INFO L226 Difference]: Without dead ends: 937 [2019-11-24 04:41:16,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-11-24 04:41:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 900. [2019-11-24 04:41:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-11-24 04:41:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1717 transitions. [2019-11-24 04:41:16,903 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1717 transitions. Word has length 19 [2019-11-24 04:41:16,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:16,904 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1717 transitions. [2019-11-24 04:41:16,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1717 transitions. [2019-11-24 04:41:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:41:16,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:16,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:16,906 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:16,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1162180967, now seen corresponding path program 1 times [2019-11-24 04:41:16,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:16,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985317574] [2019-11-24 04:41:16,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:17,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985317574] [2019-11-24 04:41:17,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:17,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:17,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854742449] [2019-11-24 04:41:17,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:17,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:17,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:17,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:17,018 INFO L87 Difference]: Start difference. First operand 900 states and 1717 transitions. Second operand 3 states. [2019-11-24 04:41:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:17,277 INFO L93 Difference]: Finished difference Result 1849 states and 3520 transitions. [2019-11-24 04:41:17,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:17,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:41:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:17,286 INFO L225 Difference]: With dead ends: 1849 [2019-11-24 04:41:17,286 INFO L226 Difference]: Without dead ends: 1317 [2019-11-24 04:41:17,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2019-11-24 04:41:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1204. [2019-11-24 04:41:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-11-24 04:41:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 2291 transitions. [2019-11-24 04:41:17,337 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 2291 transitions. Word has length 21 [2019-11-24 04:41:17,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:17,337 INFO L462 AbstractCegarLoop]: Abstraction has 1204 states and 2291 transitions. [2019-11-24 04:41:17,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:17,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 2291 transitions. [2019-11-24 04:41:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:41:17,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:17,340 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] [2019-11-24 04:41:17,341 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:17,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:17,341 INFO L82 PathProgramCache]: Analyzing trace with hash 699571561, now seen corresponding path program 1 times [2019-11-24 04:41:17,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:17,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627724519] [2019-11-24 04:41:17,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:17,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627724519] [2019-11-24 04:41:17,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:17,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:17,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334359349] [2019-11-24 04:41:17,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:17,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:17,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:17,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:17,441 INFO L87 Difference]: Start difference. First operand 1204 states and 2291 transitions. Second operand 3 states. [2019-11-24 04:41:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:17,677 INFO L93 Difference]: Finished difference Result 2027 states and 3849 transitions. [2019-11-24 04:41:17,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:17,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 04:41:17,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:17,685 INFO L225 Difference]: With dead ends: 2027 [2019-11-24 04:41:17,686 INFO L226 Difference]: Without dead ends: 1194 [2019-11-24 04:41:17,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-11-24 04:41:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1194. [2019-11-24 04:41:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2019-11-24 04:41:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 2265 transitions. [2019-11-24 04:41:17,731 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 2265 transitions. Word has length 23 [2019-11-24 04:41:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:17,732 INFO L462 AbstractCegarLoop]: Abstraction has 1194 states and 2265 transitions. [2019-11-24 04:41:17,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 2265 transitions. [2019-11-24 04:41:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:41:17,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:17,734 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] [2019-11-24 04:41:17,734 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:17,735 INFO L82 PathProgramCache]: Analyzing trace with hash 124516717, now seen corresponding path program 1 times [2019-11-24 04:41:17,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:17,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822968874] [2019-11-24 04:41:17,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:17,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822968874] [2019-11-24 04:41:17,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:17,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:17,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990130212] [2019-11-24 04:41:17,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:17,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:17,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:17,847 INFO L87 Difference]: Start difference. First operand 1194 states and 2265 transitions. Second operand 3 states. [2019-11-24 04:41:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:18,132 INFO L93 Difference]: Finished difference Result 2732 states and 5171 transitions. [2019-11-24 04:41:18,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:18,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 04:41:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:18,144 INFO L225 Difference]: With dead ends: 2732 [2019-11-24 04:41:18,145 INFO L226 Difference]: Without dead ends: 1926 [2019-11-24 04:41:18,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-11-24 04:41:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1774. [2019-11-24 04:41:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1774 states. [2019-11-24 04:41:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 3350 transitions. [2019-11-24 04:41:18,232 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 3350 transitions. Word has length 24 [2019-11-24 04:41:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:18,232 INFO L462 AbstractCegarLoop]: Abstraction has 1774 states and 3350 transitions. [2019-11-24 04:41:18,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 3350 transitions. [2019-11-24 04:41:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:41:18,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:18,234 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] [2019-11-24 04:41:18,234 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:18,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash -434931862, now seen corresponding path program 1 times [2019-11-24 04:41:18,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:18,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914401697] [2019-11-24 04:41:18,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:18,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914401697] [2019-11-24 04:41:18,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:18,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:18,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056671824] [2019-11-24 04:41:18,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:18,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:18,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:18,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:18,312 INFO L87 Difference]: Start difference. First operand 1774 states and 3350 transitions. Second operand 3 states. [2019-11-24 04:41:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:18,523 INFO L93 Difference]: Finished difference Result 1774 states and 3350 transitions. [2019-11-24 04:41:18,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:18,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 04:41:18,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:18,533 INFO L225 Difference]: With dead ends: 1774 [2019-11-24 04:41:18,534 INFO L226 Difference]: Without dead ends: 1767 [2019-11-24 04:41:18,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-11-24 04:41:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2019-11-24 04:41:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2019-11-24 04:41:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 3338 transitions. [2019-11-24 04:41:18,626 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 3338 transitions. Word has length 25 [2019-11-24 04:41:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:18,627 INFO L462 AbstractCegarLoop]: Abstraction has 1767 states and 3338 transitions. [2019-11-24 04:41:18,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 3338 transitions. [2019-11-24 04:41:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 04:41:18,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:18,631 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] [2019-11-24 04:41:18,631 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:18,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:18,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1363381314, now seen corresponding path program 1 times [2019-11-24 04:41:18,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:18,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980815012] [2019-11-24 04:41:18,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:18,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980815012] [2019-11-24 04:41:18,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:18,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:41:18,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985062221] [2019-11-24 04:41:18,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:41:18,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:18,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:41:18,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:41:18,882 INFO L87 Difference]: Start difference. First operand 1767 states and 3338 transitions. Second operand 4 states. [2019-11-24 04:41:19,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:19,953 INFO L93 Difference]: Finished difference Result 3471 states and 6543 transitions. [2019-11-24 04:41:19,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:41:19,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-24 04:41:19,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:19,963 INFO L225 Difference]: With dead ends: 3471 [2019-11-24 04:41:19,964 INFO L226 Difference]: Without dead ends: 1912 [2019-11-24 04:41:19,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2019-11-24 04:41:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1767. [2019-11-24 04:41:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2019-11-24 04:41:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 3288 transitions. [2019-11-24 04:41:20,093 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 3288 transitions. Word has length 31 [2019-11-24 04:41:20,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:20,094 INFO L462 AbstractCegarLoop]: Abstraction has 1767 states and 3288 transitions. [2019-11-24 04:41:20,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:41:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 3288 transitions. [2019-11-24 04:41:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:41:20,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:20,097 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] [2019-11-24 04:41:20,097 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:20,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:20,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1053317603, now seen corresponding path program 1 times [2019-11-24 04:41:20,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:20,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293570613] [2019-11-24 04:41:20,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:20,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:20,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293570613] [2019-11-24 04:41:20,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:20,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:20,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271646024] [2019-11-24 04:41:20,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:20,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:20,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:20,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:20,275 INFO L87 Difference]: Start difference. First operand 1767 states and 3288 transitions. Second operand 3 states. [2019-11-24 04:41:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:21,275 INFO L93 Difference]: Finished difference Result 4473 states and 8316 transitions. [2019-11-24 04:41:21,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:21,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 04:41:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:21,291 INFO L225 Difference]: With dead ends: 4473 [2019-11-24 04:41:21,291 INFO L226 Difference]: Without dead ends: 2935 [2019-11-24 04:41:21,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:21,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2019-11-24 04:41:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1737. [2019-11-24 04:41:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2019-11-24 04:41:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 3208 transitions. [2019-11-24 04:41:21,379 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 3208 transitions. Word has length 36 [2019-11-24 04:41:21,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:21,380 INFO L462 AbstractCegarLoop]: Abstraction has 1737 states and 3208 transitions. [2019-11-24 04:41:21,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 3208 transitions. [2019-11-24 04:41:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:41:21,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:21,382 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] [2019-11-24 04:41:21,382 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:21,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:21,383 INFO L82 PathProgramCache]: Analyzing trace with hash 439123901, now seen corresponding path program 1 times [2019-11-24 04:41:21,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:21,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307223454] [2019-11-24 04:41:21,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:21,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307223454] [2019-11-24 04:41:21,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:21,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:21,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375848752] [2019-11-24 04:41:21,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:21,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:21,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:21,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:21,599 INFO L87 Difference]: Start difference. First operand 1737 states and 3208 transitions. Second operand 3 states. [2019-11-24 04:41:22,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:22,462 INFO L93 Difference]: Finished difference Result 4394 states and 8137 transitions. [2019-11-24 04:41:22,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:22,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:41:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:22,479 INFO L225 Difference]: With dead ends: 4394 [2019-11-24 04:41:22,479 INFO L226 Difference]: Without dead ends: 2913 [2019-11-24 04:41:22,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2019-11-24 04:41:22,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1717. [2019-11-24 04:41:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-11-24 04:41:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 3138 transitions. [2019-11-24 04:41:22,572 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 3138 transitions. Word has length 37 [2019-11-24 04:41:22,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:22,572 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 3138 transitions. [2019-11-24 04:41:22,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 3138 transitions. [2019-11-24 04:41:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:41:22,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:22,575 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] [2019-11-24 04:41:22,575 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:22,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:22,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1627570664, now seen corresponding path program 1 times [2019-11-24 04:41:22,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:22,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551889030] [2019-11-24 04:41:22,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:22,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551889030] [2019-11-24 04:41:22,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:22,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:22,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675517502] [2019-11-24 04:41:22,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:22,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:22,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:22,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:22,768 INFO L87 Difference]: Start difference. First operand 1717 states and 3138 transitions. Second operand 3 states. [2019-11-24 04:41:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:23,677 INFO L93 Difference]: Finished difference Result 4330 states and 7973 transitions. [2019-11-24 04:41:23,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:23,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 04:41:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:23,690 INFO L225 Difference]: With dead ends: 4330 [2019-11-24 04:41:23,690 INFO L226 Difference]: Without dead ends: 2901 [2019-11-24 04:41:23,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:23,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2019-11-24 04:41:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1707. [2019-11-24 04:41:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-24 04:41:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 3078 transitions. [2019-11-24 04:41:23,775 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 3078 transitions. Word has length 39 [2019-11-24 04:41:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:23,776 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 3078 transitions. [2019-11-24 04:41:23,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 3078 transitions. [2019-11-24 04:41:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 04:41:23,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:23,778 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] [2019-11-24 04:41:23,778 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:23,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1476810929, now seen corresponding path program 1 times [2019-11-24 04:41:23,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:23,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561793020] [2019-11-24 04:41:23,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:23,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561793020] [2019-11-24 04:41:23,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:23,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:23,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435133566] [2019-11-24 04:41:23,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:23,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:23,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:23,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:23,971 INFO L87 Difference]: Start difference. First operand 1707 states and 3078 transitions. Second operand 3 states. [2019-11-24 04:41:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:24,659 INFO L93 Difference]: Finished difference Result 3234 states and 5866 transitions. [2019-11-24 04:41:24,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:24,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-24 04:41:24,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:24,668 INFO L225 Difference]: With dead ends: 3234 [2019-11-24 04:41:24,668 INFO L226 Difference]: Without dead ends: 1852 [2019-11-24 04:41:24,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2019-11-24 04:41:24,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1707. [2019-11-24 04:41:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-24 04:41:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 3028 transitions. [2019-11-24 04:41:24,749 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 3028 transitions. Word has length 42 [2019-11-24 04:41:24,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:24,750 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 3028 transitions. [2019-11-24 04:41:24,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 3028 transitions. [2019-11-24 04:41:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:41:24,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:24,752 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] [2019-11-24 04:41:24,752 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:24,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:24,753 INFO L82 PathProgramCache]: Analyzing trace with hash 828903749, now seen corresponding path program 1 times [2019-11-24 04:41:24,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:24,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042812038] [2019-11-24 04:41:24,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:24,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042812038] [2019-11-24 04:41:24,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:24,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:41:24,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986376934] [2019-11-24 04:41:24,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:24,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:24,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:24,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:24,979 INFO L87 Difference]: Start difference. First operand 1707 states and 3028 transitions. Second operand 5 states. [2019-11-24 04:41:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:26,035 INFO L93 Difference]: Finished difference Result 6580 states and 12004 transitions. [2019-11-24 04:41:26,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:41:26,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-24 04:41:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:26,050 INFO L225 Difference]: With dead ends: 6580 [2019-11-24 04:41:26,050 INFO L226 Difference]: Without dead ends: 4889 [2019-11-24 04:41:26,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:41:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4889 states. [2019-11-24 04:41:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4889 to 2067. [2019-11-24 04:41:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2067 states. [2019-11-24 04:41:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 3545 transitions. [2019-11-24 04:41:26,196 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 3545 transitions. Word has length 45 [2019-11-24 04:41:26,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:26,196 INFO L462 AbstractCegarLoop]: Abstraction has 2067 states and 3545 transitions. [2019-11-24 04:41:26,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:26,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 3545 transitions. [2019-11-24 04:41:26,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:41:26,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:26,198 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] [2019-11-24 04:41:26,199 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:26,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:26,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1100572825, now seen corresponding path program 1 times [2019-11-24 04:41:26,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:26,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567658726] [2019-11-24 04:41:26,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:26,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567658726] [2019-11-24 04:41:26,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:26,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:41:26,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578291812] [2019-11-24 04:41:26,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:26,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:26,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:26,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:26,463 INFO L87 Difference]: Start difference. First operand 2067 states and 3545 transitions. Second operand 5 states. [2019-11-24 04:41:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:26,812 INFO L93 Difference]: Finished difference Result 3121 states and 5185 transitions. [2019-11-24 04:41:26,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:41:26,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-24 04:41:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:26,832 INFO L225 Difference]: With dead ends: 3121 [2019-11-24 04:41:26,833 INFO L226 Difference]: Without dead ends: 3103 [2019-11-24 04:41:26,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:26,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2019-11-24 04:41:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 2081. [2019-11-24 04:41:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-11-24 04:41:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3559 transitions. [2019-11-24 04:41:26,958 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3559 transitions. Word has length 46 [2019-11-24 04:41:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:26,959 INFO L462 AbstractCegarLoop]: Abstraction has 2081 states and 3559 transitions. [2019-11-24 04:41:26,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3559 transitions. [2019-11-24 04:41:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:41:26,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:26,961 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] [2019-11-24 04:41:26,961 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:26,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash 987182293, now seen corresponding path program 1 times [2019-11-24 04:41:26,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:26,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036401238] [2019-11-24 04:41:26,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:27,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036401238] [2019-11-24 04:41:27,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:27,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:27,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016113685] [2019-11-24 04:41:27,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:27,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:27,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:27,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:27,152 INFO L87 Difference]: Start difference. First operand 2081 states and 3559 transitions. Second operand 3 states. [2019-11-24 04:41:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:27,257 INFO L93 Difference]: Finished difference Result 2103 states and 3582 transitions. [2019-11-24 04:41:27,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:27,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-24 04:41:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:27,262 INFO L225 Difference]: With dead ends: 2103 [2019-11-24 04:41:27,262 INFO L226 Difference]: Without dead ends: 2085 [2019-11-24 04:41:27,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2019-11-24 04:41:27,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2081. [2019-11-24 04:41:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-11-24 04:41:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3545 transitions. [2019-11-24 04:41:27,418 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3545 transitions. Word has length 47 [2019-11-24 04:41:27,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:27,418 INFO L462 AbstractCegarLoop]: Abstraction has 2081 states and 3545 transitions. [2019-11-24 04:41:27,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:27,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3545 transitions. [2019-11-24 04:41:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:41:27,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:27,420 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] [2019-11-24 04:41:27,420 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:27,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:27,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1315973528, now seen corresponding path program 1 times [2019-11-24 04:41:27,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:27,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598709940] [2019-11-24 04:41:27,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:28,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598709940] [2019-11-24 04:41:28,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:28,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:41:28,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343698917] [2019-11-24 04:41:28,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:41:28,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:28,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:41:28,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:41:28,054 INFO L87 Difference]: Start difference. First operand 2081 states and 3545 transitions. Second operand 21 states. [2019-11-24 04:41:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:31,197 INFO L93 Difference]: Finished difference Result 6223 states and 10829 transitions. [2019-11-24 04:41:31,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:31,198 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2019-11-24 04:41:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:31,206 INFO L225 Difference]: With dead ends: 6223 [2019-11-24 04:41:31,207 INFO L226 Difference]: Without dead ends: 4284 [2019-11-24 04:41:31,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2019-11-24 04:41:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2019-11-24 04:41:31,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 2035. [2019-11-24 04:41:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-11-24 04:41:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 3432 transitions. [2019-11-24 04:41:31,434 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 3432 transitions. Word has length 48 [2019-11-24 04:41:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:31,434 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 3432 transitions. [2019-11-24 04:41:31,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:41:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3432 transitions. [2019-11-24 04:41:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 04:41:31,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:31,436 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] [2019-11-24 04:41:31,436 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:31,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:31,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1560180586, now seen corresponding path program 1 times [2019-11-24 04:41:31,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:31,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380476753] [2019-11-24 04:41:31,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:32,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380476753] [2019-11-24 04:41:32,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:32,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:41:32,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796806972] [2019-11-24 04:41:32,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:41:32,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:32,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:41:32,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:41:32,166 INFO L87 Difference]: Start difference. First operand 2035 states and 3432 transitions. Second operand 21 states. [2019-11-24 04:41:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:33,872 INFO L93 Difference]: Finished difference Result 6302 states and 10818 transitions. [2019-11-24 04:41:33,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:33,873 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2019-11-24 04:41:33,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:33,882 INFO L225 Difference]: With dead ends: 6302 [2019-11-24 04:41:33,882 INFO L226 Difference]: Without dead ends: 4393 [2019-11-24 04:41:33,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2019-11-24 04:41:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2019-11-24 04:41:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 2203. [2019-11-24 04:41:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2203 states. [2019-11-24 04:41:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 3662 transitions. [2019-11-24 04:41:34,103 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 3662 transitions. Word has length 50 [2019-11-24 04:41:34,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:34,103 INFO L462 AbstractCegarLoop]: Abstraction has 2203 states and 3662 transitions. [2019-11-24 04:41:34,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:41:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 3662 transitions. [2019-11-24 04:41:34,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 04:41:34,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:34,105 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] [2019-11-24 04:41:34,106 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:34,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:34,106 INFO L82 PathProgramCache]: Analyzing trace with hash 390506899, now seen corresponding path program 1 times [2019-11-24 04:41:34,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:34,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300774946] [2019-11-24 04:41:34,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:34,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300774946] [2019-11-24 04:41:34,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:34,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:41:34,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398924941] [2019-11-24 04:41:34,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:41:34,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:34,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:41:34,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:41:34,729 INFO L87 Difference]: Start difference. First operand 2203 states and 3662 transitions. Second operand 21 states. [2019-11-24 04:41:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:38,097 INFO L93 Difference]: Finished difference Result 6253 states and 10449 transitions. [2019-11-24 04:41:38,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:38,098 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2019-11-24 04:41:38,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:38,104 INFO L225 Difference]: With dead ends: 6253 [2019-11-24 04:41:38,104 INFO L226 Difference]: Without dead ends: 4173 [2019-11-24 04:41:38,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2019-11-24 04:41:38,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2019-11-24 04:41:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 2585. [2019-11-24 04:41:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2585 states. [2019-11-24 04:41:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 4248 transitions. [2019-11-24 04:41:38,416 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 4248 transitions. Word has length 52 [2019-11-24 04:41:38,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:38,416 INFO L462 AbstractCegarLoop]: Abstraction has 2585 states and 4248 transitions. [2019-11-24 04:41:38,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:41:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 4248 transitions. [2019-11-24 04:41:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 04:41:38,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:38,419 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:41:38,419 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:38,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:38,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1890549915, now seen corresponding path program 1 times [2019-11-24 04:41:38,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:38,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871243149] [2019-11-24 04:41:38,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:38,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871243149] [2019-11-24 04:41:38,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:38,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:41:38,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989135787] [2019-11-24 04:41:38,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:38,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:38,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:38,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:38,630 INFO L87 Difference]: Start difference. First operand 2585 states and 4248 transitions. Second operand 5 states. [2019-11-24 04:41:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:39,413 INFO L93 Difference]: Finished difference Result 6558 states and 11083 transitions. [2019-11-24 04:41:39,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:41:39,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-24 04:41:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:39,418 INFO L225 Difference]: With dead ends: 6558 [2019-11-24 04:41:39,418 INFO L226 Difference]: Without dead ends: 4190 [2019-11-24 04:41:39,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2019-11-24 04:41:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 2667. [2019-11-24 04:41:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2019-11-24 04:41:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 4330 transitions. [2019-11-24 04:41:39,623 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 4330 transitions. Word has length 66 [2019-11-24 04:41:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:39,623 INFO L462 AbstractCegarLoop]: Abstraction has 2667 states and 4330 transitions. [2019-11-24 04:41:39,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4330 transitions. [2019-11-24 04:41:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 04:41:39,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:39,626 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:41:39,626 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:39,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:39,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1662509742, now seen corresponding path program 1 times [2019-11-24 04:41:39,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:39,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976229581] [2019-11-24 04:41:39,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:39,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976229581] [2019-11-24 04:41:39,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:39,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:41:39,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702753307] [2019-11-24 04:41:39,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:41:39,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:39,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:41:39,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:39,764 INFO L87 Difference]: Start difference. First operand 2667 states and 4330 transitions. Second operand 6 states. [2019-11-24 04:41:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:40,745 INFO L93 Difference]: Finished difference Result 6640 states and 11125 transitions. [2019-11-24 04:41:40,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:41:40,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-24 04:41:40,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:40,751 INFO L225 Difference]: With dead ends: 6640 [2019-11-24 04:41:40,751 INFO L226 Difference]: Without dead ends: 4190 [2019-11-24 04:41:40,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:41:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2019-11-24 04:41:41,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 2667. [2019-11-24 04:41:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2019-11-24 04:41:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 4290 transitions. [2019-11-24 04:41:41,111 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 4290 transitions. Word has length 67 [2019-11-24 04:41:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:41,112 INFO L462 AbstractCegarLoop]: Abstraction has 2667 states and 4290 transitions. [2019-11-24 04:41:41,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:41:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4290 transitions. [2019-11-24 04:41:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 04:41:41,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:41,114 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:41:41,114 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:41,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:41,115 INFO L82 PathProgramCache]: Analyzing trace with hash 317540160, now seen corresponding path program 1 times [2019-11-24 04:41:41,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:41,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055182581] [2019-11-24 04:41:41,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:41,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055182581] [2019-11-24 04:41:41,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:41,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:41:41,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730707459] [2019-11-24 04:41:41,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:41,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:41,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:41,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:41,298 INFO L87 Difference]: Start difference. First operand 2667 states and 4290 transitions. Second operand 5 states. [2019-11-24 04:41:42,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:42,164 INFO L93 Difference]: Finished difference Result 6704 states and 11131 transitions. [2019-11-24 04:41:42,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:41:42,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-24 04:41:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:42,170 INFO L225 Difference]: With dead ends: 6704 [2019-11-24 04:41:42,170 INFO L226 Difference]: Without dead ends: 4254 [2019-11-24 04:41:42,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:42,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4254 states. [2019-11-24 04:41:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4254 to 2642. [2019-11-24 04:41:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2642 states. [2019-11-24 04:41:42,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 4238 transitions. [2019-11-24 04:41:42,591 INFO L78 Accepts]: Start accepts. Automaton has 2642 states and 4238 transitions. Word has length 68 [2019-11-24 04:41:42,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:42,592 INFO L462 AbstractCegarLoop]: Abstraction has 2642 states and 4238 transitions. [2019-11-24 04:41:42,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:42,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 4238 transitions. [2019-11-24 04:41:42,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-24 04:41:42,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:42,594 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:41:42,594 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:42,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:42,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1476236492, now seen corresponding path program 1 times [2019-11-24 04:41:42,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:42,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012856524] [2019-11-24 04:41:42,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:42,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012856524] [2019-11-24 04:41:42,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:42,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:41:42,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375177414] [2019-11-24 04:41:42,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:41:42,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:41:42,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:42,793 INFO L87 Difference]: Start difference. First operand 2642 states and 4238 transitions. Second operand 6 states. [2019-11-24 04:41:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:44,480 INFO L93 Difference]: Finished difference Result 8608 states and 14125 transitions. [2019-11-24 04:41:44,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:44,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-24 04:41:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:44,489 INFO L225 Difference]: With dead ends: 8608 [2019-11-24 04:41:44,489 INFO L226 Difference]: Without dead ends: 6183 [2019-11-24 04:41:44,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-24 04:41:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6183 states. [2019-11-24 04:41:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6183 to 3050. [2019-11-24 04:41:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3050 states. [2019-11-24 04:41:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 4924 transitions. [2019-11-24 04:41:44,885 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 4924 transitions. Word has length 71 [2019-11-24 04:41:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:44,885 INFO L462 AbstractCegarLoop]: Abstraction has 3050 states and 4924 transitions. [2019-11-24 04:41:44,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:41:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 4924 transitions. [2019-11-24 04:41:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-24 04:41:44,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:44,887 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:41:44,887 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:44,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:44,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1408491825, now seen corresponding path program 1 times [2019-11-24 04:41:44,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:44,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048288801] [2019-11-24 04:41:44,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:45,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048288801] [2019-11-24 04:41:45,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:45,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:41:45,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444081791] [2019-11-24 04:41:45,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:45,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:45,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:45,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:45,192 INFO L87 Difference]: Start difference. First operand 3050 states and 4924 transitions. Second operand 5 states. [2019-11-24 04:41:46,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:46,361 INFO L93 Difference]: Finished difference Result 7924 states and 12715 transitions. [2019-11-24 04:41:46,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:41:46,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-24 04:41:46,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:46,366 INFO L225 Difference]: With dead ends: 7924 [2019-11-24 04:41:46,366 INFO L226 Difference]: Without dead ends: 5091 [2019-11-24 04:41:46,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:46,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2019-11-24 04:41:46,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 4353. [2019-11-24 04:41:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4353 states. [2019-11-24 04:41:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4353 states to 4353 states and 6731 transitions. [2019-11-24 04:41:46,742 INFO L78 Accepts]: Start accepts. Automaton has 4353 states and 6731 transitions. Word has length 71 [2019-11-24 04:41:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:46,742 INFO L462 AbstractCegarLoop]: Abstraction has 4353 states and 6731 transitions. [2019-11-24 04:41:46,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 4353 states and 6731 transitions. [2019-11-24 04:41:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-24 04:41:46,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:46,745 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:41:46,745 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:46,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:46,745 INFO L82 PathProgramCache]: Analyzing trace with hash -722025791, now seen corresponding path program 1 times [2019-11-24 04:41:46,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:46,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161530592] [2019-11-24 04:41:46,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:46,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161530592] [2019-11-24 04:41:46,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:46,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:41:46,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249666326] [2019-11-24 04:41:46,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:46,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:46,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:46,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:46,933 INFO L87 Difference]: Start difference. First operand 4353 states and 6731 transitions. Second operand 5 states. [2019-11-24 04:41:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:48,127 INFO L93 Difference]: Finished difference Result 10728 states and 17100 transitions. [2019-11-24 04:41:48,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:41:48,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-24 04:41:48,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:48,135 INFO L225 Difference]: With dead ends: 10728 [2019-11-24 04:41:48,135 INFO L226 Difference]: Without dead ends: 6598 [2019-11-24 04:41:48,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:48,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6598 states. [2019-11-24 04:41:48,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6598 to 4321. [2019-11-24 04:41:48,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-11-24 04:41:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 6645 transitions. [2019-11-24 04:41:48,620 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 6645 transitions. Word has length 71 [2019-11-24 04:41:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:48,620 INFO L462 AbstractCegarLoop]: Abstraction has 4321 states and 6645 transitions. [2019-11-24 04:41:48,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 6645 transitions. [2019-11-24 04:41:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 04:41:48,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:48,622 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:41:48,622 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:48,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:48,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1527575318, now seen corresponding path program 1 times [2019-11-24 04:41:48,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:48,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173448818] [2019-11-24 04:41:48,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:49,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173448818] [2019-11-24 04:41:49,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264074726] [2019-11-24 04:41:49,648 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-24 04:41:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:50,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 04:41:50,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:41:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:50,248 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:41:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:50,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1861063548] [2019-11-24 04:41:50,411 INFO L159 IcfgInterpreter]: Started Sifa with 71 locations of interest [2019-11-24 04:41:50,412 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:41:50,419 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:41:50,426 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:41:50,426 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs