java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c


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


This is Ultimate 0.1.24-112bae1
[2019-09-08 13:16:15,736 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-09-08 13:16:15,738 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-09-08 13:16:15,750 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-09-08 13:16:15,750 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-09-08 13:16:15,751 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-09-08 13:16:15,753 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-09-08 13:16:15,754 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-09-08 13:16:15,756 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-09-08 13:16:15,757 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-09-08 13:16:15,758 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-09-08 13:16:15,759 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-09-08 13:16:15,759 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-09-08 13:16:15,760 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-09-08 13:16:15,761 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-09-08 13:16:15,762 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-09-08 13:16:15,763 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-09-08 13:16:15,763 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-09-08 13:16:15,765 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-09-08 13:16:15,767 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-09-08 13:16:15,768 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-09-08 13:16:15,769 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-09-08 13:16:15,770 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-09-08 13:16:15,771 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-09-08 13:16:15,772 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-09-08 13:16:15,773 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-09-08 13:16:15,773 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-09-08 13:16:15,774 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-09-08 13:16:15,774 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-09-08 13:16:15,775 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-09-08 13:16:15,775 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-09-08 13:16:15,776 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-09-08 13:16:15,777 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-09-08 13:16:15,778 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-09-08 13:16:15,779 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-09-08 13:16:15,782 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-09-08 13:16:15,783 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-09-08 13:16:15,783 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-09-08 13:16:15,783 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-09-08 13:16:15,784 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-09-08 13:16:15,785 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-09-08 13:16:15,786 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2019-09-08 13:16:15,810 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-09-08 13:16:15,810 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-09-08 13:16:15,814 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-09-08 13:16:15,814 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-09-08 13:16:15,815 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-09-08 13:16:15,815 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-09-08 13:16:15,815 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-09-08 13:16:15,815 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-09-08 13:16:15,815 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-09-08 13:16:15,816 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-09-08 13:16:15,817 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-09-08 13:16:15,817 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-09-08 13:16:15,817 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-09-08 13:16:15,817 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-09-08 13:16:15,818 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-09-08 13:16:15,818 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-09-08 13:16:15,818 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-09-08 13:16:15,818 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-09-08 13:16:15,818 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-09-08 13:16:15,819 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-09-08 13:16:15,819 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-09-08 13:16:15,819 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-09-08 13:16:15,820 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-09-08 13:16:15,820 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-09-08 13:16:15,820 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-09-08 13:16:15,820 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-09-08 13:16:15,820 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-09-08 13:16:15,821 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-09-08 13:16:15,821 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-09-08 13:16:15,864 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-09-08 13:16:15,872 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-09-08 13:16:15,879 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-09-08 13:16:15,881 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-09-08 13:16:15,881 INFO  L275        PluginConnector]: CDTParser initialized
[2019-09-08 13:16:15,882 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c
[2019-09-08 13:16:15,945 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9875050de/49699fd137d54219a59aa47a68531ff9/FLAG293d1a878
[2019-09-08 13:16:16,508 INFO  L306              CDTParser]: Found 1 translation units.
[2019-09-08 13:16:16,509 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c
[2019-09-08 13:16:16,530 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9875050de/49699fd137d54219a59aa47a68531ff9/FLAG293d1a878
[2019-09-08 13:16:16,765 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9875050de/49699fd137d54219a59aa47a68531ff9
[2019-09-08 13:16:16,775 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-09-08 13:16:16,778 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-09-08 13:16:16,779 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-09-08 13:16:16,779 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-09-08 13:16:16,783 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-09-08 13:16:16,784 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:16:16" (1/1) ...
[2019-09-08 13:16:16,787 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f32035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:16, skipping insertion in model container
[2019-09-08 13:16:16,787 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:16:16" (1/1) ...
[2019-09-08 13:16:16,794 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-09-08 13:16:16,903 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-09-08 13:16:17,679 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-08 13:16:17,697 INFO  L188         MainTranslator]: Completed pre-run
[2019-09-08 13:16:18,139 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-08 13:16:18,162 INFO  L192         MainTranslator]: Completed translation
[2019-09-08 13:16:18,163 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:18 WrapperNode
[2019-09-08 13:16:18,163 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-09-08 13:16:18,164 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-09-08 13:16:18,164 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-09-08 13:16:18,164 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-09-08 13:16:18,178 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:18" (1/1) ...
[2019-09-08 13:16:18,178 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:18" (1/1) ...
[2019-09-08 13:16:18,206 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:18" (1/1) ...
[2019-09-08 13:16:18,206 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:18" (1/1) ...
[2019-09-08 13:16:18,251 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:18" (1/1) ...
[2019-09-08 13:16:18,283 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:18" (1/1) ...
[2019-09-08 13:16:18,294 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:18" (1/1) ...
[2019-09-08 13:16:18,308 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-09-08 13:16:18,309 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-09-08 13:16:18,309 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-09-08 13:16:18,310 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-09-08 13:16:18,311 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:18" (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-09-08 13:16:18,374 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-09-08 13:16:18,375 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-09-08 13:16:18,375 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-09-08 13:16:18,375 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-09-08 13:16:18,375 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char
[2019-09-08 13:16:18,376 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar
[2019-09-08 13:16:18,376 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool
[2019-09-08 13:16:18,376 INFO  L130     BoogieDeclarations]: Found specification of procedure assert
[2019-09-08 13:16:18,376 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assume
[2019-09-08 13:16:18,376 INFO  L130     BoogieDeclarations]: Found specification of procedure read
[2019-09-08 13:16:18,377 INFO  L130     BoogieDeclarations]: Found specification of procedure write
[2019-09-08 13:16:18,377 INFO  L130     BoogieDeclarations]: Found specification of procedure node1
[2019-09-08 13:16:18,377 INFO  L130     BoogieDeclarations]: Found specification of procedure node2
[2019-09-08 13:16:18,377 INFO  L130     BoogieDeclarations]: Found specification of procedure node3
[2019-09-08 13:16:18,377 INFO  L130     BoogieDeclarations]: Found specification of procedure node4
[2019-09-08 13:16:18,378 INFO  L130     BoogieDeclarations]: Found specification of procedure init
[2019-09-08 13:16:18,378 INFO  L130     BoogieDeclarations]: Found specification of procedure check
[2019-09-08 13:16:18,378 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-09-08 13:16:18,378 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-09-08 13:16:18,378 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-09-08 13:16:20,808 INFO  L278             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-09-08 13:16:20,810 INFO  L283             CfgBuilder]: Removed 0 assume(true) statements.
[2019-09-08 13:16:20,812 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:16:20 BoogieIcfgContainer
[2019-09-08 13:16:20,813 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-09-08 13:16:20,814 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-09-08 13:16:20,814 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-09-08 13:16:20,817 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-09-08 13:16:20,818 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:16:16" (1/3) ...
[2019-09-08 13:16:20,819 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5585a407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:16:20, skipping insertion in model container
[2019-09-08 13:16:20,819 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:18" (2/3) ...
[2019-09-08 13:16:20,820 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5585a407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:16:20, skipping insertion in model container
[2019-09-08 13:16:20,820 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:16:20" (3/3) ...
[2019-09-08 13:16:20,826 INFO  L109   eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c
[2019-09-08 13:16:20,838 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-09-08 13:16:20,860 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2019-09-08 13:16:20,877 INFO  L252      AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2019-09-08 13:16:20,925 INFO  L128   ementStrategyFactory]: Using default assertion order modulation
[2019-09-08 13:16:20,926 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2019-09-08 13:16:20,926 INFO  L378      AbstractCegarLoop]: Hoare is true
[2019-09-08 13:16:20,926 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-09-08 13:16:20,926 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-09-08 13:16:20,927 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-09-08 13:16:20,927 INFO  L382      AbstractCegarLoop]: Difference is false
[2019-09-08 13:16:20,927 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-09-08 13:16:20,927 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-09-08 13:16:20,973 INFO  L276                IsEmpty]: Start isEmpty. Operand 690 states.
[2019-09-08 13:16:21,017 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 252
[2019-09-08 13:16:21,017 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:21,019 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:21,024 INFO  L418      AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:21,030 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:21,030 INFO  L82        PathProgramCache]: Analyzing trace with hash 570305456, now seen corresponding path program 1 times
[2019-09-08 13:16:21,032 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:21,034 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:21,088 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:21,089 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:21,089 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:21,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:22,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:22,320 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:22,320 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 13:16:22,325 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 13:16:22,339 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 13:16:22,341 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 13:16:22,343 INFO  L87              Difference]: Start difference. First operand 690 states. Second operand 4 states.
[2019-09-08 13:16:22,717 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:22,718 INFO  L93              Difference]: Finished difference Result 2023 states and 3609 transitions.
[2019-09-08 13:16:22,718 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 13:16:22,720 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 251
[2019-09-08 13:16:22,722 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:22,753 INFO  L225             Difference]: With dead ends: 2023
[2019-09-08 13:16:22,753 INFO  L226             Difference]: Without dead ends: 1340
[2019-09-08 13:16:22,767 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-09-08 13:16:22,791 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1340 states.
[2019-09-08 13:16:22,944 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1302.
[2019-09-08 13:16:22,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1302 states.
[2019-09-08 13:16:22,953 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 2029 transitions.
[2019-09-08 13:16:22,955 INFO  L78                 Accepts]: Start accepts. Automaton has 1302 states and 2029 transitions. Word has length 251
[2019-09-08 13:16:22,957 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:22,957 INFO  L475      AbstractCegarLoop]: Abstraction has 1302 states and 2029 transitions.
[2019-09-08 13:16:22,958 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 13:16:22,958 INFO  L276                IsEmpty]: Start isEmpty. Operand 1302 states and 2029 transitions.
[2019-09-08 13:16:22,967 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2019-09-08 13:16:22,967 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:22,968 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:22,968 INFO  L418      AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:22,969 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:22,969 INFO  L82        PathProgramCache]: Analyzing trace with hash 2110666408, now seen corresponding path program 1 times
[2019-09-08 13:16:22,969 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:22,970 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:22,974 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:22,974 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:22,974 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:23,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:23,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:23,335 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:23,335 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:16:23,339 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:16:23,340 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:16:23,341 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:16:23,341 INFO  L87              Difference]: Start difference. First operand 1302 states and 2029 transitions. Second operand 3 states.
[2019-09-08 13:16:23,502 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:23,503 INFO  L93              Difference]: Finished difference Result 3726 states and 5777 transitions.
[2019-09-08 13:16:23,503 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:16:23,503 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 253
[2019-09-08 13:16:23,505 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:23,518 INFO  L225             Difference]: With dead ends: 3726
[2019-09-08 13:16:23,518 INFO  L226             Difference]: Without dead ends: 2553
[2019-09-08 13:16:23,522 INFO  L628         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-09-08 13:16:23,526 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2553 states.
[2019-09-08 13:16:23,618 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2517.
[2019-09-08 13:16:23,618 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2517 states.
[2019-09-08 13:16:23,631 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3909 transitions.
[2019-09-08 13:16:23,632 INFO  L78                 Accepts]: Start accepts. Automaton has 2517 states and 3909 transitions. Word has length 253
[2019-09-08 13:16:23,636 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:23,636 INFO  L475      AbstractCegarLoop]: Abstraction has 2517 states and 3909 transitions.
[2019-09-08 13:16:23,636 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:16:23,636 INFO  L276                IsEmpty]: Start isEmpty. Operand 2517 states and 3909 transitions.
[2019-09-08 13:16:23,644 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2019-09-08 13:16:23,645 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:23,647 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:23,647 INFO  L418      AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:23,647 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:23,648 INFO  L82        PathProgramCache]: Analyzing trace with hash -230602365, now seen corresponding path program 1 times
[2019-09-08 13:16:23,650 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:23,650 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:23,652 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:23,652 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:23,653 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:23,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:23,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:23,764 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:23,764 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:16:23,765 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:16:23,765 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:16:23,766 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:16:23,766 INFO  L87              Difference]: Start difference. First operand 2517 states and 3909 transitions. Second operand 3 states.
[2019-09-08 13:16:24,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:24,005 INFO  L93              Difference]: Finished difference Result 7476 states and 11603 transitions.
[2019-09-08 13:16:24,006 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:16:24,006 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 253
[2019-09-08 13:16:24,006 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:24,031 INFO  L225             Difference]: With dead ends: 7476
[2019-09-08 13:16:24,031 INFO  L226             Difference]: Without dead ends: 5001
[2019-09-08 13:16:24,038 INFO  L628         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-09-08 13:16:24,045 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5001 states.
[2019-09-08 13:16:24,161 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 2536.
[2019-09-08 13:16:24,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2536 states.
[2019-09-08 13:16:24,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3937 transitions.
[2019-09-08 13:16:24,172 INFO  L78                 Accepts]: Start accepts. Automaton has 2536 states and 3937 transitions. Word has length 253
[2019-09-08 13:16:24,172 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:24,172 INFO  L475      AbstractCegarLoop]: Abstraction has 2536 states and 3937 transitions.
[2019-09-08 13:16:24,172 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:16:24,172 INFO  L276                IsEmpty]: Start isEmpty. Operand 2536 states and 3937 transitions.
[2019-09-08 13:16:24,179 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2019-09-08 13:16:24,179 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:24,179 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:24,180 INFO  L418      AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:24,180 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:24,180 INFO  L82        PathProgramCache]: Analyzing trace with hash 1570357102, now seen corresponding path program 1 times
[2019-09-08 13:16:24,180 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:24,181 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:24,182 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:24,182 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:24,182 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:24,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:24,286 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:24,287 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:24,287 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:16:24,288 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:16:24,288 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:16:24,288 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:16:24,288 INFO  L87              Difference]: Start difference. First operand 2536 states and 3937 transitions. Second operand 3 states.
[2019-09-08 13:16:24,544 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:24,545 INFO  L93              Difference]: Finished difference Result 7495 states and 11624 transitions.
[2019-09-08 13:16:24,545 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:16:24,546 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 254
[2019-09-08 13:16:24,546 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:24,578 INFO  L225             Difference]: With dead ends: 7495
[2019-09-08 13:16:24,579 INFO  L226             Difference]: Without dead ends: 5019
[2019-09-08 13:16:24,587 INFO  L628         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-09-08 13:16:24,597 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5019 states.
[2019-09-08 13:16:24,847 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5019 to 2554.
[2019-09-08 13:16:24,847 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2554 states.
[2019-09-08 13:16:24,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3958 transitions.
[2019-09-08 13:16:24,863 INFO  L78                 Accepts]: Start accepts. Automaton has 2554 states and 3958 transitions. Word has length 254
[2019-09-08 13:16:24,863 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:24,863 INFO  L475      AbstractCegarLoop]: Abstraction has 2554 states and 3958 transitions.
[2019-09-08 13:16:24,863 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:16:24,864 INFO  L276                IsEmpty]: Start isEmpty. Operand 2554 states and 3958 transitions.
[2019-09-08 13:16:24,870 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 256
[2019-09-08 13:16:24,871 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:24,871 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:24,871 INFO  L418      AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:24,872 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:24,872 INFO  L82        PathProgramCache]: Analyzing trace with hash -845935432, now seen corresponding path program 1 times
[2019-09-08 13:16:24,872 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:24,872 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:24,873 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:24,874 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:24,874 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:24,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:25,024 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:25,025 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:25,025 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:16:25,026 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:16:25,026 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:16:25,026 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:16:25,027 INFO  L87              Difference]: Start difference. First operand 2554 states and 3958 transitions. Second operand 3 states.
[2019-09-08 13:16:25,224 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:25,224 INFO  L93              Difference]: Finished difference Result 5165 states and 8046 transitions.
[2019-09-08 13:16:25,225 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:16:25,225 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 255
[2019-09-08 13:16:25,226 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:25,241 INFO  L225             Difference]: With dead ends: 5165
[2019-09-08 13:16:25,242 INFO  L226             Difference]: Without dead ends: 3430
[2019-09-08 13:16:25,247 INFO  L628         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-09-08 13:16:25,251 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3430 states.
[2019-09-08 13:16:25,441 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3062.
[2019-09-08 13:16:25,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3062 states.
[2019-09-08 13:16:25,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 4796 transitions.
[2019-09-08 13:16:25,450 INFO  L78                 Accepts]: Start accepts. Automaton has 3062 states and 4796 transitions. Word has length 255
[2019-09-08 13:16:25,451 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:25,451 INFO  L475      AbstractCegarLoop]: Abstraction has 3062 states and 4796 transitions.
[2019-09-08 13:16:25,451 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:16:25,451 INFO  L276                IsEmpty]: Start isEmpty. Operand 3062 states and 4796 transitions.
[2019-09-08 13:16:25,458 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 256
[2019-09-08 13:16:25,458 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:25,458 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:25,459 INFO  L418      AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:25,459 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:25,459 INFO  L82        PathProgramCache]: Analyzing trace with hash -494342739, now seen corresponding path program 1 times
[2019-09-08 13:16:25,459 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:25,460 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:25,461 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:25,461 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:25,461 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:25,502 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:25,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:25,678 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:25,679 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:16:25,679 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:16:25,679 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:16:25,680 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:16:25,680 INFO  L87              Difference]: Start difference. First operand 3062 states and 4796 transitions. Second operand 3 states.
[2019-09-08 13:16:25,982 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:25,983 INFO  L93              Difference]: Finished difference Result 8726 states and 13611 transitions.
[2019-09-08 13:16:25,983 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:16:25,983 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 255
[2019-09-08 13:16:25,984 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:26,012 INFO  L225             Difference]: With dead ends: 8726
[2019-09-08 13:16:26,012 INFO  L226             Difference]: Without dead ends: 5909
[2019-09-08 13:16:26,020 INFO  L628         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-09-08 13:16:26,027 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5909 states.
[2019-09-08 13:16:26,395 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5909 to 5875.
[2019-09-08 13:16:26,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5875 states.
[2019-09-08 13:16:26,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5875 states to 5875 states and 9146 transitions.
[2019-09-08 13:16:26,414 INFO  L78                 Accepts]: Start accepts. Automaton has 5875 states and 9146 transitions. Word has length 255
[2019-09-08 13:16:26,415 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:26,415 INFO  L475      AbstractCegarLoop]: Abstraction has 5875 states and 9146 transitions.
[2019-09-08 13:16:26,415 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:16:26,415 INFO  L276                IsEmpty]: Start isEmpty. Operand 5875 states and 9146 transitions.
[2019-09-08 13:16:26,427 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 256
[2019-09-08 13:16:26,427 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:26,427 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:26,428 INFO  L418      AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:26,428 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:26,428 INFO  L82        PathProgramCache]: Analyzing trace with hash 797456944, now seen corresponding path program 1 times
[2019-09-08 13:16:26,428 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:26,428 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:26,430 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:26,430 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:26,430 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:26,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:26,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:26,693 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:26,693 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 13:16:26,694 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 13:16:26,694 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 13:16:26,694 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 13:16:26,694 INFO  L87              Difference]: Start difference. First operand 5875 states and 9146 transitions. Second operand 4 states.
[2019-09-08 13:16:27,466 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:27,467 INFO  L93              Difference]: Finished difference Result 16084 states and 24879 transitions.
[2019-09-08 13:16:27,467 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 13:16:27,467 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 255
[2019-09-08 13:16:27,468 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:27,503 INFO  L225             Difference]: With dead ends: 16084
[2019-09-08 13:16:27,503 INFO  L226             Difference]: Without dead ends: 10749
[2019-09-08 13:16:27,515 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-09-08 13:16:27,527 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10749 states.
[2019-09-08 13:16:27,891 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10749 to 6110.
[2019-09-08 13:16:27,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6110 states.
[2019-09-08 13:16:27,915 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6110 states to 6110 states and 9534 transitions.
[2019-09-08 13:16:27,916 INFO  L78                 Accepts]: Start accepts. Automaton has 6110 states and 9534 transitions. Word has length 255
[2019-09-08 13:16:27,916 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:27,916 INFO  L475      AbstractCegarLoop]: Abstraction has 6110 states and 9534 transitions.
[2019-09-08 13:16:27,916 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 13:16:27,917 INFO  L276                IsEmpty]: Start isEmpty. Operand 6110 states and 9534 transitions.
[2019-09-08 13:16:27,929 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 258
[2019-09-08 13:16:27,929 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:27,929 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:27,930 INFO  L418      AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:27,930 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:27,930 INFO  L82        PathProgramCache]: Analyzing trace with hash -1038402649, now seen corresponding path program 1 times
[2019-09-08 13:16:27,930 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:27,930 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:27,932 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:27,932 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:27,932 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:27,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:28,070 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:28,070 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:28,071 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:16:28,071 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:16:28,071 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:16:28,072 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:16:28,072 INFO  L87              Difference]: Start difference. First operand 6110 states and 9534 transitions. Second operand 3 states.
[2019-09-08 13:16:28,737 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:28,737 INFO  L93              Difference]: Finished difference Result 16760 states and 25883 transitions.
[2019-09-08 13:16:28,737 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:16:28,738 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 257
[2019-09-08 13:16:28,738 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:28,765 INFO  L225             Difference]: With dead ends: 16760
[2019-09-08 13:16:28,766 INFO  L226             Difference]: Without dead ends: 11453
[2019-09-08 13:16:28,780 INFO  L628         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-09-08 13:16:28,795 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11453 states.
[2019-09-08 13:16:29,161 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11453 to 6214.
[2019-09-08 13:16:29,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6214 states.
[2019-09-08 13:16:29,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 9677 transitions.
[2019-09-08 13:16:29,194 INFO  L78                 Accepts]: Start accepts. Automaton has 6214 states and 9677 transitions. Word has length 257
[2019-09-08 13:16:29,194 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:29,194 INFO  L475      AbstractCegarLoop]: Abstraction has 6214 states and 9677 transitions.
[2019-09-08 13:16:29,194 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:16:29,195 INFO  L276                IsEmpty]: Start isEmpty. Operand 6214 states and 9677 transitions.
[2019-09-08 13:16:29,209 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 258
[2019-09-08 13:16:29,209 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:29,209 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:29,210 INFO  L418      AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:29,210 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:29,210 INFO  L82        PathProgramCache]: Analyzing trace with hash -83305299, now seen corresponding path program 1 times
[2019-09-08 13:16:29,210 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:29,211 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:29,212 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:29,212 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:29,212 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:29,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:29,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:29,355 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:29,355 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:16:29,356 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:16:29,356 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:16:29,356 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:16:29,357 INFO  L87              Difference]: Start difference. First operand 6214 states and 9677 transitions. Second operand 3 states.
[2019-09-08 13:16:29,908 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:29,909 INFO  L93              Difference]: Finished difference Result 12719 states and 20005 transitions.
[2019-09-08 13:16:29,909 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:16:29,909 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 257
[2019-09-08 13:16:29,910 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:29,930 INFO  L225             Difference]: With dead ends: 12719
[2019-09-08 13:16:29,930 INFO  L226             Difference]: Without dead ends: 8676
[2019-09-08 13:16:29,941 INFO  L628         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-09-08 13:16:29,950 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8676 states.
[2019-09-08 13:16:30,442 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8676 to 8002.
[2019-09-08 13:16:30,443 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8002 states.
[2019-09-08 13:16:30,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8002 states to 8002 states and 12613 transitions.
[2019-09-08 13:16:30,464 INFO  L78                 Accepts]: Start accepts. Automaton has 8002 states and 12613 transitions. Word has length 257
[2019-09-08 13:16:30,465 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:30,465 INFO  L475      AbstractCegarLoop]: Abstraction has 8002 states and 12613 transitions.
[2019-09-08 13:16:30,465 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:16:30,465 INFO  L276                IsEmpty]: Start isEmpty. Operand 8002 states and 12613 transitions.
[2019-09-08 13:16:30,478 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 259
[2019-09-08 13:16:30,478 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:30,478 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:30,479 INFO  L418      AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:30,479 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:30,479 INFO  L82        PathProgramCache]: Analyzing trace with hash 1666901739, now seen corresponding path program 1 times
[2019-09-08 13:16:30,479 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:30,479 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:30,481 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:30,482 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:30,482 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:30,750 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:31,054 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:31,055 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:31,055 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 13:16:31,056 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 13:16:31,056 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 13:16:31,056 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 13:16:31,056 INFO  L87              Difference]: Start difference. First operand 8002 states and 12613 transitions. Second operand 4 states.
[2019-09-08 13:16:32,053 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:32,053 INFO  L93              Difference]: Finished difference Result 23401 states and 36860 transitions.
[2019-09-08 13:16:32,054 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 13:16:32,054 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 258
[2019-09-08 13:16:32,054 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:32,088 INFO  L225             Difference]: With dead ends: 23401
[2019-09-08 13:16:32,088 INFO  L226             Difference]: Without dead ends: 15471
[2019-09-08 13:16:32,107 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-09-08 13:16:32,123 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15471 states.
[2019-09-08 13:16:33,025 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15471 to 15443.
[2019-09-08 13:16:33,025 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15443 states.
[2019-09-08 13:16:33,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15443 states to 15443 states and 24191 transitions.
[2019-09-08 13:16:33,058 INFO  L78                 Accepts]: Start accepts. Automaton has 15443 states and 24191 transitions. Word has length 258
[2019-09-08 13:16:33,058 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:33,059 INFO  L475      AbstractCegarLoop]: Abstraction has 15443 states and 24191 transitions.
[2019-09-08 13:16:33,059 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 13:16:33,059 INFO  L276                IsEmpty]: Start isEmpty. Operand 15443 states and 24191 transitions.
[2019-09-08 13:16:33,078 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 261
[2019-09-08 13:16:33,078 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:33,079 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:33,079 INFO  L418      AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:33,079 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:33,080 INFO  L82        PathProgramCache]: Analyzing trace with hash 508525808, now seen corresponding path program 1 times
[2019-09-08 13:16:33,080 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:33,080 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:33,081 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:33,081 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:33,082 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:33,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:33,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:33,260 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:33,260 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:16:33,261 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:16:33,261 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:16:33,261 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:16:33,261 INFO  L87              Difference]: Start difference. First operand 15443 states and 24191 transitions. Second operand 3 states.
[2019-09-08 13:16:34,958 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:34,959 INFO  L93              Difference]: Finished difference Result 43816 states and 68299 transitions.
[2019-09-08 13:16:34,959 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:16:34,959 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 260
[2019-09-08 13:16:34,959 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:35,015 INFO  L225             Difference]: With dead ends: 43816
[2019-09-08 13:16:35,016 INFO  L226             Difference]: Without dead ends: 29770
[2019-09-08 13:16:35,054 INFO  L628         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-09-08 13:16:35,087 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29770 states.
[2019-09-08 13:16:36,366 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 29744.
[2019-09-08 13:16:36,366 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29744 states.
[2019-09-08 13:16:36,405 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29744 states to 29744 states and 46256 transitions.
[2019-09-08 13:16:36,406 INFO  L78                 Accepts]: Start accepts. Automaton has 29744 states and 46256 transitions. Word has length 260
[2019-09-08 13:16:36,406 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:36,406 INFO  L475      AbstractCegarLoop]: Abstraction has 29744 states and 46256 transitions.
[2019-09-08 13:16:36,406 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:16:36,407 INFO  L276                IsEmpty]: Start isEmpty. Operand 29744 states and 46256 transitions.
[2019-09-08 13:16:36,453 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 261
[2019-09-08 13:16:36,453 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:36,454 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:36,454 INFO  L418      AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:36,454 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:36,454 INFO  L82        PathProgramCache]: Analyzing trace with hash -1042221725, now seen corresponding path program 1 times
[2019-09-08 13:16:36,455 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:36,455 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:36,456 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:36,456 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:36,456 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:36,480 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:36,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:36,585 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:36,585 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:16:36,586 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:16:36,586 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:16:36,587 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:16:36,587 INFO  L87              Difference]: Start difference. First operand 29744 states and 46256 transitions. Second operand 3 states.
[2019-09-08 13:16:39,381 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:39,382 INFO  L93              Difference]: Finished difference Result 84598 states and 131033 transitions.
[2019-09-08 13:16:39,382 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:16:39,382 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 260
[2019-09-08 13:16:39,382 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:39,455 INFO  L225             Difference]: With dead ends: 84598
[2019-09-08 13:16:39,455 INFO  L226             Difference]: Without dead ends: 57269
[2019-09-08 13:16:39,507 INFO  L628         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-09-08 13:16:39,568 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 57269 states.
[2019-09-08 13:16:41,169 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 57269 to 30230.
[2019-09-08 13:16:41,169 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30230 states.
[2019-09-08 13:16:41,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30230 states to 30230 states and 46809 transitions.
[2019-09-08 13:16:41,207 INFO  L78                 Accepts]: Start accepts. Automaton has 30230 states and 46809 transitions. Word has length 260
[2019-09-08 13:16:41,208 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:41,208 INFO  L475      AbstractCegarLoop]: Abstraction has 30230 states and 46809 transitions.
[2019-09-08 13:16:41,208 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:16:41,208 INFO  L276                IsEmpty]: Start isEmpty. Operand 30230 states and 46809 transitions.
[2019-09-08 13:16:41,266 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 262
[2019-09-08 13:16:41,266 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:41,267 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:41,267 INFO  L418      AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:41,268 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:41,268 INFO  L82        PathProgramCache]: Analyzing trace with hash -1840728553, now seen corresponding path program 1 times
[2019-09-08 13:16:41,268 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:41,268 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:41,270 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:41,270 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:41,270 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:41,319 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:41,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:41,429 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:41,429 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:16:41,430 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:16:41,430 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:16:41,431 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:16:41,431 INFO  L87              Difference]: Start difference. First operand 30230 states and 46809 transitions. Second operand 3 states.
[2019-09-08 13:16:43,464 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:43,464 INFO  L93              Difference]: Finished difference Result 67217 states and 106029 transitions.
[2019-09-08 13:16:43,465 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:16:43,465 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 261
[2019-09-08 13:16:43,465 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:43,519 INFO  L225             Difference]: With dead ends: 67217
[2019-09-08 13:16:43,519 INFO  L226             Difference]: Without dead ends: 45394
[2019-09-08 13:16:43,544 INFO  L628         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-09-08 13:16:43,590 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45394 states.
[2019-09-08 13:16:46,387 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45394 to 42438.
[2019-09-08 13:16:46,387 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 42438 states.
[2019-09-08 13:16:46,448 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42438 states to 42438 states and 66633 transitions.
[2019-09-08 13:16:46,449 INFO  L78                 Accepts]: Start accepts. Automaton has 42438 states and 66633 transitions. Word has length 261
[2019-09-08 13:16:46,449 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:46,449 INFO  L475      AbstractCegarLoop]: Abstraction has 42438 states and 66633 transitions.
[2019-09-08 13:16:46,449 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:16:46,449 INFO  L276                IsEmpty]: Start isEmpty. Operand 42438 states and 66633 transitions.
[2019-09-08 13:16:46,469 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 262
[2019-09-08 13:16:46,469 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:46,469 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:46,470 INFO  L418      AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:46,470 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:46,470 INFO  L82        PathProgramCache]: Analyzing trace with hash 1599963507, now seen corresponding path program 1 times
[2019-09-08 13:16:46,470 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:46,471 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:46,472 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:46,472 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:46,472 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:46,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:46,719 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:46,720 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:46,721 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 13:16:46,722 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 13:16:46,722 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 13:16:46,723 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 13:16:46,723 INFO  L87              Difference]: Start difference. First operand 42438 states and 66633 transitions. Second operand 4 states.
[2019-09-08 13:16:48,491 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:48,491 INFO  L93              Difference]: Finished difference Result 77441 states and 121439 transitions.
[2019-09-08 13:16:48,492 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 13:16:48,492 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 261
[2019-09-08 13:16:48,492 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:48,535 INFO  L225             Difference]: With dead ends: 77441
[2019-09-08 13:16:48,536 INFO  L226             Difference]: Without dead ends: 37280
[2019-09-08 13:16:48,584 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-09-08 13:16:48,619 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37280 states.
[2019-09-08 13:16:50,384 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37280 to 37204.
[2019-09-08 13:16:50,385 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37204 states.
[2019-09-08 13:16:50,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 58398 transitions.
[2019-09-08 13:16:50,450 INFO  L78                 Accepts]: Start accepts. Automaton has 37204 states and 58398 transitions. Word has length 261
[2019-09-08 13:16:50,450 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:50,450 INFO  L475      AbstractCegarLoop]: Abstraction has 37204 states and 58398 transitions.
[2019-09-08 13:16:50,450 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 13:16:50,451 INFO  L276                IsEmpty]: Start isEmpty. Operand 37204 states and 58398 transitions.
[2019-09-08 13:16:50,463 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 263
[2019-09-08 13:16:50,463 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:50,463 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:50,463 INFO  L418      AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:50,464 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:50,464 INFO  L82        PathProgramCache]: Analyzing trace with hash 879012584, now seen corresponding path program 1 times
[2019-09-08 13:16:50,464 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:50,464 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:50,465 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:50,465 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:50,465 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:50,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:50,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:50,690 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:50,690 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 13:16:50,690 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 13:16:50,690 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 13:16:50,691 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 13:16:50,691 INFO  L87              Difference]: Start difference. First operand 37204 states and 58398 transitions. Second operand 4 states.
[2019-09-08 13:16:54,419 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:16:54,419 INFO  L93              Difference]: Finished difference Result 103893 states and 162819 transitions.
[2019-09-08 13:16:54,419 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 13:16:54,419 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 262
[2019-09-08 13:16:54,420 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:16:54,496 INFO  L225             Difference]: With dead ends: 103893
[2019-09-08 13:16:54,497 INFO  L226             Difference]: Without dead ends: 68450
[2019-09-08 13:16:54,527 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-09-08 13:16:54,574 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 68450 states.
[2019-09-08 13:16:56,344 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 68450 to 37895.
[2019-09-08 13:16:56,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37895 states.
[2019-09-08 13:16:56,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37895 states to 37895 states and 59547 transitions.
[2019-09-08 13:16:56,683 INFO  L78                 Accepts]: Start accepts. Automaton has 37895 states and 59547 transitions. Word has length 262
[2019-09-08 13:16:56,684 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:16:56,684 INFO  L475      AbstractCegarLoop]: Abstraction has 37895 states and 59547 transitions.
[2019-09-08 13:16:56,684 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 13:16:56,684 INFO  L276                IsEmpty]: Start isEmpty. Operand 37895 states and 59547 transitions.
[2019-09-08 13:16:56,699 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 263
[2019-09-08 13:16:56,699 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:16:56,700 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:16:56,700 INFO  L418      AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:16:56,700 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:16:56,701 INFO  L82        PathProgramCache]: Analyzing trace with hash -1440113269, now seen corresponding path program 1 times
[2019-09-08 13:16:56,701 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:16:56,701 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:16:56,702 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:56,702 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:16:56,702 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:16:56,757 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:16:56,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:16:56,938 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:16:56,938 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:16:56,939 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:16:56,939 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:16:56,939 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:16:56,940 INFO  L87              Difference]: Start difference. First operand 37895 states and 59547 transitions. Second operand 3 states.
[2019-09-08 13:17:01,172 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:17:01,173 INFO  L93              Difference]: Finished difference Result 106851 states and 167544 transitions.
[2019-09-08 13:17:01,173 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:17:01,173 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 262
[2019-09-08 13:17:01,173 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:17:01,257 INFO  L225             Difference]: With dead ends: 106851
[2019-09-08 13:17:01,258 INFO  L226             Difference]: Without dead ends: 70994
[2019-09-08 13:17:01,294 INFO  L628         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-09-08 13:17:01,345 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 70994 states.
[2019-09-08 13:17:04,745 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 70994 to 70970.
[2019-09-08 13:17:04,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 70970 states.
[2019-09-08 13:17:04,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70970 states to 70970 states and 110797 transitions.
[2019-09-08 13:17:04,842 INFO  L78                 Accepts]: Start accepts. Automaton has 70970 states and 110797 transitions. Word has length 262
[2019-09-08 13:17:04,842 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:17:04,842 INFO  L475      AbstractCegarLoop]: Abstraction has 70970 states and 110797 transitions.
[2019-09-08 13:17:04,842 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:17:04,842 INFO  L276                IsEmpty]: Start isEmpty. Operand 70970 states and 110797 transitions.
[2019-09-08 13:17:04,870 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 265
[2019-09-08 13:17:04,870 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:17:04,871 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:17:04,871 INFO  L418      AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:17:04,871 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:17:04,871 INFO  L82        PathProgramCache]: Analyzing trace with hash -2065043887, now seen corresponding path program 1 times
[2019-09-08 13:17:04,871 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:17:04,872 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:17:04,873 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:17:04,873 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:17:04,873 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:17:04,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:17:05,041 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:17:05,042 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:17:05,042 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:17:05,043 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:17:05,044 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:17:05,044 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:17:05,044 INFO  L87              Difference]: Start difference. First operand 70970 states and 110797 transitions. Second operand 3 states.
[2019-09-08 13:17:12,419 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:17:12,419 INFO  L93              Difference]: Finished difference Result 174064 states and 275486 transitions.
[2019-09-08 13:17:12,420 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:17:12,420 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 264
[2019-09-08 13:17:12,420 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:17:12,572 INFO  L225             Difference]: With dead ends: 174064
[2019-09-08 13:17:12,572 INFO  L226             Difference]: Without dead ends: 115093
[2019-09-08 13:17:12,627 INFO  L628         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-09-08 13:17:12,707 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 115093 states.
[2019-09-08 13:17:18,224 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 115093 to 107491.
[2019-09-08 13:17:18,224 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 107491 states.
[2019-09-08 13:17:18,774 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107491 states to 107491 states and 170112 transitions.
[2019-09-08 13:17:18,774 INFO  L78                 Accepts]: Start accepts. Automaton has 107491 states and 170112 transitions. Word has length 264
[2019-09-08 13:17:18,775 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:17:18,775 INFO  L475      AbstractCegarLoop]: Abstraction has 107491 states and 170112 transitions.
[2019-09-08 13:17:18,775 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:17:18,775 INFO  L276                IsEmpty]: Start isEmpty. Operand 107491 states and 170112 transitions.
[2019-09-08 13:17:18,793 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 266
[2019-09-08 13:17:18,794 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:17:18,794 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:17:18,794 INFO  L418      AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:17:18,794 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:17:18,794 INFO  L82        PathProgramCache]: Analyzing trace with hash 1033887376, now seen corresponding path program 1 times
[2019-09-08 13:17:18,795 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:17:18,795 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:17:18,796 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:17:18,796 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:17:18,796 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:17:18,816 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:17:18,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:17:18,899 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:17:18,899 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:17:18,900 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:17:18,900 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:17:18,900 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:17:18,900 INFO  L87              Difference]: Start difference. First operand 107491 states and 170112 transitions. Second operand 3 states.
[2019-09-08 13:17:30,394 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:17:30,395 INFO  L93              Difference]: Finished difference Result 289419 states and 457572 transitions.
[2019-09-08 13:17:30,396 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:17:30,396 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 265
[2019-09-08 13:17:30,396 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:17:30,645 INFO  L225             Difference]: With dead ends: 289419
[2019-09-08 13:17:30,645 INFO  L226             Difference]: Without dead ends: 190210
[2019-09-08 13:17:30,722 INFO  L628         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-09-08 13:17:30,861 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 190210 states.
[2019-09-08 13:17:37,879 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 190210 to 107972.
[2019-09-08 13:17:37,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 107972 states.
[2019-09-08 13:17:38,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107972 states to 107972 states and 170710 transitions.
[2019-09-08 13:17:38,029 INFO  L78                 Accepts]: Start accepts. Automaton has 107972 states and 170710 transitions. Word has length 265
[2019-09-08 13:17:38,029 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:17:38,029 INFO  L475      AbstractCegarLoop]: Abstraction has 107972 states and 170710 transitions.
[2019-09-08 13:17:38,029 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:17:38,029 INFO  L276                IsEmpty]: Start isEmpty. Operand 107972 states and 170710 transitions.
[2019-09-08 13:17:38,050 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 266
[2019-09-08 13:17:38,050 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:17:38,050 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:17:38,051 INFO  L418      AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:17:38,051 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:17:38,051 INFO  L82        PathProgramCache]: Analyzing trace with hash 950455431, now seen corresponding path program 1 times
[2019-09-08 13:17:38,051 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:17:38,051 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:17:38,052 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:17:38,053 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:17:38,053 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:17:38,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:17:38,168 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:17:38,168 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:17:38,168 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:17:38,169 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:17:38,169 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:17:38,169 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:17:38,169 INFO  L87              Difference]: Start difference. First operand 107972 states and 170710 transitions. Second operand 3 states.
[2019-09-08 13:17:51,491 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:17:51,491 INFO  L93              Difference]: Finished difference Result 298260 states and 473745 transitions.
[2019-09-08 13:17:51,492 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:17:51,492 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 265
[2019-09-08 13:17:51,492 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:17:51,779 INFO  L225             Difference]: With dead ends: 298260
[2019-09-08 13:17:51,780 INFO  L226             Difference]: Without dead ends: 203348
[2019-09-08 13:17:51,867 INFO  L628         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-09-08 13:17:52,009 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 203348 states.
[2019-09-08 13:18:07,912 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 203348 to 203005.
[2019-09-08 13:18:07,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 203005 states.
[2019-09-08 13:18:08,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 203005 states to 203005 states and 320661 transitions.
[2019-09-08 13:18:08,254 INFO  L78                 Accepts]: Start accepts. Automaton has 203005 states and 320661 transitions. Word has length 265
[2019-09-08 13:18:08,255 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:18:08,255 INFO  L475      AbstractCegarLoop]: Abstraction has 203005 states and 320661 transitions.
[2019-09-08 13:18:08,255 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:18:08,255 INFO  L276                IsEmpty]: Start isEmpty. Operand 203005 states and 320661 transitions.
[2019-09-08 13:18:08,288 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 266
[2019-09-08 13:18:08,288 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:18:08,288 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:18:08,289 INFO  L418      AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:18:08,289 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:18:08,289 INFO  L82        PathProgramCache]: Analyzing trace with hash 284558754, now seen corresponding path program 1 times
[2019-09-08 13:18:08,289 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:18:08,289 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:18:08,290 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:18:08,291 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:18:08,291 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:18:08,429 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:18:08,679 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:18:08,680 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:18:08,680 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 13:18:08,680 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 13:18:08,681 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 13:18:08,681 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 13:18:08,681 INFO  L87              Difference]: Start difference. First operand 203005 states and 320661 transitions. Second operand 4 states.
[2019-09-08 13:18:34,906 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:18:34,906 INFO  L93              Difference]: Finished difference Result 574837 states and 907940 transitions.
[2019-09-08 13:18:34,907 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 13:18:34,907 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 265
[2019-09-08 13:18:34,907 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:18:35,464 INFO  L225             Difference]: With dead ends: 574837
[2019-09-08 13:18:35,464 INFO  L226             Difference]: Without dead ends: 372050
[2019-09-08 13:18:35,617 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-09-08 13:18:35,906 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 372050 states.
[2019-09-08 13:19:05,461 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 372050 to 372032.
[2019-09-08 13:19:05,462 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 372032 states.
[2019-09-08 13:19:06,095 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 372032 states to 372032 states and 584291 transitions.
[2019-09-08 13:19:06,096 INFO  L78                 Accepts]: Start accepts. Automaton has 372032 states and 584291 transitions. Word has length 265
[2019-09-08 13:19:06,096 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:19:06,096 INFO  L475      AbstractCegarLoop]: Abstraction has 372032 states and 584291 transitions.
[2019-09-08 13:19:06,096 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 13:19:06,097 INFO  L276                IsEmpty]: Start isEmpty. Operand 372032 states and 584291 transitions.
[2019-09-08 13:19:06,159 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 268
[2019-09-08 13:19:06,160 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:19:06,160 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:19:06,160 INFO  L418      AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:19:06,160 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:19:06,160 INFO  L82        PathProgramCache]: Analyzing trace with hash 369652713, now seen corresponding path program 1 times
[2019-09-08 13:19:06,160 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:19:06,161 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:19:06,162 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:19:06,162 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:19:06,162 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:19:06,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:19:06,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:19:06,362 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:19:06,362 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:19:06,363 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:19:06,363 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:19:06,364 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:19:06,364 INFO  L87              Difference]: Start difference. First operand 372032 states and 584291 transitions. Second operand 3 states.
[2019-09-08 13:20:05,172 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:20:05,172 INFO  L93              Difference]: Finished difference Result 1095508 states and 1720256 transitions.
[2019-09-08 13:20:05,173 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:20:05,173 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 267
[2019-09-08 13:20:05,173 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:20:06,301 INFO  L225             Difference]: With dead ends: 1095508
[2019-09-08 13:20:06,301 INFO  L226             Difference]: Without dead ends: 728951
[2019-09-08 13:20:06,575 INFO  L628         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-09-08 13:20:07,123 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 728951 states.
[2019-09-08 13:21:14,588 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 728951 to 728631.
[2019-09-08 13:21:14,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 728631 states.
[2019-09-08 13:21:15,785 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 728631 states to 728631 states and 1138205 transitions.
[2019-09-08 13:21:15,785 INFO  L78                 Accepts]: Start accepts. Automaton has 728631 states and 1138205 transitions. Word has length 267
[2019-09-08 13:21:15,786 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:21:15,786 INFO  L475      AbstractCegarLoop]: Abstraction has 728631 states and 1138205 transitions.
[2019-09-08 13:21:15,786 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 13:21:15,786 INFO  L276                IsEmpty]: Start isEmpty. Operand 728631 states and 1138205 transitions.
[2019-09-08 13:21:15,914 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 269
[2019-09-08 13:21:15,915 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:21:15,915 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:21:15,915 INFO  L418      AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:21:15,915 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:21:15,915 INFO  L82        PathProgramCache]: Analyzing trace with hash 1753616645, now seen corresponding path program 1 times
[2019-09-08 13:21:15,916 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:21:15,916 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:21:15,917 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:21:15,917 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:21:15,917 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:21:15,991 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:21:16,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:21:16,160 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:21:16,160 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 13:21:16,161 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 13:21:16,161 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 13:21:16,161 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 13:21:16,161 INFO  L87              Difference]: Start difference. First operand 728631 states and 1138205 transitions. Second operand 4 states.
[2019-09-08 13:23:10,119 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:23:10,119 INFO  L93              Difference]: Finished difference Result 1935885 states and 3021419 transitions.
[2019-09-08 13:23:10,121 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 13:23:10,121 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 268
[2019-09-08 13:23:10,122 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:23:12,133 INFO  L225             Difference]: With dead ends: 1935885
[2019-09-08 13:23:12,133 INFO  L226             Difference]: Without dead ends: 1233234
[2019-09-08 13:23:12,628 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-09-08 13:23:13,514 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1233234 states.
[2019-09-08 13:24:27,583 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233234 to 716401.
[2019-09-08 13:24:27,583 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 716401 states.
[2019-09-08 13:24:28,807 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 716401 states to 716401 states and 1118691 transitions.
[2019-09-08 13:24:28,807 INFO  L78                 Accepts]: Start accepts. Automaton has 716401 states and 1118691 transitions. Word has length 268
[2019-09-08 13:24:28,807 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 13:24:28,808 INFO  L475      AbstractCegarLoop]: Abstraction has 716401 states and 1118691 transitions.
[2019-09-08 13:24:28,808 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 13:24:28,808 INFO  L276                IsEmpty]: Start isEmpty. Operand 716401 states and 1118691 transitions.
[2019-09-08 13:24:28,931 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 270
[2019-09-08 13:24:28,931 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 13:24:28,931 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:24:28,931 INFO  L418      AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 13:24:28,931 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 13:24:28,932 INFO  L82        PathProgramCache]: Analyzing trace with hash -2043165019, now seen corresponding path program 1 times
[2019-09-08 13:24:28,932 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 13:24:28,932 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 13:24:28,933 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:24:28,933 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 13:24:28,933 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 13:24:28,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 13:24:29,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 13:24:29,141 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 13:24:29,141 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 13:24:29,142 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 13:24:29,142 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 13:24:29,142 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 13:24:29,142 INFO  L87              Difference]: Start difference. First operand 716401 states and 1118691 transitions. Second operand 3 states.
[2019-09-08 13:26:36,527 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 13:26:36,527 INFO  L93              Difference]: Finished difference Result 2072041 states and 3235388 transitions.
[2019-09-08 13:26:36,527 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 13:26:36,527 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 269
[2019-09-08 13:26:36,528 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 13:26:38,826 INFO  L225             Difference]: With dead ends: 2072041
[2019-09-08 13:26:38,826 INFO  L226             Difference]: Without dead ends: 1373722
[2019-09-08 13:26:39,329 INFO  L628         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-09-08 13:26:40,352 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1373722 states.