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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.3.ufo.UNBOUNDED.pals.c


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


This is Ultimate 0.1.24-112bae1
[2019-09-10 05:04:21,821 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-09-10 05:04:21,823 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-09-10 05:04:21,834 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-09-10 05:04:21,834 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-09-10 05:04:21,835 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-09-10 05:04:21,837 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-09-10 05:04:21,838 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-09-10 05:04:21,840 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-09-10 05:04:21,841 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-09-10 05:04:21,842 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-09-10 05:04:21,843 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-09-10 05:04:21,843 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-09-10 05:04:21,844 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-09-10 05:04:21,845 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-09-10 05:04:21,846 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-09-10 05:04:21,847 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-09-10 05:04:21,848 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-09-10 05:04:21,850 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-09-10 05:04:21,852 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-09-10 05:04:21,853 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-09-10 05:04:21,854 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-09-10 05:04:21,855 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-09-10 05:04:21,856 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-09-10 05:04:21,858 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-09-10 05:04:21,858 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-09-10 05:04:21,858 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-09-10 05:04:21,859 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-09-10 05:04:21,860 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-09-10 05:04:21,861 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-09-10 05:04:21,861 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-09-10 05:04:21,862 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-09-10 05:04:21,862 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-09-10 05:04:21,863 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-09-10 05:04:21,864 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-09-10 05:04:21,864 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-09-10 05:04:21,865 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-09-10 05:04:21,865 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-09-10 05:04:21,865 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-09-10 05:04:21,866 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-09-10 05:04:21,867 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-09-10 05:04:21,868 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf
[2019-09-10 05:04:21,883 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-09-10 05:04:21,883 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-09-10 05:04:21,883 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2019-09-10 05:04:21,884 INFO  L138        SettingsManager]:  * Log level for plugins=info
[2019-09-10 05:04:21,884 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2019-09-10 05:04:21,884 INFO  L138        SettingsManager]:  * User list type=DISABLED
[2019-09-10 05:04:21,885 INFO  L138        SettingsManager]:  * Ignore calls to and inside polymorphic procedures=false
[2019-09-10 05:04:21,885 INFO  L138        SettingsManager]:  * Ignore calls to recursive procedures=false
[2019-09-10 05:04:21,885 INFO  L136        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2019-09-10 05:04:21,885 INFO  L138        SettingsManager]:  * Abstract domain=IntervalDomain
[2019-09-10 05:04:21,886 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-09-10 05:04:21,886 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-09-10 05:04:21,886 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-09-10 05:04:21,886 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-09-10 05:04:21,887 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-09-10 05:04:21,887 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-09-10 05:04:21,887 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-09-10 05:04:21,887 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-09-10 05:04:21,887 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-09-10 05:04:21,888 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-09-10 05:04:21,888 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-09-10 05:04:21,888 INFO  L138        SettingsManager]:  * Remove goto edges from RCFG=true
[2019-09-10 05:04:21,888 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-09-10 05:04:21,888 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-09-10 05:04:21,889 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-09-10 05:04:21,889 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-09-10 05:04:21,889 INFO  L138        SettingsManager]:  * Trace refinement strategy=TAIPAN
[2019-09-10 05:04:21,889 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-09-10 05:04:21,889 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-09-10 05:04:21,890 INFO  L138        SettingsManager]:  * Abstract interpretation Mode=USE_PREDICATES
[2019-09-10 05:04:21,919 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-09-10 05:04:21,931 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-09-10 05:04:21,934 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-09-10 05:04:21,935 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-09-10 05:04:21,936 INFO  L275        PluginConnector]: CDTParser initialized
[2019-09-10 05:04:21,936 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.3.ufo.UNBOUNDED.pals.c
[2019-09-10 05:04:22,013 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/301f5fdea/35e6ca74e8fe4fc78fd3098f61884bfd/FLAGb71fee779
[2019-09-10 05:04:22,638 INFO  L306              CDTParser]: Found 1 translation units.
[2019-09-10 05:04:22,639 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.3.ufo.UNBOUNDED.pals.c
[2019-09-10 05:04:22,661 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/301f5fdea/35e6ca74e8fe4fc78fd3098f61884bfd/FLAGb71fee779
[2019-09-10 05:04:22,837 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/301f5fdea/35e6ca74e8fe4fc78fd3098f61884bfd
[2019-09-10 05:04:22,845 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-09-10 05:04:22,847 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-09-10 05:04:22,848 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-09-10 05:04:22,849 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-09-10 05:04:22,852 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-09-10 05:04:22,853 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 05:04:22" (1/1) ...
[2019-09-10 05:04:22,856 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772df1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:22, skipping insertion in model container
[2019-09-10 05:04:22,856 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 05:04:22" (1/1) ...
[2019-09-10 05:04:22,865 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-09-10 05:04:22,946 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-09-10 05:04:23,502 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-10 05:04:23,517 INFO  L188         MainTranslator]: Completed pre-run
[2019-09-10 05:04:23,705 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-10 05:04:23,730 INFO  L192         MainTranslator]: Completed translation
[2019-09-10 05:04:23,731 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:23 WrapperNode
[2019-09-10 05:04:23,731 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-09-10 05:04:23,732 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-09-10 05:04:23,732 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-09-10 05:04:23,732 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-09-10 05:04:23,747 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:23" (1/1) ...
[2019-09-10 05:04:23,749 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:23" (1/1) ...
[2019-09-10 05:04:23,792 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:23" (1/1) ...
[2019-09-10 05:04:23,792 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:23" (1/1) ...
[2019-09-10 05:04:23,858 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:23" (1/1) ...
[2019-09-10 05:04:23,883 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:23" (1/1) ...
[2019-09-10 05:04:23,908 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:23" (1/1) ...
[2019-09-10 05:04:23,936 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-09-10 05:04:23,936 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-09-10 05:04:23,937 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-09-10 05:04:23,937 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-09-10 05:04:23,938 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:23" (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-10 05:04:24,017 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-09-10 05:04:24,017 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-09-10 05:04:24,018 INFO  L138     BoogieDeclarations]: Found implementation of procedure node1
[2019-09-10 05:04:24,018 INFO  L138     BoogieDeclarations]: Found implementation of procedure node2
[2019-09-10 05:04:24,018 INFO  L138     BoogieDeclarations]: Found implementation of procedure node3
[2019-09-10 05:04:24,018 INFO  L138     BoogieDeclarations]: Found implementation of procedure node4
[2019-09-10 05:04:24,018 INFO  L138     BoogieDeclarations]: Found implementation of procedure node5
[2019-09-10 05:04:24,019 INFO  L138     BoogieDeclarations]: Found implementation of procedure init
[2019-09-10 05:04:24,019 INFO  L138     BoogieDeclarations]: Found implementation of procedure check
[2019-09-10 05:04:24,019 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-09-10 05:04:24,019 INFO  L138     BoogieDeclarations]: Found implementation of procedure assert
[2019-09-10 05:04:24,020 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-09-10 05:04:24,020 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char
[2019-09-10 05:04:24,021 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar
[2019-09-10 05:04:24,021 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool
[2019-09-10 05:04:24,022 INFO  L130     BoogieDeclarations]: Found specification of procedure assert
[2019-09-10 05:04:24,022 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assume
[2019-09-10 05:04:24,022 INFO  L130     BoogieDeclarations]: Found specification of procedure read
[2019-09-10 05:04:24,023 INFO  L130     BoogieDeclarations]: Found specification of procedure write
[2019-09-10 05:04:24,023 INFO  L130     BoogieDeclarations]: Found specification of procedure node1
[2019-09-10 05:04:24,023 INFO  L130     BoogieDeclarations]: Found specification of procedure node2
[2019-09-10 05:04:24,023 INFO  L130     BoogieDeclarations]: Found specification of procedure node3
[2019-09-10 05:04:24,023 INFO  L130     BoogieDeclarations]: Found specification of procedure node4
[2019-09-10 05:04:24,024 INFO  L130     BoogieDeclarations]: Found specification of procedure node5
[2019-09-10 05:04:24,024 INFO  L130     BoogieDeclarations]: Found specification of procedure init
[2019-09-10 05:04:24,024 INFO  L130     BoogieDeclarations]: Found specification of procedure check
[2019-09-10 05:04:24,025 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-09-10 05:04:24,025 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-09-10 05:04:24,025 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-09-10 05:04:26,768 INFO  L278             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-09-10 05:04:26,769 INFO  L283             CfgBuilder]: Removed 1 assume(true) statements.
[2019-09-10 05:04:26,771 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 05:04:26 BoogieIcfgContainer
[2019-09-10 05:04:26,771 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-09-10 05:04:26,772 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-09-10 05:04:26,772 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-09-10 05:04:26,775 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-09-10 05:04:26,775 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 05:04:22" (1/3) ...
[2019-09-10 05:04:26,776 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1549d60e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 05:04:26, skipping insertion in model container
[2019-09-10 05:04:26,776 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:23" (2/3) ...
[2019-09-10 05:04:26,777 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1549d60e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 05:04:26, skipping insertion in model container
[2019-09-10 05:04:26,777 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 05:04:26" (3/3) ...
[2019-09-10 05:04:26,779 INFO  L109   eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.3.ufo.UNBOUNDED.pals.c
[2019-09-10 05:04:26,789 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-09-10 05:04:26,799 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-09-10 05:04:26,818 INFO  L252      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-09-10 05:04:26,847 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2019-09-10 05:04:26,847 INFO  L378      AbstractCegarLoop]: Hoare is false
[2019-09-10 05:04:26,848 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-09-10 05:04:26,848 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-09-10 05:04:26,848 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-09-10 05:04:26,848 INFO  L382      AbstractCegarLoop]: Difference is false
[2019-09-10 05:04:26,848 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-09-10 05:04:26,848 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-09-10 05:04:26,886 INFO  L276                IsEmpty]: Start isEmpty. Operand 776 states.
[2019-09-10 05:04:26,919 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 182
[2019-09-10 05:04:26,919 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 05:04:26,920 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]
[2019-09-10 05:04:26,923 INFO  L418      AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 05:04:26,929 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 05:04:26,929 INFO  L82        PathProgramCache]: Analyzing trace with hash -1090629948, now seen corresponding path program 1 times
[2019-09-10 05:04:26,932 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 05:04:27,002 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:04:27,002 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 05:04:27,002 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:04:27,003 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 05:04:27,389 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 05:04:27,766 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-10 05:04:27,769 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-10 05:04:27,769 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-10 05:04:27,769 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-09-10 05:04:27,776 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-10 05:04:27,792 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-10 05:04:27,793 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-10 05:04:27,796 INFO  L87              Difference]: Start difference. First operand 776 states. Second operand 5 states.
[2019-09-10 05:04:28,155 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 05:04:28,155 INFO  L93              Difference]: Finished difference Result 775 states and 1398 transitions.
[2019-09-10 05:04:28,156 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-10 05:04:28,158 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 181
[2019-09-10 05:04:28,160 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 05:04:28,196 INFO  L225             Difference]: With dead ends: 775
[2019-09-10 05:04:28,197 INFO  L226             Difference]: Without dead ends: 771
[2019-09-10 05:04:28,201 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2019-09-10 05:04:28,224 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 771 states.
[2019-09-10 05:04:28,309 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771.
[2019-09-10 05:04:28,311 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 771 states.
[2019-09-10 05:04:28,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1330 transitions.
[2019-09-10 05:04:28,317 INFO  L78                 Accepts]: Start accepts. Automaton has 771 states and 1330 transitions. Word has length 181
[2019-09-10 05:04:28,318 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-10 05:04:28,318 INFO  L475      AbstractCegarLoop]: Abstraction has 771 states and 1330 transitions.
[2019-09-10 05:04:28,319 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-10 05:04:28,319 INFO  L276                IsEmpty]: Start isEmpty. Operand 771 states and 1330 transitions.
[2019-09-10 05:04:28,324 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 246
[2019-09-10 05:04:28,324 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 05:04:28,325 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]
[2019-09-10 05:04:28,325 INFO  L418      AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 05:04:28,326 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 05:04:28,326 INFO  L82        PathProgramCache]: Analyzing trace with hash 1965304482, now seen corresponding path program 1 times
[2019-09-10 05:04:28,326 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 05:04:28,328 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:04:28,328 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 05:04:28,329 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:04:28,329 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 05:04:28,605 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 05:04:29,148 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-10 05:04:29,149 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-10 05:04:29,149 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-09-10 05:04:29,149 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-09-10 05:04:29,151 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-09-10 05:04:29,152 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-09-10 05:04:29,152 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156
[2019-09-10 05:04:29,153 INFO  L87              Difference]: Start difference. First operand 771 states and 1330 transitions. Second operand 13 states.
[2019-09-10 05:04:45,787 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 05:04:45,788 INFO  L93              Difference]: Finished difference Result 3368 states and 5629 transitions.
[2019-09-10 05:04:45,788 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. 
[2019-09-10 05:04:45,788 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 245
[2019-09-10 05:04:45,791 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 05:04:45,812 INFO  L225             Difference]: With dead ends: 3368
[2019-09-10 05:04:45,812 INFO  L226             Difference]: Without dead ends: 3368
[2019-09-10 05:04:45,815 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652
[2019-09-10 05:04:45,821 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3368 states.
[2019-09-10 05:04:45,895 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 1845.
[2019-09-10 05:04:45,896 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1845 states.
[2019-09-10 05:04:45,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 3108 transitions.
[2019-09-10 05:04:45,906 INFO  L78                 Accepts]: Start accepts. Automaton has 1845 states and 3108 transitions. Word has length 245
[2019-09-10 05:04:45,908 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-10 05:04:45,908 INFO  L475      AbstractCegarLoop]: Abstraction has 1845 states and 3108 transitions.
[2019-09-10 05:04:45,908 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-09-10 05:04:45,908 INFO  L276                IsEmpty]: Start isEmpty. Operand 1845 states and 3108 transitions.
[2019-09-10 05:04:45,915 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2019-09-10 05:04:45,915 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 05:04:45,918 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]
[2019-09-10 05:04:45,919 INFO  L418      AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 05:04:45,919 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 05:04:45,919 INFO  L82        PathProgramCache]: Analyzing trace with hash -274859823, now seen corresponding path program 1 times
[2019-09-10 05:04:45,920 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 05:04:45,922 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:04:45,923 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 05:04:45,923 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:04:45,923 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 05:04:46,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 05:04:46,324 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-10 05:04:46,324 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-10 05:04:46,325 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-10 05:04:46,325 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-09-10 05:04:46,326 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-10 05:04:46,326 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-10 05:04:46,326 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-09-10 05:04:46,327 INFO  L87              Difference]: Start difference. First operand 1845 states and 3108 transitions. Second operand 6 states.
[2019-09-10 05:04:50,682 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 05:04:50,682 INFO  L93              Difference]: Finished difference Result 3155 states and 5262 transitions.
[2019-09-10 05:04:50,683 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2019-09-10 05:04:50,683 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 246
[2019-09-10 05:04:50,685 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 05:04:50,715 INFO  L225             Difference]: With dead ends: 3155
[2019-09-10 05:04:50,716 INFO  L226             Difference]: Without dead ends: 3155
[2019-09-10 05:04:50,717 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110
[2019-09-10 05:04:50,722 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3155 states.
[2019-09-10 05:04:50,827 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 2934.
[2019-09-10 05:04:50,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2934 states.
[2019-09-10 05:04:50,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 4901 transitions.
[2019-09-10 05:04:50,842 INFO  L78                 Accepts]: Start accepts. Automaton has 2934 states and 4901 transitions. Word has length 246
[2019-09-10 05:04:50,843 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-10 05:04:50,844 INFO  L475      AbstractCegarLoop]: Abstraction has 2934 states and 4901 transitions.
[2019-09-10 05:04:50,844 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-10 05:04:50,844 INFO  L276                IsEmpty]: Start isEmpty. Operand 2934 states and 4901 transitions.
[2019-09-10 05:04:50,852 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 248
[2019-09-10 05:04:50,853 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 05:04:50,853 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]
[2019-09-10 05:04:50,854 INFO  L418      AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 05:04:50,854 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 05:04:50,854 INFO  L82        PathProgramCache]: Analyzing trace with hash -1052161479, now seen corresponding path program 1 times
[2019-09-10 05:04:50,855 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 05:04:50,856 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:04:50,857 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 05:04:50,857 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:04:50,857 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 05:04:50,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 05:04:51,264 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-10 05:04:51,264 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-10 05:04:51,264 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-10 05:04:51,264 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-09-10 05:04:51,265 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-10 05:04:51,265 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-10 05:04:51,266 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2019-09-10 05:04:51,266 INFO  L87              Difference]: Start difference. First operand 2934 states and 4901 transitions. Second operand 6 states.
[2019-09-10 05:04:55,195 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 05:04:55,195 INFO  L93              Difference]: Finished difference Result 4695 states and 7775 transitions.
[2019-09-10 05:04:55,196 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2019-09-10 05:04:55,196 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 247
[2019-09-10 05:04:55,197 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 05:04:55,224 INFO  L225             Difference]: With dead ends: 4695
[2019-09-10 05:04:55,224 INFO  L226             Difference]: Without dead ends: 4695
[2019-09-10 05:04:55,225 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90
[2019-09-10 05:04:55,232 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4695 states.
[2019-09-10 05:04:55,333 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 4672.
[2019-09-10 05:04:55,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4672 states.
[2019-09-10 05:04:55,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4672 states to 4672 states and 7747 transitions.
[2019-09-10 05:04:55,352 INFO  L78                 Accepts]: Start accepts. Automaton has 4672 states and 7747 transitions. Word has length 247
[2019-09-10 05:04:55,352 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-10 05:04:55,353 INFO  L475      AbstractCegarLoop]: Abstraction has 4672 states and 7747 transitions.
[2019-09-10 05:04:55,353 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-10 05:04:55,353 INFO  L276                IsEmpty]: Start isEmpty. Operand 4672 states and 7747 transitions.
[2019-09-10 05:04:55,360 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2019-09-10 05:04:55,361 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 05:04:55,361 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]
[2019-09-10 05:04:55,361 INFO  L418      AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 05:04:55,362 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 05:04:55,362 INFO  L82        PathProgramCache]: Analyzing trace with hash 569606024, now seen corresponding path program 1 times
[2019-09-10 05:04:55,362 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 05:04:55,363 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:04:55,364 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 05:04:55,364 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:04:55,364 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 05:04:55,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 05:04:55,644 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-10 05:04:55,645 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-10 05:04:55,645 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-10 05:04:55,645 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-09-10 05:04:55,646 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-10 05:04:55,646 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-10 05:04:55,647 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-10 05:04:55,647 INFO  L87              Difference]: Start difference. First operand 4672 states and 7747 transitions. Second operand 6 states.
[2019-09-10 05:05:01,079 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 05:05:01,079 INFO  L93              Difference]: Finished difference Result 20901 states and 34362 transitions.
[2019-09-10 05:05:01,087 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-10 05:05:01,088 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 248
[2019-09-10 05:05:01,088 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 05:05:01,268 INFO  L225             Difference]: With dead ends: 20901
[2019-09-10 05:05:01,268 INFO  L226             Difference]: Without dead ends: 20901
[2019-09-10 05:05:01,269 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2019-09-10 05:05:01,294 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20901 states.
[2019-09-10 05:05:01,733 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20901 to 20855.
[2019-09-10 05:05:01,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20855 states.
[2019-09-10 05:05:01,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20855 states to 20855 states and 34282 transitions.
[2019-09-10 05:05:01,788 INFO  L78                 Accepts]: Start accepts. Automaton has 20855 states and 34282 transitions. Word has length 248
[2019-09-10 05:05:01,788 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-10 05:05:01,788 INFO  L475      AbstractCegarLoop]: Abstraction has 20855 states and 34282 transitions.
[2019-09-10 05:05:01,788 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-10 05:05:01,789 INFO  L276                IsEmpty]: Start isEmpty. Operand 20855 states and 34282 transitions.
[2019-09-10 05:05:01,798 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 250
[2019-09-10 05:05:01,798 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 05:05:01,799 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]
[2019-09-10 05:05:01,799 INFO  L418      AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 05:05:01,799 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 05:05:01,801 INFO  L82        PathProgramCache]: Analyzing trace with hash -746893872, now seen corresponding path program 1 times
[2019-09-10 05:05:01,801 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 05:05:01,807 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:05:01,807 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 05:05:01,807 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:05:01,808 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 05:05:01,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 05:05:02,142 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-10 05:05:02,142 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-10 05:05:02,143 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-10 05:05:02,143 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-09-10 05:05:02,143 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-10 05:05:02,144 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-10 05:05:02,144 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-10 05:05:02,144 INFO  L87              Difference]: Start difference. First operand 20855 states and 34282 transitions. Second operand 6 states.
[2019-09-10 05:05:07,611 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 05:05:07,611 INFO  L93              Difference]: Finished difference Result 101582 states and 166587 transitions.
[2019-09-10 05:05:07,612 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-10 05:05:07,612 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 249
[2019-09-10 05:05:07,613 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 05:05:09,090 INFO  L225             Difference]: With dead ends: 101582
[2019-09-10 05:05:09,091 INFO  L226             Difference]: Without dead ends: 101582
[2019-09-10 05:05:09,092 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2019-09-10 05:05:09,192 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 101582 states.
[2019-09-10 05:05:11,232 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 101582 to 101384.
[2019-09-10 05:05:11,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 101384 states.
[2019-09-10 05:05:11,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101384 states to 101384 states and 166203 transitions.
[2019-09-10 05:05:11,532 INFO  L78                 Accepts]: Start accepts. Automaton has 101384 states and 166203 transitions. Word has length 249
[2019-09-10 05:05:11,532 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-10 05:05:11,533 INFO  L475      AbstractCegarLoop]: Abstraction has 101384 states and 166203 transitions.
[2019-09-10 05:05:11,533 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-10 05:05:11,533 INFO  L276                IsEmpty]: Start isEmpty. Operand 101384 states and 166203 transitions.
[2019-09-10 05:05:11,544 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2019-09-10 05:05:11,545 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 05:05:11,545 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]
[2019-09-10 05:05:11,545 INFO  L418      AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 05:05:11,546 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 05:05:11,546 INFO  L82        PathProgramCache]: Analyzing trace with hash 1339597375, now seen corresponding path program 1 times
[2019-09-10 05:05:11,546 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 05:05:11,547 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:05:11,548 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 05:05:11,548 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:05:11,548 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 05:05:11,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 05:05:11,805 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-10 05:05:11,805 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-10 05:05:11,806 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-10 05:05:11,806 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-09-10 05:05:11,807 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-10 05:05:11,807 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-10 05:05:11,808 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-10 05:05:11,808 INFO  L87              Difference]: Start difference. First operand 101384 states and 166203 transitions. Second operand 6 states.
[2019-09-10 05:05:19,667 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 05:05:19,667 INFO  L93              Difference]: Finished difference Result 447821 states and 733079 transitions.
[2019-09-10 05:05:19,668 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-10 05:05:19,668 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 250
[2019-09-10 05:05:19,668 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 05:05:21,114 INFO  L225             Difference]: With dead ends: 447821
[2019-09-10 05:05:21,115 INFO  L226             Difference]: Without dead ends: 447821
[2019-09-10 05:05:21,115 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2019-09-10 05:05:21,463 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 447821 states.
[2019-09-10 05:05:34,897 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 447821 to 446872.
[2019-09-10 05:05:34,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 446872 states.
[2019-09-10 05:05:42,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 446872 states to 446872 states and 731274 transitions.
[2019-09-10 05:05:42,919 INFO  L78                 Accepts]: Start accepts. Automaton has 446872 states and 731274 transitions. Word has length 250
[2019-09-10 05:05:42,919 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-10 05:05:42,919 INFO  L475      AbstractCegarLoop]: Abstraction has 446872 states and 731274 transitions.
[2019-09-10 05:05:42,919 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-10 05:05:42,919 INFO  L276                IsEmpty]: Start isEmpty. Operand 446872 states and 731274 transitions.
[2019-09-10 05:05:42,931 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2019-09-10 05:05:42,931 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 05:05:42,932 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]
[2019-09-10 05:05:42,932 INFO  L418      AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 05:05:42,932 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 05:05:42,933 INFO  L82        PathProgramCache]: Analyzing trace with hash 2033618999, now seen corresponding path program 1 times
[2019-09-10 05:05:42,933 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 05:05:42,934 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:05:42,934 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 05:05:42,935 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:05:42,935 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 05:05:42,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 05:05:43,109 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-10 05:05:43,109 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-10 05:05:43,109 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-10 05:05:43,110 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-09-10 05:05:43,110 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-10 05:05:43,110 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-10 05:05:43,111 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-10 05:05:43,111 INFO  L87              Difference]: Start difference. First operand 446872 states and 731274 transitions. Second operand 4 states.
[2019-09-10 05:05:58,883 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 05:05:58,883 INFO  L93              Difference]: Finished difference Result 1201383 states and 1961488 transitions.
[2019-09-10 05:05:58,884 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-10 05:05:58,884 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 252
[2019-09-10 05:05:58,885 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 05:06:02,770 INFO  L225             Difference]: With dead ends: 1201383
[2019-09-10 05:06:02,770 INFO  L226             Difference]: Without dead ends: 1201383
[2019-09-10 05:06:02,771 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-10 05:06:03,561 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1201383 states.
[2019-09-10 05:06:39,206 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201383 to 1195156.
[2019-09-10 05:06:39,206 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1195156 states.
[2019-09-10 05:06:56,558 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1195156 states to 1195156 states and 1953204 transitions.
[2019-09-10 05:06:56,559 INFO  L78                 Accepts]: Start accepts. Automaton has 1195156 states and 1953204 transitions. Word has length 252
[2019-09-10 05:06:56,559 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-10 05:06:56,559 INFO  L475      AbstractCegarLoop]: Abstraction has 1195156 states and 1953204 transitions.
[2019-09-10 05:06:56,559 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-10 05:06:56,559 INFO  L276                IsEmpty]: Start isEmpty. Operand 1195156 states and 1953204 transitions.
[2019-09-10 05:06:56,571 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2019-09-10 05:06:56,571 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-10 05:06:56,571 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-10 05:06:56,572 INFO  L418      AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-10 05:06:56,572 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-10 05:06:56,572 INFO  L82        PathProgramCache]: Analyzing trace with hash -1175704485, now seen corresponding path program 1 times
[2019-09-10 05:06:56,572 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-09-10 05:06:56,573 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:06:56,574 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-10 05:06:56,574 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-10 05:06:56,574 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-09-10 05:06:56,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-10 05:06:57,017 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-10 05:06:57,017 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-10 05:06:57,017 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-09-10 05:06:57,018 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-09-10 05:07:07,373 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-09-10 05:07:07,374 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-09-10 05:07:07,374 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156
[2019-09-10 05:07:07,374 INFO  L87              Difference]: Start difference. First operand 1195156 states and 1953204 transitions. Second operand 13 states.
[2019-09-10 05:07:47,617 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-10 05:07:47,617 INFO  L93              Difference]: Finished difference Result 1819403 states and 2978387 transitions.
[2019-09-10 05:07:47,617 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. 
[2019-09-10 05:07:47,617 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 253
[2019-09-10 05:07:47,618 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-10 05:07:53,989 INFO  L225             Difference]: With dead ends: 1819403
[2019-09-10 05:07:53,989 INFO  L226             Difference]: Without dead ends: 1819403
[2019-09-10 05:07:53,991 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1733 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=985, Invalid=3985, Unknown=0, NotChecked=0, Total=4970
[2019-09-10 05:07:54,993 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1819403 states.