/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_product27.cil.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.24-6598664
[2019-11-24 04:42:16,677 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-11-24 04:42:16,681 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-11-24 04:42:16,699 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-11-24 04:42:16,699 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-11-24 04:42:16,701 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-11-24 04:42:16,703 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-11-24 04:42:16,713 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-11-24 04:42:16,716 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-11-24 04:42:16,719 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-11-24 04:42:16,721 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-11-24 04:42:16,722 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-11-24 04:42:16,722 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-11-24 04:42:16,723 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-11-24 04:42:16,724 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-11-24 04:42:16,725 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-11-24 04:42:16,725 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-11-24 04:42:16,726 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-11-24 04:42:16,727 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-11-24 04:42:16,729 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-11-24 04:42:16,730 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-11-24 04:42:16,731 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-11-24 04:42:16,732 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-11-24 04:42:16,733 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-11-24 04:42:16,735 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-11-24 04:42:16,735 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-11-24 04:42:16,736 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-11-24 04:42:16,736 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-11-24 04:42:16,737 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-11-24 04:42:16,738 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-11-24 04:42:16,738 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-11-24 04:42:16,739 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-11-24 04:42:16,739 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-11-24 04:42:16,740 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-11-24 04:42:16,741 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-11-24 04:42:16,741 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-11-24 04:42:16,742 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-11-24 04:42:16,742 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-11-24 04:42:16,742 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-11-24 04:42:16,743 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-11-24 04:42:16,744 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-11-24 04:42:16,745 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:42:16,759 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-11-24 04:42:16,759 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-11-24 04:42:16,760 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2019-11-24 04:42:16,760 INFO  L138        SettingsManager]:  * User list type=DISABLED
[2019-11-24 04:42:16,761 INFO  L136        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2019-11-24 04:42:16,761 INFO  L138        SettingsManager]:  * Explicit value domain=true
[2019-11-24 04:42:16,761 INFO  L138        SettingsManager]:  * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2019-11-24 04:42:16,761 INFO  L138        SettingsManager]:  * Octagon Domain=false
[2019-11-24 04:42:16,761 INFO  L138        SettingsManager]:  * Abstract domain=CompoundDomain
[2019-11-24 04:42:16,762 INFO  L138        SettingsManager]:  * Check feasibility of abstract posts with an SMT solver=true
[2019-11-24 04:42:16,762 INFO  L138        SettingsManager]:  * Use the RCFG-of-the-future interface=true
[2019-11-24 04:42:16,762 INFO  L138        SettingsManager]:  * Interval Domain=false
[2019-11-24 04:42:16,762 INFO  L136        SettingsManager]: Preferences of Sifa differ from their defaults:
[2019-11-24 04:42:16,762 INFO  L138        SettingsManager]:  * Call Summarizer=TopInputCallSummarizer
[2019-11-24 04:42:16,763 INFO  L138        SettingsManager]:  * Simplification Technique=SIMPLIFY_QUICK
[2019-11-24 04:42:16,763 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-11-24 04:42:16,764 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-11-24 04:42:16,764 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-11-24 04:42:16,764 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-11-24 04:42:16,765 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-11-24 04:42:16,765 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-11-24 04:42:16,765 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-11-24 04:42:16,765 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-11-24 04:42:16,765 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-11-24 04:42:16,766 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-11-24 04:42:16,766 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-11-24 04:42:16,766 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-11-24 04:42:16,766 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-11-24 04:42:16,767 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-11-24 04:42:16,767 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-11-24 04:42:16,767 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-11-24 04:42:16,767 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-11-24 04:42:16,767 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-11-24 04:42:16,768 INFO  L138        SettingsManager]:  * Trace refinement strategy=SIFA_TAIPAN
[2019-11-24 04:42:16,768 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-11-24 04:42:16,768 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-11-24 04:42:16,768 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-11-24 04:42:16,768 INFO  L138        SettingsManager]:  * Abstract interpretation Mode=USE_PREDICATES
[2019-11-24 04:42:17,049 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-11-24 04:42:17,066 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-11-24 04:42:17,071 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-11-24 04:42:17,072 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-11-24 04:42:17,073 INFO  L275        PluginConnector]: CDTParser initialized
[2019-11-24 04:42:17,073 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product27.cil.c
[2019-11-24 04:42:17,146 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f485c358/56485b4e218e42fa956ab6f9c9afce9c/FLAG05379bccc
[2019-11-24 04:42:17,817 INFO  L306              CDTParser]: Found 1 translation units.
[2019-11-24 04:42:17,818 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product27.cil.c
[2019-11-24 04:42:17,849 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f485c358/56485b4e218e42fa956ab6f9c9afce9c/FLAG05379bccc
[2019-11-24 04:42:18,064 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f485c358/56485b4e218e42fa956ab6f9c9afce9c
[2019-11-24 04:42:18,073 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-11-24 04:42:18,075 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2019-11-24 04:42:18,076 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-11-24 04:42:18,076 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-11-24 04:42:18,082 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-11-24 04:42:18,084 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:42:18" (1/1) ...
[2019-11-24 04:42:18,087 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75eb1762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:18, skipping insertion in model container
[2019-11-24 04:42:18,087 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:42:18" (1/1) ...
[2019-11-24 04:42:18,096 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2019-11-24 04:42:18,167 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2019-11-24 04:42:18,860 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-11-24 04:42:18,885 INFO  L203         MainTranslator]: Completed pre-run
[2019-11-24 04:42:19,025 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-11-24 04:42:19,088 INFO  L208         MainTranslator]: Completed translation
[2019-11-24 04:42:19,089 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:19 WrapperNode
[2019-11-24 04:42:19,089 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-11-24 04:42:19,090 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-11-24 04:42:19,090 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-11-24 04:42:19,090 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2019-11-24 04:42:19,099 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:42:19" (1/1) ...
[2019-11-24 04:42:19,129 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:42:19" (1/1) ...
[2019-11-24 04:42:19,311 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-11-24 04:42:19,312 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-11-24 04:42:19,312 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-11-24 04:42:19,312 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-11-24 04:42:19,322 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:19" (1/1) ...
[2019-11-24 04:42:19,323 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:19" (1/1) ...
[2019-11-24 04:42:19,342 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:19" (1/1) ...
[2019-11-24 04:42:19,343 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:19" (1/1) ...
[2019-11-24 04:42:19,425 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:19" (1/1) ...
[2019-11-24 04:42:19,537 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:19" (1/1) ...
[2019-11-24 04:42:19,557 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:19" (1/1) ...
[2019-11-24 04:42:19,588 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-11-24 04:42:19,589 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-11-24 04:42:19,589 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-11-24 04:42:19,589 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-11-24 04:42:19,590 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:19" (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:42:19,662 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2019-11-24 04:42:19,664 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2019-11-24 04:42:19,665 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-11-24 04:42:19,665 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-11-24 04:42:51,344 INFO  L279             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-11-24 04:42:51,344 INFO  L284             CfgBuilder]: Removed 661 assume(true) statements.
[2019-11-24 04:42:51,346 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:42:51 BoogieIcfgContainer
[2019-11-24 04:42:51,346 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-11-24 04:42:51,347 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-11-24 04:42:51,347 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-11-24 04:42:51,350 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-11-24 04:42:51,350 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:42:18" (1/3) ...
[2019-11-24 04:42:51,351 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2881bc57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:42:51, skipping insertion in model container
[2019-11-24 04:42:51,351 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:19" (2/3) ...
[2019-11-24 04:42:51,352 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2881bc57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:42:51, skipping insertion in model container
[2019-11-24 04:42:51,352 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:42:51" (3/3) ...
[2019-11-24 04:42:51,354 INFO  L109   eAbstractionObserver]: Analyzing ICFG elevator_spec2_product27.cil.c
[2019-11-24 04:42:51,362 INFO  L153   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-11-24 04:42:51,369 INFO  L165   ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations.
[2019-11-24 04:42:51,379 INFO  L249      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2019-11-24 04:42:51,411 INFO  L373      AbstractCegarLoop]: Interprodecural is true
[2019-11-24 04:42:51,411 INFO  L374      AbstractCegarLoop]: Hoare is true
[2019-11-24 04:42:51,411 INFO  L375      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-11-24 04:42:51,412 INFO  L376      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-11-24 04:42:51,412 INFO  L377      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-11-24 04:42:51,412 INFO  L378      AbstractCegarLoop]: Difference is false
[2019-11-24 04:42:51,412 INFO  L379      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-11-24 04:42:51,412 INFO  L383      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-11-24 04:42:51,443 INFO  L276                IsEmpty]: Start isEmpty. Operand 749 states.
[2019-11-24 04:42:51,454 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2019-11-24 04:42:51,454 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:42:51,456 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-24 04:42:51,456 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:42:51,462 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:42:51,463 INFO  L82        PathProgramCache]: Analyzing trace with hash 836474412, now seen corresponding path program 1 times
[2019-11-24 04:42:51,471 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:42:51,471 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627080746]
[2019-11-24 04:42:51,472 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:42:51,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:42:51,918 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:42:51,918 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627080746]
[2019-11-24 04:42:51,919 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:42:51,920 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-24 04:42:51,924 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482368227]
[2019-11-24 04:42:51,935 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 2 states
[2019-11-24 04:42:51,935 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:42:51,955 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2019-11-24 04:42:51,956 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2019-11-24 04:42:51,958 INFO  L87              Difference]: Start difference. First operand 749 states. Second operand 2 states.
[2019-11-24 04:42:52,034 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:42:52,034 INFO  L93              Difference]: Finished difference Result 766 states and 1459 transitions.
[2019-11-24 04:42:52,034 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2019-11-24 04:42:52,036 INFO  L78                 Accepts]: Start accepts. Automaton has 2 states. Word has length 14
[2019-11-24 04:42:52,036 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:42:52,071 INFO  L225             Difference]: With dead ends: 766
[2019-11-24 04:42:52,071 INFO  L226             Difference]: Without dead ends: 747
[2019-11-24 04:42:52,077 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:42:52,100 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 747 states.
[2019-11-24 04:42:52,172 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747.
[2019-11-24 04:42:52,174 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 747 states.
[2019-11-24 04:42:52,180 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1429 transitions.
[2019-11-24 04:42:52,182 INFO  L78                 Accepts]: Start accepts. Automaton has 747 states and 1429 transitions. Word has length 14
[2019-11-24 04:42:52,182 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:42:52,182 INFO  L462      AbstractCegarLoop]: Abstraction has 747 states and 1429 transitions.
[2019-11-24 04:42:52,182 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 2 states.
[2019-11-24 04:42:52,183 INFO  L276                IsEmpty]: Start isEmpty. Operand 747 states and 1429 transitions.
[2019-11-24 04:42:52,185 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-11-24 04:42:52,185 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:42:52,186 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-24 04:42:52,186 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:42:52,186 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:42:52,187 INFO  L82        PathProgramCache]: Analyzing trace with hash 141274390, now seen corresponding path program 1 times
[2019-11-24 04:42:52,187 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:42:52,187 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535646790]
[2019-11-24 04:42:52,187 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:42:52,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:42:52,336 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:42:52,337 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535646790]
[2019-11-24 04:42:52,337 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:42:52,337 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:42:52,338 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59146802]
[2019-11-24 04:42:52,340 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-24 04:42:52,340 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:42:52,340 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-24 04:42:52,340 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-24 04:42:52,341 INFO  L87              Difference]: Start difference. First operand 747 states and 1429 transitions. Second operand 3 states.
[2019-11-24 04:42:52,618 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:42:52,618 INFO  L93              Difference]: Finished difference Result 1337 states and 2550 transitions.
[2019-11-24 04:42:52,619 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-24 04:42:52,619 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 15
[2019-11-24 04:42:52,619 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:42:52,625 INFO  L225             Difference]: With dead ends: 1337
[2019-11-24 04:42:52,625 INFO  L226             Difference]: Without dead ends: 943
[2019-11-24 04:42:52,629 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:42:52,632 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 943 states.
[2019-11-24 04:42:52,661 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 906.
[2019-11-24 04:42:52,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 906 states.
[2019-11-24 04:42:52,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1729 transitions.
[2019-11-24 04:42:52,666 INFO  L78                 Accepts]: Start accepts. Automaton has 906 states and 1729 transitions. Word has length 15
[2019-11-24 04:42:52,666 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:42:52,667 INFO  L462      AbstractCegarLoop]: Abstraction has 906 states and 1729 transitions.
[2019-11-24 04:42:52,667 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-24 04:42:52,667 INFO  L276                IsEmpty]: Start isEmpty. Operand 906 states and 1729 transitions.
[2019-11-24 04:42:52,670 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2019-11-24 04:42:52,670 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:42:52,670 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-24 04:42:52,670 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:42:52,671 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:42:52,671 INFO  L82        PathProgramCache]: Analyzing trace with hash -944601485, now seen corresponding path program 1 times
[2019-11-24 04:42:52,671 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:42:52,672 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819373386]
[2019-11-24 04:42:52,672 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:42:52,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:42:52,767 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:42:52,768 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819373386]
[2019-11-24 04:42:52,768 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:42:52,768 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:42:52,768 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519413624]
[2019-11-24 04:42:52,769 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-24 04:42:52,769 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:42:52,769 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-24 04:42:52,770 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-24 04:42:52,770 INFO  L87              Difference]: Start difference. First operand 906 states and 1729 transitions. Second operand 3 states.
[2019-11-24 04:42:53,169 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:42:53,170 INFO  L93              Difference]: Finished difference Result 1863 states and 3548 transitions.
[2019-11-24 04:42:53,176 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-24 04:42:53,176 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2019-11-24 04:42:53,176 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:42:53,190 INFO  L225             Difference]: With dead ends: 1863
[2019-11-24 04:42:53,202 INFO  L226             Difference]: Without dead ends: 1327
[2019-11-24 04:42:53,205 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:42:53,213 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1327 states.
[2019-11-24 04:42:53,263 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1214.
[2019-11-24 04:42:53,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1214 states.
[2019-11-24 04:42:53,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2311 transitions.
[2019-11-24 04:42:53,269 INFO  L78                 Accepts]: Start accepts. Automaton has 1214 states and 2311 transitions. Word has length 17
[2019-11-24 04:42:53,269 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:42:53,270 INFO  L462      AbstractCegarLoop]: Abstraction has 1214 states and 2311 transitions.
[2019-11-24 04:42:53,270 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-24 04:42:53,271 INFO  L276                IsEmpty]: Start isEmpty. Operand 1214 states and 2311 transitions.
[2019-11-24 04:42:53,280 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2019-11-24 04:42:53,280 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:42:53,281 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:42:53,281 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:42:53,281 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:42:53,282 INFO  L82        PathProgramCache]: Analyzing trace with hash 1361630397, now seen corresponding path program 1 times
[2019-11-24 04:42:53,282 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:42:53,282 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326072596]
[2019-11-24 04:42:53,283 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:42:53,353 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:42:53,431 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:42:53,432 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326072596]
[2019-11-24 04:42:53,432 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:42:53,433 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:42:53,434 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606132297]
[2019-11-24 04:42:53,434 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-24 04:42:53,435 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:42:53,435 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-24 04:42:53,435 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-24 04:42:53,436 INFO  L87              Difference]: Start difference. First operand 1214 states and 2311 transitions. Second operand 3 states.
[2019-11-24 04:42:53,712 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:42:53,712 INFO  L93              Difference]: Finished difference Result 2045 states and 3885 transitions.
[2019-11-24 04:42:53,713 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-24 04:42:53,714 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 19
[2019-11-24 04:42:53,714 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:42:53,722 INFO  L225             Difference]: With dead ends: 2045
[2019-11-24 04:42:53,722 INFO  L226             Difference]: Without dead ends: 1204
[2019-11-24 04:42:53,725 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:42:53,728 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1204 states.
[2019-11-24 04:42:53,765 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1204.
[2019-11-24 04:42:53,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1204 states.
[2019-11-24 04:42:53,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 2285 transitions.
[2019-11-24 04:42:53,770 INFO  L78                 Accepts]: Start accepts. Automaton has 1204 states and 2285 transitions. Word has length 19
[2019-11-24 04:42:53,771 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:42:53,771 INFO  L462      AbstractCegarLoop]: Abstraction has 1204 states and 2285 transitions.
[2019-11-24 04:42:53,771 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-24 04:42:53,771 INFO  L276                IsEmpty]: Start isEmpty. Operand 1204 states and 2285 transitions.
[2019-11-24 04:42:53,772 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2019-11-24 04:42:53,773 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:42:53,773 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]
[2019-11-24 04:42:53,773 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:42:53,774 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:42:53,774 INFO  L82        PathProgramCache]: Analyzing trace with hash 1148446937, now seen corresponding path program 1 times
[2019-11-24 04:42:53,774 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:42:53,774 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862266253]
[2019-11-24 04:42:53,775 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:42:53,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:42:53,874 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:42:53,875 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862266253]
[2019-11-24 04:42:53,875 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:42:53,875 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:42:53,876 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18566837]
[2019-11-24 04:42:53,877 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-24 04:42:53,877 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:42:53,877 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-24 04:42:53,877 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-24 04:42:53,877 INFO  L87              Difference]: Start difference. First operand 1204 states and 2285 transitions. Second operand 3 states.
[2019-11-24 04:42:54,196 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:42:54,196 INFO  L93              Difference]: Finished difference Result 2758 states and 5223 transitions.
[2019-11-24 04:42:54,196 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-24 04:42:54,197 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 20
[2019-11-24 04:42:54,197 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:42:54,208 INFO  L225             Difference]: With dead ends: 2758
[2019-11-24 04:42:54,208 INFO  L226             Difference]: Without dead ends: 1944
[2019-11-24 04:42:54,210 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:42:54,214 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1944 states.
[2019-11-24 04:42:54,274 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1792.
[2019-11-24 04:42:54,274 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1792 states.
[2019-11-24 04:42:54,281 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 3386 transitions.
[2019-11-24 04:42:54,281 INFO  L78                 Accepts]: Start accepts. Automaton has 1792 states and 3386 transitions. Word has length 20
[2019-11-24 04:42:54,282 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:42:54,282 INFO  L462      AbstractCegarLoop]: Abstraction has 1792 states and 3386 transitions.
[2019-11-24 04:42:54,282 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-24 04:42:54,282 INFO  L276                IsEmpty]: Start isEmpty. Operand 1792 states and 3386 transitions.
[2019-11-24 04:42:54,284 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2019-11-24 04:42:54,284 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:42:54,284 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:42:54,284 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:42:54,284 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:42:54,285 INFO  L82        PathProgramCache]: Analyzing trace with hash 1242135072, now seen corresponding path program 1 times
[2019-11-24 04:42:54,285 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:42:54,286 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371424841]
[2019-11-24 04:42:54,286 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:42:54,328 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:42:54,392 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:42:54,393 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371424841]
[2019-11-24 04:42:54,393 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:42:54,393 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:42:54,393 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030905167]
[2019-11-24 04:42:54,394 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-24 04:42:54,394 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:42:54,394 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-24 04:42:54,394 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-24 04:42:54,395 INFO  L87              Difference]: Start difference. First operand 1792 states and 3386 transitions. Second operand 3 states.
[2019-11-24 04:42:54,633 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:42:54,634 INFO  L93              Difference]: Finished difference Result 1792 states and 3386 transitions.
[2019-11-24 04:42:54,635 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-24 04:42:54,635 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 21
[2019-11-24 04:42:54,635 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:42:54,645 INFO  L225             Difference]: With dead ends: 1792
[2019-11-24 04:42:54,645 INFO  L226             Difference]: Without dead ends: 1785
[2019-11-24 04:42:54,646 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:42:54,649 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1785 states.
[2019-11-24 04:42:54,703 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1785.
[2019-11-24 04:42:54,703 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1785 states.
[2019-11-24 04:42:54,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 3374 transitions.
[2019-11-24 04:42:54,711 INFO  L78                 Accepts]: Start accepts. Automaton has 1785 states and 3374 transitions. Word has length 21
[2019-11-24 04:42:54,711 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:42:54,711 INFO  L462      AbstractCegarLoop]: Abstraction has 1785 states and 3374 transitions.
[2019-11-24 04:42:54,712 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-24 04:42:54,712 INFO  L276                IsEmpty]: Start isEmpty. Operand 1785 states and 3374 transitions.
[2019-11-24 04:42:54,714 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2019-11-24 04:42:54,714 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:42:54,714 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:42:54,714 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:42:54,715 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:42:54,715 INFO  L82        PathProgramCache]: Analyzing trace with hash -1984972764, now seen corresponding path program 1 times
[2019-11-24 04:42:54,715 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:42:54,715 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086610715]
[2019-11-24 04:42:54,715 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:42:54,811 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:42:54,949 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:42:54,950 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086610715]
[2019-11-24 04:42:54,950 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:42:54,950 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:42:54,951 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368462994]
[2019-11-24 04:42:54,951 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-24 04:42:54,952 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:42:54,952 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-24 04:42:54,952 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-24 04:42:54,952 INFO  L87              Difference]: Start difference. First operand 1785 states and 3374 transitions. Second operand 3 states.
[2019-11-24 04:42:56,294 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:42:56,294 INFO  L93              Difference]: Finished difference Result 4555 states and 8568 transitions.
[2019-11-24 04:42:56,294 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-24 04:42:56,294 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 31
[2019-11-24 04:42:56,295 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:42:56,313 INFO  L225             Difference]: With dead ends: 4555
[2019-11-24 04:42:56,313 INFO  L226             Difference]: Without dead ends: 2959
[2019-11-24 04:42:56,318 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:42:56,325 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2959 states.
[2019-11-24 04:42:56,437 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1745.
[2019-11-24 04:42:56,438 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1745 states.
[2019-11-24 04:42:56,448 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 3274 transitions.
[2019-11-24 04:42:56,449 INFO  L78                 Accepts]: Start accepts. Automaton has 1745 states and 3274 transitions. Word has length 31
[2019-11-24 04:42:56,449 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:42:56,449 INFO  L462      AbstractCegarLoop]: Abstraction has 1745 states and 3274 transitions.
[2019-11-24 04:42:56,450 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-24 04:42:56,450 INFO  L276                IsEmpty]: Start isEmpty. Operand 1745 states and 3274 transitions.
[2019-11-24 04:42:56,453 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2019-11-24 04:42:56,453 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:42:56,454 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]
[2019-11-24 04:42:56,454 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:42:56,454 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:42:56,455 INFO  L82        PathProgramCache]: Analyzing trace with hash 1477246664, now seen corresponding path program 1 times
[2019-11-24 04:42:56,455 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:42:56,456 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044966690]
[2019-11-24 04:42:56,457 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:42:56,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:42:56,820 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:42:56,821 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044966690]
[2019-11-24 04:42:56,821 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:42:56,821 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:42:56,822 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893591218]
[2019-11-24 04:42:56,822 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-24 04:42:56,823 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:42:56,823 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-24 04:42:56,823 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-24 04:42:56,824 INFO  L87              Difference]: Start difference. First operand 1745 states and 3274 transitions. Second operand 3 states.
[2019-11-24 04:42:58,094 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:42:58,094 INFO  L93              Difference]: Finished difference Result 4461 states and 8354 transitions.
[2019-11-24 04:42:58,095 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-24 04:42:58,095 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 32
[2019-11-24 04:42:58,095 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:42:58,112 INFO  L225             Difference]: With dead ends: 4461
[2019-11-24 04:42:58,112 INFO  L226             Difference]: Without dead ends: 2927
[2019-11-24 04:42:58,116 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:42:58,124 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2927 states.
[2019-11-24 04:42:58,332 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1715.
[2019-11-24 04:42:58,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1715 states.
[2019-11-24 04:42:58,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 3184 transitions.
[2019-11-24 04:42:58,340 INFO  L78                 Accepts]: Start accepts. Automaton has 1715 states and 3184 transitions. Word has length 32
[2019-11-24 04:42:58,342 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:42:58,342 INFO  L462      AbstractCegarLoop]: Abstraction has 1715 states and 3184 transitions.
[2019-11-24 04:42:58,342 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-24 04:42:58,342 INFO  L276                IsEmpty]: Start isEmpty. Operand 1715 states and 3184 transitions.
[2019-11-24 04:42:58,347 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2019-11-24 04:42:58,347 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:42:58,348 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]
[2019-11-24 04:42:58,348 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:42:58,348 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:42:58,349 INFO  L82        PathProgramCache]: Analyzing trace with hash -1518041395, now seen corresponding path program 1 times
[2019-11-24 04:42:58,349 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:42:58,349 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555705228]
[2019-11-24 04:42:58,349 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:42:58,502 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:42:58,629 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:42:58,630 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555705228]
[2019-11-24 04:42:58,630 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:42:58,630 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:42:58,630 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834381187]
[2019-11-24 04:42:58,631 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-24 04:42:58,631 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:42:58,631 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-24 04:42:58,631 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-24 04:42:58,632 INFO  L87              Difference]: Start difference. First operand 1715 states and 3184 transitions. Second operand 3 states.
[2019-11-24 04:42:59,704 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:42:59,704 INFO  L93              Difference]: Finished difference Result 4382 states and 8155 transitions.
[2019-11-24 04:42:59,705 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-24 04:42:59,705 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 34
[2019-11-24 04:42:59,705 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:42:59,724 INFO  L225             Difference]: With dead ends: 4382
[2019-11-24 04:42:59,724 INFO  L226             Difference]: Without dead ends: 2905
[2019-11-24 04:42:59,728 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:42:59,735 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2905 states.
[2019-11-24 04:42:59,871 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1695.
[2019-11-24 04:42:59,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1695 states.
[2019-11-24 04:42:59,880 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 3104 transitions.
[2019-11-24 04:42:59,880 INFO  L78                 Accepts]: Start accepts. Automaton has 1695 states and 3104 transitions. Word has length 34
[2019-11-24 04:42:59,880 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:42:59,881 INFO  L462      AbstractCegarLoop]: Abstraction has 1695 states and 3104 transitions.
[2019-11-24 04:42:59,884 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-24 04:42:59,884 INFO  L276                IsEmpty]: Start isEmpty. Operand 1695 states and 3104 transitions.
[2019-11-24 04:42:59,887 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2019-11-24 04:42:59,887 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:42:59,887 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:42:59,888 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:42:59,888 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:42:59,888 INFO  L82        PathProgramCache]: Analyzing trace with hash 589600556, now seen corresponding path program 1 times
[2019-11-24 04:42:59,889 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:42:59,889 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826843024]
[2019-11-24 04:42:59,889 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:43:00,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:43:00,254 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:43:00,255 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826843024]
[2019-11-24 04:43:00,255 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:43:00,255 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:43:00,256 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098032969]
[2019-11-24 04:43:00,257 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-24 04:43:00,257 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:43:00,258 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-24 04:43:00,258 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-24 04:43:00,258 INFO  L87              Difference]: Start difference. First operand 1695 states and 3104 transitions. Second operand 3 states.
[2019-11-24 04:43:01,270 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:43:01,270 INFO  L93              Difference]: Finished difference Result 4318 states and 7971 transitions.
[2019-11-24 04:43:01,271 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-24 04:43:01,276 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 37
[2019-11-24 04:43:01,276 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:43:01,292 INFO  L225             Difference]: With dead ends: 4318
[2019-11-24 04:43:01,292 INFO  L226             Difference]: Without dead ends: 2893
[2019-11-24 04:43:01,296 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:43:01,301 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2893 states.
[2019-11-24 04:43:01,401 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1685.
[2019-11-24 04:43:01,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1685 states.
[2019-11-24 04:43:01,407 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 3034 transitions.
[2019-11-24 04:43:01,408 INFO  L78                 Accepts]: Start accepts. Automaton has 1685 states and 3034 transitions. Word has length 37
[2019-11-24 04:43:01,409 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:43:01,409 INFO  L462      AbstractCegarLoop]: Abstraction has 1685 states and 3034 transitions.
[2019-11-24 04:43:01,409 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-24 04:43:01,410 INFO  L276                IsEmpty]: Start isEmpty. Operand 1685 states and 3034 transitions.
[2019-11-24 04:43:01,414 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2019-11-24 04:43:01,414 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:43:01,415 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]
[2019-11-24 04:43:01,415 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:43:01,416 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:43:01,416 INFO  L82        PathProgramCache]: Analyzing trace with hash 20194998, now seen corresponding path program 1 times
[2019-11-24 04:43:01,416 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:43:01,416 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681778170]
[2019-11-24 04:43:01,416 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:43:01,539 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:43:01,680 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:43:01,681 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681778170]
[2019-11-24 04:43:01,682 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:43:01,682 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:43:01,682 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628906013]
[2019-11-24 04:43:01,683 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-24 04:43:01,683 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:43:01,683 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-24 04:43:01,683 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-24 04:43:01,683 INFO  L87              Difference]: Start difference. First operand 1685 states and 3034 transitions. Second operand 3 states.
[2019-11-24 04:43:02,490 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:43:02,490 INFO  L93              Difference]: Finished difference Result 3208 states and 5816 transitions.
[2019-11-24 04:43:02,490 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-24 04:43:02,490 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 41
[2019-11-24 04:43:02,491 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:43:02,511 INFO  L225             Difference]: With dead ends: 3208
[2019-11-24 04:43:02,514 INFO  L226             Difference]: Without dead ends: 1830
[2019-11-24 04:43:02,517 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:43:02,520 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1830 states.
[2019-11-24 04:43:02,640 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1685.
[2019-11-24 04:43:02,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1685 states.
[2019-11-24 04:43:02,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2974 transitions.
[2019-11-24 04:43:02,647 INFO  L78                 Accepts]: Start accepts. Automaton has 1685 states and 2974 transitions. Word has length 41
[2019-11-24 04:43:02,648 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:43:02,648 INFO  L462      AbstractCegarLoop]: Abstraction has 1685 states and 2974 transitions.
[2019-11-24 04:43:02,649 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-24 04:43:02,649 INFO  L276                IsEmpty]: Start isEmpty. Operand 1685 states and 2974 transitions.
[2019-11-24 04:43:02,651 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2019-11-24 04:43:02,651 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:43:02,651 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:43:02,651 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:43:02,652 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:43:02,652 INFO  L82        PathProgramCache]: Analyzing trace with hash -1025623727, now seen corresponding path program 1 times
[2019-11-24 04:43:02,652 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:43:02,653 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045469416]
[2019-11-24 04:43:02,653 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:43:02,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:43:02,963 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:43:02,963 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045469416]
[2019-11-24 04:43:02,965 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:43:02,965 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-24 04:43:02,965 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554265948]
[2019-11-24 04:43:02,965 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-11-24 04:43:02,966 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:43:02,966 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-11-24 04:43:02,966 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-24 04:43:02,966 INFO  L87              Difference]: Start difference. First operand 1685 states and 2974 transitions. Second operand 5 states.
[2019-11-24 04:43:04,297 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:43:04,298 INFO  L93              Difference]: Finished difference Result 6642 states and 12096 transitions.
[2019-11-24 04:43:04,298 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-11-24 04:43:04,298 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 45
[2019-11-24 04:43:04,298 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:43:04,315 INFO  L225             Difference]: With dead ends: 6642
[2019-11-24 04:43:04,315 INFO  L226             Difference]: Without dead ends: 4972
[2019-11-24 04:43:04,320 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:43:04,327 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4972 states.
[2019-11-24 04:43:04,510 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 2063.
[2019-11-24 04:43:04,511 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2063 states.
[2019-11-24 04:43:04,518 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 3540 transitions.
[2019-11-24 04:43:04,518 INFO  L78                 Accepts]: Start accepts. Automaton has 2063 states and 3540 transitions. Word has length 45
[2019-11-24 04:43:04,519 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:43:04,519 INFO  L462      AbstractCegarLoop]: Abstraction has 2063 states and 3540 transitions.
[2019-11-24 04:43:04,519 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-11-24 04:43:04,519 INFO  L276                IsEmpty]: Start isEmpty. Operand 2063 states and 3540 transitions.
[2019-11-24 04:43:04,521 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2019-11-24 04:43:04,521 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:43:04,521 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:43:04,521 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:43:04,521 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:43:04,522 INFO  L82        PathProgramCache]: Analyzing trace with hash 947133260, now seen corresponding path program 1 times
[2019-11-24 04:43:04,522 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:43:04,522 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491935406]
[2019-11-24 04:43:04,522 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:43:04,642 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:43:04,781 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:43:04,781 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491935406]
[2019-11-24 04:43:04,781 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:43:04,781 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-24 04:43:04,782 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424983263]
[2019-11-24 04:43:04,782 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-11-24 04:43:04,782 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:43:04,782 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-11-24 04:43:04,783 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-11-24 04:43:04,783 INFO  L87              Difference]: Start difference. First operand 2063 states and 3540 transitions. Second operand 5 states.
[2019-11-24 04:43:05,008 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:43:05,008 INFO  L93              Difference]: Finished difference Result 3109 states and 5160 transitions.
[2019-11-24 04:43:05,009 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-24 04:43:05,009 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 46
[2019-11-24 04:43:05,009 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:43:05,016 INFO  L225             Difference]: With dead ends: 3109
[2019-11-24 04:43:05,017 INFO  L226             Difference]: Without dead ends: 3091
[2019-11-24 04:43:05,018 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:43:05,022 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3091 states.
[2019-11-24 04:43:05,159 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3091 to 2077.
[2019-11-24 04:43:05,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2077 states.
[2019-11-24 04:43:05,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 3554 transitions.
[2019-11-24 04:43:05,166 INFO  L78                 Accepts]: Start accepts. Automaton has 2077 states and 3554 transitions. Word has length 46
[2019-11-24 04:43:05,166 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:43:05,166 INFO  L462      AbstractCegarLoop]: Abstraction has 2077 states and 3554 transitions.
[2019-11-24 04:43:05,167 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-11-24 04:43:05,167 INFO  L276                IsEmpty]: Start isEmpty. Operand 2077 states and 3554 transitions.
[2019-11-24 04:43:05,168 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2019-11-24 04:43:05,168 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:43:05,169 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:43:05,169 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:43:05,169 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:43:05,169 INFO  L82        PathProgramCache]: Analyzing trace with hash 573391606, now seen corresponding path program 1 times
[2019-11-24 04:43:05,169 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:43:05,170 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265933970]
[2019-11-24 04:43:05,170 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:43:05,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:43:05,375 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:43:05,376 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265933970]
[2019-11-24 04:43:05,376 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:43:05,376 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:43:05,377 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365995796]
[2019-11-24 04:43:05,377 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-24 04:43:05,377 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:43:05,377 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-24 04:43:05,378 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-24 04:43:05,378 INFO  L87              Difference]: Start difference. First operand 2077 states and 3554 transitions. Second operand 3 states.
[2019-11-24 04:43:05,549 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:43:05,550 INFO  L93              Difference]: Finished difference Result 2099 states and 3577 transitions.
[2019-11-24 04:43:05,550 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-24 04:43:05,551 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 47
[2019-11-24 04:43:05,551 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:43:05,555 INFO  L225             Difference]: With dead ends: 2099
[2019-11-24 04:43:05,555 INFO  L226             Difference]: Without dead ends: 2081
[2019-11-24 04:43:05,556 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:43:05,559 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2081 states.
[2019-11-24 04:43:05,789 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 2077.
[2019-11-24 04:43:05,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2077 states.
[2019-11-24 04:43:05,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 3540 transitions.
[2019-11-24 04:43:05,794 INFO  L78                 Accepts]: Start accepts. Automaton has 2077 states and 3540 transitions. Word has length 47
[2019-11-24 04:43:05,794 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:43:05,794 INFO  L462      AbstractCegarLoop]: Abstraction has 2077 states and 3540 transitions.
[2019-11-24 04:43:05,794 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-24 04:43:05,794 INFO  L276                IsEmpty]: Start isEmpty. Operand 2077 states and 3540 transitions.
[2019-11-24 04:43:05,796 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2019-11-24 04:43:05,796 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:43:05,796 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:43:05,796 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:43:05,797 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:43:05,797 INFO  L82        PathProgramCache]: Analyzing trace with hash -109840791, now seen corresponding path program 1 times
[2019-11-24 04:43:05,797 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:43:05,797 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869982545]
[2019-11-24 04:43:05,797 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:43:05,946 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:43:06,564 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:43:06,565 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869982545]
[2019-11-24 04:43:06,565 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:43:06,565 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2019-11-24 04:43:06,565 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109008233]
[2019-11-24 04:43:06,566 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 21 states
[2019-11-24 04:43:06,566 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:43:06,566 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2019-11-24 04:43:06,566 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420
[2019-11-24 04:43:06,566 INFO  L87              Difference]: Start difference. First operand 2077 states and 3540 transitions. Second operand 21 states.
[2019-11-24 04:43:08,501 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:43:08,501 INFO  L93              Difference]: Finished difference Result 6251 states and 10881 transitions.
[2019-11-24 04:43:08,502 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2019-11-24 04:43:08,502 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states. Word has length 48
[2019-11-24 04:43:08,502 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:43:08,512 INFO  L225             Difference]: With dead ends: 6251
[2019-11-24 04:43:08,512 INFO  L226             Difference]: Without dead ends: 4310
[2019-11-24 04:43:08,517 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702
[2019-11-24 04:43:08,522 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4310 states.
[2019-11-24 04:43:08,691 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4310 to 2032.
[2019-11-24 04:43:08,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2032 states.
[2019-11-24 04:43:08,696 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 3446 transitions.
[2019-11-24 04:43:08,696 INFO  L78                 Accepts]: Start accepts. Automaton has 2032 states and 3446 transitions. Word has length 48
[2019-11-24 04:43:08,696 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:43:08,696 INFO  L462      AbstractCegarLoop]: Abstraction has 2032 states and 3446 transitions.
[2019-11-24 04:43:08,697 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 21 states.
[2019-11-24 04:43:08,697 INFO  L276                IsEmpty]: Start isEmpty. Operand 2032 states and 3446 transitions.
[2019-11-24 04:43:08,698 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2019-11-24 04:43:08,698 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:43:08,699 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]
[2019-11-24 04:43:08,699 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:43:08,699 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:43:08,699 INFO  L82        PathProgramCache]: Analyzing trace with hash -1818559635, now seen corresponding path program 1 times
[2019-11-24 04:43:08,699 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:43:08,700 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275987730]
[2019-11-24 04:43:08,700 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:43:08,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:43:08,935 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:43:08,935 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275987730]
[2019-11-24 04:43:08,935 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:43:08,935 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-24 04:43:08,936 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282272690]
[2019-11-24 04:43:08,936 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-24 04:43:08,936 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:43:08,936 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-24 04:43:08,936 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-24 04:43:08,937 INFO  L87              Difference]: Start difference. First operand 2032 states and 3446 transitions. Second operand 4 states.
[2019-11-24 04:43:09,840 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:43:09,840 INFO  L93              Difference]: Finished difference Result 5591 states and 9585 transitions.
[2019-11-24 04:43:09,841 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-24 04:43:09,841 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 49
[2019-11-24 04:43:09,841 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:43:09,849 INFO  L225             Difference]: With dead ends: 5591
[2019-11-24 04:43:09,849 INFO  L226             Difference]: Without dead ends: 3671
[2019-11-24 04:43:09,852 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:43:09,856 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3671 states.
[2019-11-24 04:43:10,061 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 1967.
[2019-11-24 04:43:10,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1967 states.
[2019-11-24 04:43:10,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3321 transitions.
[2019-11-24 04:43:10,067 INFO  L78                 Accepts]: Start accepts. Automaton has 1967 states and 3321 transitions. Word has length 49
[2019-11-24 04:43:10,068 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:43:10,068 INFO  L462      AbstractCegarLoop]: Abstraction has 1967 states and 3321 transitions.
[2019-11-24 04:43:10,068 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-24 04:43:10,068 INFO  L276                IsEmpty]: Start isEmpty. Operand 1967 states and 3321 transitions.
[2019-11-24 04:43:10,070 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2019-11-24 04:43:10,070 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:43:10,070 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:43:10,071 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:43:10,071 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:43:10,071 INFO  L82        PathProgramCache]: Analyzing trace with hash 1817770258, now seen corresponding path program 1 times
[2019-11-24 04:43:10,071 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:43:10,072 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013604848]
[2019-11-24 04:43:10,072 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:43:10,259 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:43:10,905 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:43:10,906 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013604848]
[2019-11-24 04:43:10,906 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:43:10,906 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2019-11-24 04:43:10,906 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467747158]
[2019-11-24 04:43:10,907 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 21 states
[2019-11-24 04:43:10,907 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:43:10,907 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2019-11-24 04:43:10,908 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420
[2019-11-24 04:43:10,908 INFO  L87              Difference]: Start difference. First operand 1967 states and 3321 transitions. Second operand 21 states.
[2019-11-24 04:43:14,031 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:43:14,031 INFO  L93              Difference]: Finished difference Result 6155 states and 10619 transitions.
[2019-11-24 04:43:14,031 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2019-11-24 04:43:14,031 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states. Word has length 50
[2019-11-24 04:43:14,032 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:43:14,040 INFO  L225             Difference]: With dead ends: 6155
[2019-11-24 04:43:14,041 INFO  L226             Difference]: Without dead ends: 4310
[2019-11-24 04:43:14,045 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702
[2019-11-24 04:43:14,050 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4310 states.
[2019-11-24 04:43:14,318 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4310 to 2166.
[2019-11-24 04:43:14,318 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2166 states.
[2019-11-24 04:43:14,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 3566 transitions.
[2019-11-24 04:43:14,323 INFO  L78                 Accepts]: Start accepts. Automaton has 2166 states and 3566 transitions. Word has length 50
[2019-11-24 04:43:14,323 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:43:14,323 INFO  L462      AbstractCegarLoop]: Abstraction has 2166 states and 3566 transitions.
[2019-11-24 04:43:14,323 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 21 states.
[2019-11-24 04:43:14,323 INFO  L276                IsEmpty]: Start isEmpty. Operand 2166 states and 3566 transitions.
[2019-11-24 04:43:14,325 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2019-11-24 04:43:14,326 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:43:14,326 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-24 04:43:14,326 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:43:14,326 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:43:14,327 INFO  L82        PathProgramCache]: Analyzing trace with hash -239532230, now seen corresponding path program 1 times
[2019-11-24 04:43:14,327 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:43:14,327 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139424484]
[2019-11-24 04:43:14,327 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:43:14,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:43:15,235 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:43:15,236 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139424484]
[2019-11-24 04:43:15,236 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:43:15,236 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2019-11-24 04:43:15,237 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134365]
[2019-11-24 04:43:15,237 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 21 states
[2019-11-24 04:43:15,237 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:43:15,238 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2019-11-24 04:43:15,246 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420
[2019-11-24 04:43:15,246 INFO  L87              Difference]: Start difference. First operand 2166 states and 3566 transitions. Second operand 21 states.
[2019-11-24 04:43:18,003 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:43:18,003 INFO  L93              Difference]: Finished difference Result 6109 states and 10155 transitions.
[2019-11-24 04:43:18,004 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2019-11-24 04:43:18,004 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states. Word has length 53
[2019-11-24 04:43:18,004 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:43:18,011 INFO  L225             Difference]: With dead ends: 6109
[2019-11-24 04:43:18,012 INFO  L226             Difference]: Without dead ends: 4146
[2019-11-24 04:43:18,016 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702
[2019-11-24 04:43:18,021 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4146 states.
[2019-11-24 04:43:18,346 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4146 to 2552.
[2019-11-24 04:43:18,346 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2552 states.
[2019-11-24 04:43:18,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 4130 transitions.
[2019-11-24 04:43:18,349 INFO  L78                 Accepts]: Start accepts. Automaton has 2552 states and 4130 transitions. Word has length 53
[2019-11-24 04:43:18,349 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:43:18,349 INFO  L462      AbstractCegarLoop]: Abstraction has 2552 states and 4130 transitions.
[2019-11-24 04:43:18,350 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 21 states.
[2019-11-24 04:43:18,350 INFO  L276                IsEmpty]: Start isEmpty. Operand 2552 states and 4130 transitions.
[2019-11-24 04:43:18,353 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2019-11-24 04:43:18,353 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:43:18,354 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]
[2019-11-24 04:43:18,354 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:43:18,354 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:43:18,354 INFO  L82        PathProgramCache]: Analyzing trace with hash -217634077, now seen corresponding path program 1 times
[2019-11-24 04:43:18,355 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:43:18,355 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635427515]
[2019-11-24 04:43:18,355 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:43:18,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:43:18,530 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:43:18,531 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635427515]
[2019-11-24 04:43:18,531 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:43:18,531 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-11-24 04:43:18,531 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804222017]
[2019-11-24 04:43:18,532 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-11-24 04:43:18,532 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:43:18,532 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-11-24 04:43:18,532 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-24 04:43:18,533 INFO  L87              Difference]: Start difference. First operand 2552 states and 4130 transitions. Second operand 5 states.
[2019-11-24 04:43:20,645 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:43:20,645 INFO  L93              Difference]: Finished difference Result 8468 states and 13963 transitions.
[2019-11-24 04:43:20,645 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-11-24 04:43:20,646 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 62
[2019-11-24 04:43:20,646 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:43:20,654 INFO  L225             Difference]: With dead ends: 8468
[2019-11-24 04:43:20,654 INFO  L226             Difference]: Without dead ends: 6121
[2019-11-24 04:43:20,659 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2019-11-24 04:43:20,665 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6121 states.
[2019-11-24 04:43:21,027 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6121 to 3798.
[2019-11-24 04:43:21,027 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3798 states.
[2019-11-24 04:43:21,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 5946 transitions.
[2019-11-24 04:43:21,033 INFO  L78                 Accepts]: Start accepts. Automaton has 3798 states and 5946 transitions. Word has length 62
[2019-11-24 04:43:21,034 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:43:21,034 INFO  L462      AbstractCegarLoop]: Abstraction has 3798 states and 5946 transitions.
[2019-11-24 04:43:21,034 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-11-24 04:43:21,034 INFO  L276                IsEmpty]: Start isEmpty. Operand 3798 states and 5946 transitions.
[2019-11-24 04:43:21,037 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2019-11-24 04:43:21,037 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:43:21,038 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]
[2019-11-24 04:43:21,038 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:43:21,038 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:43:21,038 INFO  L82        PathProgramCache]: Analyzing trace with hash -434381134, now seen corresponding path program 1 times
[2019-11-24 04:43:21,039 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:43:21,039 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812227159]
[2019-11-24 04:43:21,039 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:43:21,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:43:21,194 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:43:21,194 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812227159]
[2019-11-24 04:43:21,195 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:43:21,195 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-11-24 04:43:21,195 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641745756]
[2019-11-24 04:43:21,195 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-11-24 04:43:21,196 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:43:21,196 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-11-24 04:43:21,196 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-24 04:43:21,196 INFO  L87              Difference]: Start difference. First operand 3798 states and 5946 transitions. Second operand 5 states.
[2019-11-24 04:43:23,490 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:43:23,490 INFO  L93              Difference]: Finished difference Result 11595 states and 18732 transitions.
[2019-11-24 04:43:23,491 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2019-11-24 04:43:23,491 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 62
[2019-11-24 04:43:23,491 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:43:23,498 INFO  L225             Difference]: With dead ends: 11595
[2019-11-24 04:43:23,498 INFO  L226             Difference]: Without dead ends: 8004
[2019-11-24 04:43:23,502 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2019-11-24 04:43:23,507 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8004 states.
[2019-11-24 04:43:24,204 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8004 to 4772.
[2019-11-24 04:43:24,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4772 states.
[2019-11-24 04:43:24,210 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4772 states to 4772 states and 7226 transitions.
[2019-11-24 04:43:24,210 INFO  L78                 Accepts]: Start accepts. Automaton has 4772 states and 7226 transitions. Word has length 62
[2019-11-24 04:43:24,210 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:43:24,210 INFO  L462      AbstractCegarLoop]: Abstraction has 4772 states and 7226 transitions.
[2019-11-24 04:43:24,210 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-11-24 04:43:24,210 INFO  L276                IsEmpty]: Start isEmpty. Operand 4772 states and 7226 transitions.
[2019-11-24 04:43:24,214 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2019-11-24 04:43:24,214 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:43:24,215 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]
[2019-11-24 04:43:24,215 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:43:24,215 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:43:24,215 INFO  L82        PathProgramCache]: Analyzing trace with hash 790927563, now seen corresponding path program 1 times
[2019-11-24 04:43:24,216 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:43:24,216 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979096322]
[2019-11-24 04:43:24,216 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:43:24,284 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:43:24,399 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:43:24,400 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979096322]
[2019-11-24 04:43:24,400 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:43:24,400 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-11-24 04:43:24,400 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604860347]
[2019-11-24 04:43:24,401 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-11-24 04:43:24,401 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:43:24,401 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-11-24 04:43:24,401 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-11-24 04:43:24,401 INFO  L87              Difference]: Start difference. First operand 4772 states and 7226 transitions. Second operand 6 states.
[2019-11-24 04:43:27,506 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-24 04:43:27,506 INFO  L93              Difference]: Finished difference Result 13145 states and 21183 transitions.
[2019-11-24 04:43:27,506 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2019-11-24 04:43:27,506 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 63
[2019-11-24 04:43:27,507 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-24 04:43:27,514 INFO  L225             Difference]: With dead ends: 13145
[2019-11-24 04:43:27,515 INFO  L226             Difference]: Without dead ends: 8584
[2019-11-24 04:43:27,520 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156
[2019-11-24 04:43:27,529 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8584 states.
[2019-11-24 04:43:28,049 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8584 to 4016.
[2019-11-24 04:43:28,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4016 states.
[2019-11-24 04:43:28,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4016 states to 4016 states and 6031 transitions.
[2019-11-24 04:43:28,054 INFO  L78                 Accepts]: Start accepts. Automaton has 4016 states and 6031 transitions. Word has length 63
[2019-11-24 04:43:28,054 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-24 04:43:28,054 INFO  L462      AbstractCegarLoop]: Abstraction has 4016 states and 6031 transitions.
[2019-11-24 04:43:28,054 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-11-24 04:43:28,054 INFO  L276                IsEmpty]: Start isEmpty. Operand 4016 states and 6031 transitions.
[2019-11-24 04:43:28,056 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2019-11-24 04:43:28,056 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-24 04:43:28,057 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]
[2019-11-24 04:43:28,057 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:43:28,057 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-24 04:43:28,057 INFO  L82        PathProgramCache]: Analyzing trace with hash 144331636, now seen corresponding path program 1 times
[2019-11-24 04:43:28,057 INFO  L163   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-11-24 04:43:28,058 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171690468]
[2019-11-24 04:43:28,058 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-24 04:43:28,129 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-24 04:43:28,223 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:43:28,224 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171690468]
[2019-11-24 04:43:28,224 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-24 04:43:28,224 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-11-24 04:43:28,224 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290476584]
[2019-11-24 04:43:28,225 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-11-24 04:43:28,225 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-11-24 04:43:28,225 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-11-24 04:43:28,225 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-11-24 04:43:28,225 INFO  L87              Difference]: Start difference. First operand 4016 states and 6031 transitions. Second operand 6 states.