/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c


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


This is Ultimate 0.1.24-fb55353
[2019-11-07 01:05:46,484 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-11-07 01:05:46,487 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-11-07 01:05:46,504 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-11-07 01:05:46,505 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-11-07 01:05:46,507 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-11-07 01:05:46,509 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-11-07 01:05:46,521 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-11-07 01:05:46,523 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-11-07 01:05:46,523 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-11-07 01:05:46,525 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-11-07 01:05:46,527 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-11-07 01:05:46,528 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-11-07 01:05:46,531 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-11-07 01:05:46,533 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-11-07 01:05:46,535 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-11-07 01:05:46,537 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-11-07 01:05:46,540 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-11-07 01:05:46,542 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-11-07 01:05:46,543 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-11-07 01:05:46,545 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-11-07 01:05:46,546 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-11-07 01:05:46,547 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-11-07 01:05:46,547 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-11-07 01:05:46,549 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-11-07 01:05:46,550 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-11-07 01:05:46,550 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-11-07 01:05:46,551 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-11-07 01:05:46,551 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-11-07 01:05:46,552 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-11-07 01:05:46,552 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-11-07 01:05:46,553 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-11-07 01:05:46,553 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-11-07 01:05:46,554 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-11-07 01:05:46,555 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-11-07 01:05:46,555 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-11-07 01:05:46,556 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-11-07 01:05:46,556 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-11-07 01:05:46,557 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-11-07 01:05:46,557 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-11-07 01:05:46,558 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-11-07 01:05:46,559 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-11-07 01:05:46,578 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-11-07 01:05:46,579 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-11-07 01:05:46,580 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-11-07 01:05:46,580 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-11-07 01:05:46,581 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-11-07 01:05:46,581 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-11-07 01:05:46,581 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-11-07 01:05:46,581 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-11-07 01:05:46,581 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-11-07 01:05:46,582 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-11-07 01:05:46,583 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-11-07 01:05:46,583 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-11-07 01:05:46,583 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-11-07 01:05:46,584 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-11-07 01:05:46,584 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-11-07 01:05:46,584 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-11-07 01:05:46,584 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-11-07 01:05:46,584 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-11-07 01:05:46,585 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-11-07 01:05:46,585 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-11-07 01:05:46,585 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-11-07 01:05:46,585 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-11-07 01:05:46,586 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-11-07 01:05:46,586 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-11-07 01:05:46,586 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-11-07 01:05:46,586 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-11-07 01:05:46,586 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-11-07 01:05:46,587 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-11-07 01:05:46,587 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES
[2019-11-07 01:05:46,884 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-11-07 01:05:46,897 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-11-07 01:05:46,900 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-11-07 01:05:46,902 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-11-07 01:05:46,902 INFO  L275        PluginConnector]: CDTParser initialized
[2019-11-07 01:05:46,903 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c
[2019-11-07 01:05:46,969 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439dd7800/62548a555241400c8a3b0a76da9b4c8a/FLAG977517eca
[2019-11-07 01:05:47,698 INFO  L306              CDTParser]: Found 1 translation units.
[2019-11-07 01:05:47,700 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c
[2019-11-07 01:05:47,735 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439dd7800/62548a555241400c8a3b0a76da9b4c8a/FLAG977517eca
[2019-11-07 01:05:47,773 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439dd7800/62548a555241400c8a3b0a76da9b4c8a
[2019-11-07 01:05:47,783 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-11-07 01:05:47,785 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-11-07 01:05:47,786 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-11-07 01:05:47,786 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-11-07 01:05:47,789 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-11-07 01:05:47,790 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:47" (1/1) ...
[2019-11-07 01:05:47,793 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@532668cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:47, skipping insertion in model container
[2019-11-07 01:05:47,793 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:47" (1/1) ...
[2019-11-07 01:05:47,801 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-11-07 01:05:47,940 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-11-07 01:05:49,038 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-11-07 01:05:49,061 INFO  L188         MainTranslator]: Completed pre-run
[2019-11-07 01:05:49,365 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-11-07 01:05:49,403 INFO  L192         MainTranslator]: Completed translation
[2019-11-07 01:05:49,404 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:49 WrapperNode
[2019-11-07 01:05:49,405 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-11-07 01:05:49,406 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-11-07 01:05:49,406 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-11-07 01:05:49,406 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-11-07 01:05:49,425 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:49" (1/1) ...
[2019-11-07 01:05:49,426 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:49" (1/1) ...
[2019-11-07 01:05:49,499 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:49" (1/1) ...
[2019-11-07 01:05:49,500 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:49" (1/1) ...
[2019-11-07 01:05:49,595 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:49" (1/1) ...
[2019-11-07 01:05:49,638 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:49" (1/1) ...
[2019-11-07 01:05:49,660 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:49" (1/1) ...
[2019-11-07 01:05:49,685 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-11-07 01:05:49,686 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-11-07 01:05:49,686 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-11-07 01:05:49,686 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-11-07 01:05:49,687 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:49" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-11-07 01:05:49,767 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-11-07 01:05:49,768 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-11-07 01:05:49,768 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-11-07 01:05:49,768 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-11-07 01:05:49,768 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool
[2019-11-07 01:05:49,769 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char
[2019-11-07 01:05:49,770 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar
[2019-11-07 01:05:49,770 INFO  L130     BoogieDeclarations]: Found specification of procedure assert
[2019-11-07 01:05:49,770 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assume
[2019-11-07 01:05:49,771 INFO  L130     BoogieDeclarations]: Found specification of procedure read
[2019-11-07 01:05:49,771 INFO  L130     BoogieDeclarations]: Found specification of procedure write
[2019-11-07 01:05:49,771 INFO  L130     BoogieDeclarations]: Found specification of procedure node1
[2019-11-07 01:05:49,772 INFO  L130     BoogieDeclarations]: Found specification of procedure node2
[2019-11-07 01:05:49,773 INFO  L130     BoogieDeclarations]: Found specification of procedure node3
[2019-11-07 01:05:49,773 INFO  L130     BoogieDeclarations]: Found specification of procedure init
[2019-11-07 01:05:49,773 INFO  L130     BoogieDeclarations]: Found specification of procedure check
[2019-11-07 01:05:49,776 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-11-07 01:05:49,776 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-11-07 01:05:49,776 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-11-07 01:05:52,905 INFO  L279             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-11-07 01:05:52,905 INFO  L284             CfgBuilder]: Removed 0 assume(true) statements.
[2019-11-07 01:05:52,907 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:52 BoogieIcfgContainer
[2019-11-07 01:05:52,907 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-11-07 01:05:52,909 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-11-07 01:05:52,909 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-11-07 01:05:52,912 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-11-07 01:05:52,913 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:05:47" (1/3) ...
[2019-11-07 01:05:52,914 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649906fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:52, skipping insertion in model container
[2019-11-07 01:05:52,914 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:49" (2/3) ...
[2019-11-07 01:05:52,915 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649906fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:52, skipping insertion in model container
[2019-11-07 01:05:52,915 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:52" (3/3) ...
[2019-11-07 01:05:52,921 INFO  L109   eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c
[2019-11-07 01:05:52,931 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-11-07 01:05:52,941 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations.
[2019-11-07 01:05:52,953 INFO  L249      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2019-11-07 01:05:52,985 INFO  L373      AbstractCegarLoop]: Interprodecural is true
[2019-11-07 01:05:52,985 INFO  L374      AbstractCegarLoop]: Hoare is true
[2019-11-07 01:05:52,986 INFO  L375      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-11-07 01:05:52,986 INFO  L376      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-11-07 01:05:52,986 INFO  L377      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-11-07 01:05:52,986 INFO  L378      AbstractCegarLoop]: Difference is false
[2019-11-07 01:05:52,986 INFO  L379      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-11-07 01:05:52,987 INFO  L383      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-11-07 01:05:53,028 INFO  L276                IsEmpty]: Start isEmpty. Operand 1126 states.
[2019-11-07 01:05:53,050 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2019-11-07 01:05:53,050 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-07 01:05:53,051 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-07 01:05:53,054 INFO  L410      AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-07 01:05:53,060 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-07 01:05:53,060 INFO  L82        PathProgramCache]: Analyzing trace with hash 2082146872, now seen corresponding path program 1 times
[2019-11-07 01:05:53,071 INFO  L161   FreeRefinementEngine]: Executing refinement strategy TAIPAN
[2019-11-07 01:05:53,072 INFO  L337   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519498597]
[2019-11-07 01:05:53,072 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-07 01:05:53,410 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-07 01:05:53,702 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-07 01:05:53,702 INFO  L337   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519498597]
[2019-11-07 01:05:53,704 INFO  L218   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-07 01:05:53,704 INFO  L231   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-11-07 01:05:53,706 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022818869]
[2019-11-07 01:05:53,712 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-11-07 01:05:53,713 INFO  L141   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-11-07 01:05:53,728 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-11-07 01:05:53,730 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2019-11-07 01:05:53,732 INFO  L87              Difference]: Start difference. First operand 1126 states. Second operand 6 states.
[2019-11-07 01:05:55,485 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-07 01:05:55,486 INFO  L93              Difference]: Finished difference Result 2122 states and 3724 transitions.
[2019-11-07 01:05:55,486 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-07 01:05:55,488 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 55
[2019-11-07 01:05:55,488 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-07 01:05:55,513 INFO  L225             Difference]: With dead ends: 2122
[2019-11-07 01:05:55,514 INFO  L226             Difference]: Without dead ends: 1429
[2019-11-07 01:05:55,521 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56
[2019-11-07 01:05:55,543 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1429 states.
[2019-11-07 01:05:55,648 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1413.
[2019-11-07 01:05:55,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1413 states.
[2019-11-07 01:05:55,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1913 transitions.
[2019-11-07 01:05:55,658 INFO  L78                 Accepts]: Start accepts. Automaton has 1413 states and 1913 transitions. Word has length 55
[2019-11-07 01:05:55,658 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-07 01:05:55,658 INFO  L462      AbstractCegarLoop]: Abstraction has 1413 states and 1913 transitions.
[2019-11-07 01:05:55,658 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-11-07 01:05:55,659 INFO  L276                IsEmpty]: Start isEmpty. Operand 1413 states and 1913 transitions.
[2019-11-07 01:05:55,663 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2019-11-07 01:05:55,663 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-07 01:05:55,663 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-07 01:05:55,664 INFO  L410      AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-07 01:05:55,664 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-07 01:05:55,664 INFO  L82        PathProgramCache]: Analyzing trace with hash 995005511, now seen corresponding path program 1 times
[2019-11-07 01:05:55,665 INFO  L161   FreeRefinementEngine]: Executing refinement strategy TAIPAN
[2019-11-07 01:05:55,665 INFO  L337   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010386005]
[2019-11-07 01:05:55,665 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-07 01:05:55,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-07 01:05:55,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-07 01:05:55,876 INFO  L337   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010386005]
[2019-11-07 01:05:55,876 INFO  L218   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-07 01:05:55,876 INFO  L231   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-11-07 01:05:55,877 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086817307]
[2019-11-07 01:05:55,878 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-11-07 01:05:55,879 INFO  L141   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-11-07 01:05:55,879 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-11-07 01:05:55,879 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2019-11-07 01:05:55,879 INFO  L87              Difference]: Start difference. First operand 1413 states and 1913 transitions. Second operand 6 states.
[2019-11-07 01:05:57,208 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-07 01:05:57,209 INFO  L93              Difference]: Finished difference Result 3350 states and 4627 transitions.
[2019-11-07 01:05:57,210 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-07 01:05:57,210 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 55
[2019-11-07 01:05:57,210 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-07 01:05:57,224 INFO  L225             Difference]: With dead ends: 3350
[2019-11-07 01:05:57,225 INFO  L226             Difference]: Without dead ends: 2341
[2019-11-07 01:05:57,229 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56
[2019-11-07 01:05:57,233 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2341 states.
[2019-11-07 01:05:57,317 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2321.
[2019-11-07 01:05:57,318 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2321 states.
[2019-11-07 01:05:57,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3206 transitions.
[2019-11-07 01:05:57,327 INFO  L78                 Accepts]: Start accepts. Automaton has 2321 states and 3206 transitions. Word has length 55
[2019-11-07 01:05:57,327 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-07 01:05:57,327 INFO  L462      AbstractCegarLoop]: Abstraction has 2321 states and 3206 transitions.
[2019-11-07 01:05:57,327 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-11-07 01:05:57,328 INFO  L276                IsEmpty]: Start isEmpty. Operand 2321 states and 3206 transitions.
[2019-11-07 01:05:57,331 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2019-11-07 01:05:57,331 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-07 01:05:57,331 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-07 01:05:57,332 INFO  L410      AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-07 01:05:57,332 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-07 01:05:57,332 INFO  L82        PathProgramCache]: Analyzing trace with hash -1195094756, now seen corresponding path program 1 times
[2019-11-07 01:05:57,333 INFO  L161   FreeRefinementEngine]: Executing refinement strategy TAIPAN
[2019-11-07 01:05:57,333 INFO  L337   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887208697]
[2019-11-07 01:05:57,333 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-07 01:05:57,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-07 01:05:57,458 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-07 01:05:57,459 INFO  L337   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887208697]
[2019-11-07 01:05:57,459 INFO  L218   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-07 01:05:57,459 INFO  L231   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-11-07 01:05:57,460 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392820781]
[2019-11-07 01:05:57,460 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-11-07 01:05:57,460 INFO  L141   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-11-07 01:05:57,461 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-11-07 01:05:57,461 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-07 01:05:57,465 INFO  L87              Difference]: Start difference. First operand 2321 states and 3206 transitions. Second operand 5 states.
[2019-11-07 01:05:58,778 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-07 01:05:58,778 INFO  L93              Difference]: Finished difference Result 4811 states and 6730 transitions.
[2019-11-07 01:05:58,779 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-07 01:05:58,779 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 55
[2019-11-07 01:05:58,780 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-07 01:05:58,803 INFO  L225             Difference]: With dead ends: 4811
[2019-11-07 01:05:58,803 INFO  L226             Difference]: Without dead ends: 3583
[2019-11-07 01:05:58,808 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2019-11-07 01:05:58,816 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3583 states.
[2019-11-07 01:05:59,027 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3583 to 3577.
[2019-11-07 01:05:59,027 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3577 states.
[2019-11-07 01:05:59,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4928 transitions.
[2019-11-07 01:05:59,048 INFO  L78                 Accepts]: Start accepts. Automaton has 3577 states and 4928 transitions. Word has length 55
[2019-11-07 01:05:59,048 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-07 01:05:59,048 INFO  L462      AbstractCegarLoop]: Abstraction has 3577 states and 4928 transitions.
[2019-11-07 01:05:59,049 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-11-07 01:05:59,049 INFO  L276                IsEmpty]: Start isEmpty. Operand 3577 states and 4928 transitions.
[2019-11-07 01:05:59,053 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2019-11-07 01:05:59,054 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-07 01:05:59,054 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-07 01:05:59,055 INFO  L410      AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-07 01:05:59,055 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-07 01:05:59,055 INFO  L82        PathProgramCache]: Analyzing trace with hash 103967417, now seen corresponding path program 1 times
[2019-11-07 01:05:59,056 INFO  L161   FreeRefinementEngine]: Executing refinement strategy TAIPAN
[2019-11-07 01:05:59,056 INFO  L337   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144584474]
[2019-11-07 01:05:59,056 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-07 01:05:59,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-07 01:05:59,359 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-07 01:05:59,359 INFO  L337   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144584474]
[2019-11-07 01:05:59,360 INFO  L218   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-07 01:05:59,360 INFO  L231   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2019-11-07 01:05:59,360 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971857124]
[2019-11-07 01:05:59,361 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-11-07 01:05:59,361 INFO  L141   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-11-07 01:05:59,361 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-11-07 01:05:59,362 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2019-11-07 01:05:59,362 INFO  L87              Difference]: Start difference. First operand 3577 states and 4928 transitions. Second operand 9 states.
[2019-11-07 01:06:02,847 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-07 01:06:02,849 INFO  L93              Difference]: Finished difference Result 7800 states and 11355 transitions.
[2019-11-07 01:06:02,849 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2019-11-07 01:06:02,849 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 56
[2019-11-07 01:06:02,850 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-07 01:06:02,888 INFO  L225             Difference]: With dead ends: 7800
[2019-11-07 01:06:02,889 INFO  L226             Difference]: Without dead ends: 7795
[2019-11-07 01:06:02,892 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870
[2019-11-07 01:06:02,903 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7795 states.
[2019-11-07 01:06:03,128 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7795 to 3577.
[2019-11-07 01:06:03,128 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3577 states.
[2019-11-07 01:06:03,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4927 transitions.
[2019-11-07 01:06:03,143 INFO  L78                 Accepts]: Start accepts. Automaton has 3577 states and 4927 transitions. Word has length 56
[2019-11-07 01:06:03,144 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-07 01:06:03,145 INFO  L462      AbstractCegarLoop]: Abstraction has 3577 states and 4927 transitions.
[2019-11-07 01:06:03,145 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-11-07 01:06:03,145 INFO  L276                IsEmpty]: Start isEmpty. Operand 3577 states and 4927 transitions.
[2019-11-07 01:06:03,150 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2019-11-07 01:06:03,150 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-07 01:06:03,150 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-07 01:06:03,151 INFO  L410      AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-07 01:06:03,151 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-07 01:06:03,151 INFO  L82        PathProgramCache]: Analyzing trace with hash -1702566800, now seen corresponding path program 1 times
[2019-11-07 01:06:03,152 INFO  L161   FreeRefinementEngine]: Executing refinement strategy TAIPAN
[2019-11-07 01:06:03,152 INFO  L337   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639715124]
[2019-11-07 01:06:03,152 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-07 01:06:03,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-07 01:06:03,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-07 01:06:03,369 INFO  L337   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639715124]
[2019-11-07 01:06:03,369 INFO  L218   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-07 01:06:03,369 INFO  L231   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2019-11-07 01:06:03,370 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821181560]
[2019-11-07 01:06:03,370 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-11-07 01:06:03,370 INFO  L141   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-11-07 01:06:03,370 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-11-07 01:06:03,371 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2019-11-07 01:06:03,371 INFO  L87              Difference]: Start difference. First operand 3577 states and 4927 transitions. Second operand 9 states.
[2019-11-07 01:06:06,541 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-07 01:06:06,542 INFO  L93              Difference]: Finished difference Result 9669 states and 14060 transitions.
[2019-11-07 01:06:06,542 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2019-11-07 01:06:06,542 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 56
[2019-11-07 01:06:06,543 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-07 01:06:06,583 INFO  L225             Difference]: With dead ends: 9669
[2019-11-07 01:06:06,583 INFO  L226             Difference]: Without dead ends: 8656
[2019-11-07 01:06:06,588 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600
[2019-11-07 01:06:06,598 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8656 states.
[2019-11-07 01:06:06,868 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 3577.
[2019-11-07 01:06:06,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3577 states.
[2019-11-07 01:06:06,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4926 transitions.
[2019-11-07 01:06:06,877 INFO  L78                 Accepts]: Start accepts. Automaton has 3577 states and 4926 transitions. Word has length 56
[2019-11-07 01:06:06,877 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-07 01:06:06,877 INFO  L462      AbstractCegarLoop]: Abstraction has 3577 states and 4926 transitions.
[2019-11-07 01:06:06,877 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-11-07 01:06:06,878 INFO  L276                IsEmpty]: Start isEmpty. Operand 3577 states and 4926 transitions.
[2019-11-07 01:06:06,881 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2019-11-07 01:06:06,881 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-07 01:06:06,881 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-07 01:06:06,882 INFO  L410      AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-07 01:06:06,882 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-07 01:06:06,882 INFO  L82        PathProgramCache]: Analyzing trace with hash 1133124815, now seen corresponding path program 1 times
[2019-11-07 01:06:06,883 INFO  L161   FreeRefinementEngine]: Executing refinement strategy TAIPAN
[2019-11-07 01:06:06,883 INFO  L337   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303644060]
[2019-11-07 01:06:06,883 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-07 01:06:06,919 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-07 01:06:07,045 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-07 01:06:07,045 INFO  L337   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303644060]
[2019-11-07 01:06:07,045 INFO  L218   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-07 01:06:07,046 INFO  L231   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2019-11-07 01:06:07,046 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660515127]
[2019-11-07 01:06:07,046 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 8 states
[2019-11-07 01:06:07,047 INFO  L141   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-11-07 01:06:07,047 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2019-11-07 01:06:07,047 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2019-11-07 01:06:07,047 INFO  L87              Difference]: Start difference. First operand 3577 states and 4926 transitions. Second operand 8 states.
[2019-11-07 01:06:09,513 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-07 01:06:09,514 INFO  L93              Difference]: Finished difference Result 8367 states and 12323 transitions.
[2019-11-07 01:06:09,519 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2019-11-07 01:06:09,519 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 56
[2019-11-07 01:06:09,519 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-07 01:06:09,549 INFO  L225             Difference]: With dead ends: 8367
[2019-11-07 01:06:09,550 INFO  L226             Difference]: Without dead ends: 7101
[2019-11-07 01:06:09,555 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306
[2019-11-07 01:06:09,564 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7101 states.
[2019-11-07 01:06:09,770 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7101 to 3577.
[2019-11-07 01:06:09,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3577 states.
[2019-11-07 01:06:09,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4925 transitions.
[2019-11-07 01:06:09,778 INFO  L78                 Accepts]: Start accepts. Automaton has 3577 states and 4925 transitions. Word has length 56
[2019-11-07 01:06:09,778 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-07 01:06:09,779 INFO  L462      AbstractCegarLoop]: Abstraction has 3577 states and 4925 transitions.
[2019-11-07 01:06:09,783 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2019-11-07 01:06:09,783 INFO  L276                IsEmpty]: Start isEmpty. Operand 3577 states and 4925 transitions.
[2019-11-07 01:06:09,789 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2019-11-07 01:06:09,790 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-07 01:06:09,790 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-07 01:06:09,791 INFO  L410      AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-07 01:06:09,791 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-07 01:06:09,791 INFO  L82        PathProgramCache]: Analyzing trace with hash 609358766, now seen corresponding path program 1 times
[2019-11-07 01:06:09,800 INFO  L161   FreeRefinementEngine]: Executing refinement strategy TAIPAN
[2019-11-07 01:06:09,801 INFO  L337   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27230187]
[2019-11-07 01:06:09,801 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-07 01:06:09,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-07 01:06:09,893 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-07 01:06:09,893 INFO  L337   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27230187]
[2019-11-07 01:06:09,893 INFO  L218   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-07 01:06:09,893 INFO  L231   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-07 01:06:09,894 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691075847]
[2019-11-07 01:06:09,894 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-07 01:06:09,894 INFO  L141   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-11-07 01:06:09,894 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-07 01:06:09,895 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-07 01:06:09,895 INFO  L87              Difference]: Start difference. First operand 3577 states and 4925 transitions. Second operand 3 states.
[2019-11-07 01:06:10,234 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-07 01:06:10,234 INFO  L93              Difference]: Finished difference Result 5469 states and 7836 transitions.
[2019-11-07 01:06:10,235 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-07 01:06:10,235 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 57
[2019-11-07 01:06:10,236 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-07 01:06:10,251 INFO  L225             Difference]: With dead ends: 5469
[2019-11-07 01:06:10,252 INFO  L226             Difference]: Without dead ends: 3990
[2019-11-07 01:06:10,256 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-07 01:06:10,260 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3990 states.
[2019-11-07 01:06:10,497 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3684.
[2019-11-07 01:06:10,497 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3684 states.
[2019-11-07 01:06:10,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 5107 transitions.
[2019-11-07 01:06:10,507 INFO  L78                 Accepts]: Start accepts. Automaton has 3684 states and 5107 transitions. Word has length 57
[2019-11-07 01:06:10,509 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-07 01:06:10,509 INFO  L462      AbstractCegarLoop]: Abstraction has 3684 states and 5107 transitions.
[2019-11-07 01:06:10,509 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-07 01:06:10,509 INFO  L276                IsEmpty]: Start isEmpty. Operand 3684 states and 5107 transitions.
[2019-11-07 01:06:10,513 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2019-11-07 01:06:10,513 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-07 01:06:10,513 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-07 01:06:10,513 INFO  L410      AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-07 01:06:10,514 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-07 01:06:10,514 INFO  L82        PathProgramCache]: Analyzing trace with hash 371035602, now seen corresponding path program 1 times
[2019-11-07 01:06:10,514 INFO  L161   FreeRefinementEngine]: Executing refinement strategy TAIPAN
[2019-11-07 01:06:10,514 INFO  L337   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547525509]
[2019-11-07 01:06:10,514 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-07 01:06:10,567 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-07 01:06:10,641 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-07 01:06:10,641 INFO  L337   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547525509]
[2019-11-07 01:06:10,642 INFO  L218   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-07 01:06:10,642 INFO  L231   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-07 01:06:10,642 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596712412]
[2019-11-07 01:06:10,642 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-07 01:06:10,643 INFO  L141   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-11-07 01:06:10,643 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-07 01:06:10,643 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-07 01:06:10,643 INFO  L87              Difference]: Start difference. First operand 3684 states and 5107 transitions. Second operand 3 states.
[2019-11-07 01:06:10,948 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-07 01:06:10,948 INFO  L93              Difference]: Finished difference Result 6301 states and 9163 transitions.
[2019-11-07 01:06:10,949 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-07 01:06:10,949 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 57
[2019-11-07 01:06:10,949 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-07 01:06:10,958 INFO  L225             Difference]: With dead ends: 6301
[2019-11-07 01:06:10,958 INFO  L226             Difference]: Without dead ends: 4626
[2019-11-07 01:06:10,963 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-07 01:06:10,969 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4626 states.
[2019-11-07 01:06:11,388 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4174.
[2019-11-07 01:06:11,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4174 states.
[2019-11-07 01:06:11,401 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 5875 transitions.
[2019-11-07 01:06:11,401 INFO  L78                 Accepts]: Start accepts. Automaton has 4174 states and 5875 transitions. Word has length 57
[2019-11-07 01:06:11,402 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-07 01:06:11,402 INFO  L462      AbstractCegarLoop]: Abstraction has 4174 states and 5875 transitions.
[2019-11-07 01:06:11,402 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-07 01:06:11,402 INFO  L276                IsEmpty]: Start isEmpty. Operand 4174 states and 5875 transitions.
[2019-11-07 01:06:11,405 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2019-11-07 01:06:11,405 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-07 01:06:11,405 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-07 01:06:11,406 INFO  L410      AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-07 01:06:11,406 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-07 01:06:11,406 INFO  L82        PathProgramCache]: Analyzing trace with hash -369094904, now seen corresponding path program 1 times
[2019-11-07 01:06:11,406 INFO  L161   FreeRefinementEngine]: Executing refinement strategy TAIPAN
[2019-11-07 01:06:11,407 INFO  L337   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461377077]
[2019-11-07 01:06:11,407 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-07 01:06:11,434 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-07 01:06:11,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-07 01:06:11,491 INFO  L337   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461377077]
[2019-11-07 01:06:11,492 INFO  L218   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-07 01:06:11,492 INFO  L231   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-07 01:06:11,493 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034185116]
[2019-11-07 01:06:11,494 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-07 01:06:11,494 INFO  L141   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-11-07 01:06:11,494 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-07 01:06:11,494 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-07 01:06:11,494 INFO  L87              Difference]: Start difference. First operand 4174 states and 5875 transitions. Second operand 3 states.
[2019-11-07 01:06:12,121 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-07 01:06:12,121 INFO  L93              Difference]: Finished difference Result 8364 states and 12201 transitions.
[2019-11-07 01:06:12,122 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-07 01:06:12,122 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 57
[2019-11-07 01:06:12,122 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-07 01:06:12,136 INFO  L225             Difference]: With dead ends: 8364
[2019-11-07 01:06:12,137 INFO  L226             Difference]: Without dead ends: 5370
[2019-11-07 01:06:12,145 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-07 01:06:12,152 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5370 states.
[2019-11-07 01:06:12,667 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5370 to 5368.
[2019-11-07 01:06:12,668 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5368 states.
[2019-11-07 01:06:12,675 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7645 transitions.
[2019-11-07 01:06:12,675 INFO  L78                 Accepts]: Start accepts. Automaton has 5368 states and 7645 transitions. Word has length 57
[2019-11-07 01:06:12,675 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-07 01:06:12,675 INFO  L462      AbstractCegarLoop]: Abstraction has 5368 states and 7645 transitions.
[2019-11-07 01:06:12,676 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-07 01:06:12,676 INFO  L276                IsEmpty]: Start isEmpty. Operand 5368 states and 7645 transitions.
[2019-11-07 01:06:12,678 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2019-11-07 01:06:12,679 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-07 01:06:12,679 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-07 01:06:12,679 INFO  L410      AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-07 01:06:12,679 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-07 01:06:12,680 INFO  L82        PathProgramCache]: Analyzing trace with hash 2011629158, now seen corresponding path program 1 times
[2019-11-07 01:06:12,680 INFO  L161   FreeRefinementEngine]: Executing refinement strategy TAIPAN
[2019-11-07 01:06:12,680 INFO  L337   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533670338]
[2019-11-07 01:06:12,680 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-07 01:06:12,704 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-07 01:06:12,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-07 01:06:12,744 INFO  L337   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533670338]
[2019-11-07 01:06:12,744 INFO  L218   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-07 01:06:12,744 INFO  L231   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-07 01:06:12,744 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699801149]
[2019-11-07 01:06:12,745 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-07 01:06:12,745 INFO  L141   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-11-07 01:06:12,745 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-07 01:06:12,745 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-07 01:06:12,745 INFO  L87              Difference]: Start difference. First operand 5368 states and 7645 transitions. Second operand 3 states.
[2019-11-07 01:06:13,546 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-07 01:06:13,547 INFO  L93              Difference]: Finished difference Result 12677 states and 18597 transitions.
[2019-11-07 01:06:13,547 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-07 01:06:13,547 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 58
[2019-11-07 01:06:13,547 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-07 01:06:13,563 INFO  L225             Difference]: With dead ends: 12677
[2019-11-07 01:06:13,563 INFO  L226             Difference]: Without dead ends: 8089
[2019-11-07 01:06:13,574 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-07 01:06:13,587 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8089 states.
[2019-11-07 01:06:14,214 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8089 to 6379.
[2019-11-07 01:06:14,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6379 states.
[2019-11-07 01:06:14,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6379 states to 6379 states and 9282 transitions.
[2019-11-07 01:06:14,227 INFO  L78                 Accepts]: Start accepts. Automaton has 6379 states and 9282 transitions. Word has length 58
[2019-11-07 01:06:14,227 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-07 01:06:14,227 INFO  L462      AbstractCegarLoop]: Abstraction has 6379 states and 9282 transitions.
[2019-11-07 01:06:14,227 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-07 01:06:14,227 INFO  L276                IsEmpty]: Start isEmpty. Operand 6379 states and 9282 transitions.
[2019-11-07 01:06:14,229 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2019-11-07 01:06:14,230 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-07 01:06:14,230 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-07 01:06:14,230 INFO  L410      AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-07 01:06:14,230 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-07 01:06:14,231 INFO  L82        PathProgramCache]: Analyzing trace with hash 883688950, now seen corresponding path program 1 times
[2019-11-07 01:06:14,231 INFO  L161   FreeRefinementEngine]: Executing refinement strategy TAIPAN
[2019-11-07 01:06:14,231 INFO  L337   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345796298]
[2019-11-07 01:06:14,231 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-07 01:06:14,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-07 01:06:14,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-07 01:06:14,297 INFO  L337   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345796298]
[2019-11-07 01:06:14,298 INFO  L218   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-07 01:06:14,298 INFO  L231   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-07 01:06:14,298 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088311618]
[2019-11-07 01:06:14,298 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-07 01:06:14,299 INFO  L141   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-11-07 01:06:14,299 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-07 01:06:14,299 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-07 01:06:14,299 INFO  L87              Difference]: Start difference. First operand 6379 states and 9282 transitions. Second operand 3 states.
[2019-11-07 01:06:15,401 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-07 01:06:15,401 INFO  L93              Difference]: Finished difference Result 16222 states and 24049 transitions.
[2019-11-07 01:06:15,402 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-07 01:06:15,402 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 58
[2019-11-07 01:06:15,402 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-07 01:06:15,413 INFO  L225             Difference]: With dead ends: 16222
[2019-11-07 01:06:15,413 INFO  L226             Difference]: Without dead ends: 10378
[2019-11-07 01:06:15,423 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-07 01:06:15,432 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10378 states.
[2019-11-07 01:06:16,049 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 8062.
[2019-11-07 01:06:16,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8062 states.
[2019-11-07 01:06:16,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8062 states to 8062 states and 11884 transitions.
[2019-11-07 01:06:16,062 INFO  L78                 Accepts]: Start accepts. Automaton has 8062 states and 11884 transitions. Word has length 58
[2019-11-07 01:06:16,062 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-07 01:06:16,062 INFO  L462      AbstractCegarLoop]: Abstraction has 8062 states and 11884 transitions.
[2019-11-07 01:06:16,062 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-07 01:06:16,063 INFO  L276                IsEmpty]: Start isEmpty. Operand 8062 states and 11884 transitions.
[2019-11-07 01:06:16,065 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2019-11-07 01:06:16,065 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-07 01:06:16,065 INFO  L410         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-07 01:06:16,065 INFO  L410      AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-07 01:06:16,066 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-07 01:06:16,066 INFO  L82        PathProgramCache]: Analyzing trace with hash -550232989, now seen corresponding path program 1 times
[2019-11-07 01:06:16,066 INFO  L161   FreeRefinementEngine]: Executing refinement strategy TAIPAN
[2019-11-07 01:06:16,066 INFO  L337   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728169268]
[2019-11-07 01:06:16,067 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-07 01:06:16,104 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-07 01:06:17,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-07 01:06:17,061 INFO  L337   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728169268]
[2019-11-07 01:06:17,061 INFO  L218   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-07 01:06:17,061 INFO  L231   FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2019-11-07 01:06:17,061 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901220488]
[2019-11-07 01:06:17,062 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 19 states
[2019-11-07 01:06:17,062 INFO  L141   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-11-07 01:06:17,062 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2019-11-07 01:06:17,062 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342
[2019-11-07 01:06:17,062 INFO  L87              Difference]: Start difference. First operand 8062 states and 11884 transitions. Second operand 19 states.
[2019-11-07 01:06:17,271 WARN  L191               SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76
[2019-11-07 01:06:18,188 WARN  L191               SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59
[2019-11-07 01:06:18,424 WARN  L191               SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47
[2019-11-07 01:06:18,596 WARN  L191               SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47