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


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


This is Ultimate 0.1.24-112bae1
[2019-09-08 08:20:37,996 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-09-08 08:20:37,998 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-09-08 08:20:38,010 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-09-08 08:20:38,010 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-09-08 08:20:38,011 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-09-08 08:20:38,012 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-09-08 08:20:38,014 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-09-08 08:20:38,016 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-09-08 08:20:38,017 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-09-08 08:20:38,018 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-09-08 08:20:38,019 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-09-08 08:20:38,019 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-09-08 08:20:38,020 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-09-08 08:20:38,021 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-09-08 08:20:38,022 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-09-08 08:20:38,023 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-09-08 08:20:38,024 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-09-08 08:20:38,025 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-09-08 08:20:38,027 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-09-08 08:20:38,029 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-09-08 08:20:38,030 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-09-08 08:20:38,031 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-09-08 08:20:38,031 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-09-08 08:20:38,033 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-09-08 08:20:38,034 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-09-08 08:20:38,034 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-09-08 08:20:38,035 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-09-08 08:20:38,035 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-09-08 08:20:38,036 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-09-08 08:20:38,037 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-09-08 08:20:38,037 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-09-08 08:20:38,038 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-09-08 08:20:38,039 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-09-08 08:20:38,040 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-09-08 08:20:38,040 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-09-08 08:20:38,040 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-09-08 08:20:38,041 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-09-08 08:20:38,041 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-09-08 08:20:38,042 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-09-08 08:20:38,042 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-09-08 08:20:38,043 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2019-09-08 08:20:38,061 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-09-08 08:20:38,062 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-09-08 08:20:38,063 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-09-08 08:20:38,063 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-09-08 08:20:38,063 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-09-08 08:20:38,064 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-09-08 08:20:38,064 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-09-08 08:20:38,065 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-09-08 08:20:38,065 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-09-08 08:20:38,065 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-09-08 08:20:38,066 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-09-08 08:20:38,066 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-09-08 08:20:38,066 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-09-08 08:20:38,067 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-09-08 08:20:38,067 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-09-08 08:20:38,067 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-09-08 08:20:38,067 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-09-08 08:20:38,068 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-09-08 08:20:38,068 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-09-08 08:20:38,068 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-09-08 08:20:38,068 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-09-08 08:20:38,069 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-09-08 08:20:38,069 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-09-08 08:20:38,069 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-09-08 08:20:38,069 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-09-08 08:20:38,070 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-09-08 08:20:38,070 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-09-08 08:20:38,070 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-09-08 08:20:38,070 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-09-08 08:20:38,107 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-09-08 08:20:38,119 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-09-08 08:20:38,122 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-09-08 08:20:38,124 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-09-08 08:20:38,124 INFO  L275        PluginConnector]: CDTParser initialized
[2019-09-08 08:20:38,125 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c
[2019-09-08 08:20:38,187 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1443d76c8/85408074ff634099a346afe0f804a206/FLAG9bbcfe4fb
[2019-09-08 08:20:38,749 INFO  L306              CDTParser]: Found 1 translation units.
[2019-09-08 08:20:38,749 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c
[2019-09-08 08:20:38,766 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1443d76c8/85408074ff634099a346afe0f804a206/FLAG9bbcfe4fb
[2019-09-08 08:20:39,040 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1443d76c8/85408074ff634099a346afe0f804a206
[2019-09-08 08:20:39,049 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-09-08 08:20:39,050 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-09-08 08:20:39,051 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-09-08 08:20:39,051 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-09-08 08:20:39,053 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-09-08 08:20:39,054 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:20:39" (1/1) ...
[2019-09-08 08:20:39,057 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5d63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:39, skipping insertion in model container
[2019-09-08 08:20:39,057 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:20:39" (1/1) ...
[2019-09-08 08:20:39,063 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-09-08 08:20:39,120 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-09-08 08:20:39,585 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-08 08:20:39,598 INFO  L188         MainTranslator]: Completed pre-run
[2019-09-08 08:20:39,717 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-08 08:20:39,754 INFO  L192         MainTranslator]: Completed translation
[2019-09-08 08:20:39,754 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:39 WrapperNode
[2019-09-08 08:20:39,755 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-09-08 08:20:39,756 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-09-08 08:20:39,756 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-09-08 08:20:39,756 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-09-08 08:20:39,775 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:39" (1/1) ...
[2019-09-08 08:20:39,775 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:39" (1/1) ...
[2019-09-08 08:20:39,794 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:39" (1/1) ...
[2019-09-08 08:20:39,794 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:39" (1/1) ...
[2019-09-08 08:20:39,832 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:39" (1/1) ...
[2019-09-08 08:20:39,876 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:39" (1/1) ...
[2019-09-08 08:20:39,891 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:39" (1/1) ...
[2019-09-08 08:20:39,907 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-09-08 08:20:39,911 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-09-08 08:20:39,911 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-09-08 08:20:39,911 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-09-08 08:20:39,913 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:39" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-09-08 08:20:39,991 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-09-08 08:20:39,991 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-09-08 08:20:39,992 INFO  L138     BoogieDeclarations]: Found implementation of procedure node1
[2019-09-08 08:20:39,992 INFO  L138     BoogieDeclarations]: Found implementation of procedure node2
[2019-09-08 08:20:39,993 INFO  L138     BoogieDeclarations]: Found implementation of procedure node3
[2019-09-08 08:20:39,993 INFO  L138     BoogieDeclarations]: Found implementation of procedure node4
[2019-09-08 08:20:39,993 INFO  L138     BoogieDeclarations]: Found implementation of procedure init
[2019-09-08 08:20:39,993 INFO  L138     BoogieDeclarations]: Found implementation of procedure check
[2019-09-08 08:20:39,994 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-09-08 08:20:39,994 INFO  L138     BoogieDeclarations]: Found implementation of procedure assert
[2019-09-08 08:20:39,995 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-09-08 08:20:39,995 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char
[2019-09-08 08:20:39,996 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar
[2019-09-08 08:20:39,996 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool
[2019-09-08 08:20:39,997 INFO  L130     BoogieDeclarations]: Found specification of procedure assert
[2019-09-08 08:20:39,997 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assume
[2019-09-08 08:20:40,001 INFO  L130     BoogieDeclarations]: Found specification of procedure read
[2019-09-08 08:20:40,001 INFO  L130     BoogieDeclarations]: Found specification of procedure write
[2019-09-08 08:20:40,001 INFO  L130     BoogieDeclarations]: Found specification of procedure node1
[2019-09-08 08:20:40,002 INFO  L130     BoogieDeclarations]: Found specification of procedure node2
[2019-09-08 08:20:40,002 INFO  L130     BoogieDeclarations]: Found specification of procedure node3
[2019-09-08 08:20:40,002 INFO  L130     BoogieDeclarations]: Found specification of procedure node4
[2019-09-08 08:20:40,002 INFO  L130     BoogieDeclarations]: Found specification of procedure init
[2019-09-08 08:20:40,002 INFO  L130     BoogieDeclarations]: Found specification of procedure check
[2019-09-08 08:20:40,003 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-09-08 08:20:40,003 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-09-08 08:20:40,003 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-09-08 08:20:41,711 INFO  L278             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-09-08 08:20:41,712 INFO  L283             CfgBuilder]: Removed 1 assume(true) statements.
[2019-09-08 08:20:41,713 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:20:41 BoogieIcfgContainer
[2019-09-08 08:20:41,713 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-09-08 08:20:41,714 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-09-08 08:20:41,714 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-09-08 08:20:41,717 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-09-08 08:20:41,718 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:20:39" (1/3) ...
[2019-09-08 08:20:41,718 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbcf3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:20:41, skipping insertion in model container
[2019-09-08 08:20:41,719 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:39" (2/3) ...
[2019-09-08 08:20:41,719 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbcf3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:20:41, skipping insertion in model container
[2019-09-08 08:20:41,719 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:20:41" (3/3) ...
[2019-09-08 08:20:41,721 INFO  L109   eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c
[2019-09-08 08:20:41,729 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-09-08 08:20:41,737 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-09-08 08:20:41,755 INFO  L252      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-09-08 08:20:41,793 INFO  L128   ementStrategyFactory]: Using default assertion order modulation
[2019-09-08 08:20:41,794 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2019-09-08 08:20:41,794 INFO  L378      AbstractCegarLoop]: Hoare is true
[2019-09-08 08:20:41,794 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-09-08 08:20:41,795 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-09-08 08:20:41,795 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-09-08 08:20:41,795 INFO  L382      AbstractCegarLoop]: Difference is false
[2019-09-08 08:20:41,795 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-09-08 08:20:41,795 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-09-08 08:20:41,827 INFO  L276                IsEmpty]: Start isEmpty. Operand 360 states.
[2019-09-08 08:20:41,844 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2019-09-08 08:20:41,844 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:20:41,846 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]
[2019-09-08 08:20:41,847 INFO  L418      AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:20:41,853 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:20:41,854 INFO  L82        PathProgramCache]: Analyzing trace with hash -649329700, now seen corresponding path program 1 times
[2019-09-08 08:20:41,855 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:20:41,856 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:20:41,920 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:41,920 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:20:41,920 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:42,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:20:42,391 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 08:20:42,394 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:20:42,395 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 08:20:42,400 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 08:20:42,415 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 08:20:42,416 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 08:20:42,418 INFO  L87              Difference]: Start difference. First operand 360 states. Second operand 5 states.
[2019-09-08 08:20:42,625 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:20:42,626 INFO  L93              Difference]: Finished difference Result 517 states and 877 transitions.
[2019-09-08 08:20:42,629 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 08:20:42,631 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 102
[2019-09-08 08:20:42,632 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:20:42,649 INFO  L225             Difference]: With dead ends: 517
[2019-09-08 08:20:42,649 INFO  L226             Difference]: Without dead ends: 355
[2019-09-08 08:20:42,655 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-08 08:20:42,676 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 355 states.
[2019-09-08 08:20:42,727 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355.
[2019-09-08 08:20:42,729 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 355 states.
[2019-09-08 08:20:42,732 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 569 transitions.
[2019-09-08 08:20:42,734 INFO  L78                 Accepts]: Start accepts. Automaton has 355 states and 569 transitions. Word has length 102
[2019-09-08 08:20:42,735 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:20:42,735 INFO  L475      AbstractCegarLoop]: Abstraction has 355 states and 569 transitions.
[2019-09-08 08:20:42,735 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 08:20:42,736 INFO  L276                IsEmpty]: Start isEmpty. Operand 355 states and 569 transitions.
[2019-09-08 08:20:42,742 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2019-09-08 08:20:42,743 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:20:42,743 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]
[2019-09-08 08:20:42,743 INFO  L418      AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:20:42,744 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:20:42,744 INFO  L82        PathProgramCache]: Analyzing trace with hash 755856386, now seen corresponding path program 1 times
[2019-09-08 08:20:42,745 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:20:42,745 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:20:42,747 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:42,747 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:20:42,748 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:42,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:20:43,290 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 08:20:43,291 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:20:43,291 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2019-09-08 08:20:43,293 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 11 states
[2019-09-08 08:20:43,294 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2019-09-08 08:20:43,294 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2019-09-08 08:20:43,295 INFO  L87              Difference]: Start difference. First operand 355 states and 569 transitions. Second operand 11 states.
[2019-09-08 08:20:49,745 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:20:49,745 INFO  L93              Difference]: Finished difference Result 1672 states and 2724 transitions.
[2019-09-08 08:20:49,746 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2019-09-08 08:20:49,746 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 147
[2019-09-08 08:20:49,747 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:20:49,762 INFO  L225             Difference]: With dead ends: 1672
[2019-09-08 08:20:49,762 INFO  L226             Difference]: Without dead ends: 1519
[2019-09-08 08:20:49,767 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806
[2019-09-08 08:20:49,770 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1519 states.
[2019-09-08 08:20:49,930 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1291.
[2019-09-08 08:20:49,930 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1291 states.
[2019-09-08 08:20:49,937 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 2090 transitions.
[2019-09-08 08:20:49,937 INFO  L78                 Accepts]: Start accepts. Automaton has 1291 states and 2090 transitions. Word has length 147
[2019-09-08 08:20:49,938 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:20:49,938 INFO  L475      AbstractCegarLoop]: Abstraction has 1291 states and 2090 transitions.
[2019-09-08 08:20:49,938 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2019-09-08 08:20:49,938 INFO  L276                IsEmpty]: Start isEmpty. Operand 1291 states and 2090 transitions.
[2019-09-08 08:20:49,947 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 149
[2019-09-08 08:20:49,947 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:20:49,947 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]
[2019-09-08 08:20:49,948 INFO  L418      AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:20:49,948 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:20:49,948 INFO  L82        PathProgramCache]: Analyzing trace with hash -233136022, now seen corresponding path program 1 times
[2019-09-08 08:20:49,948 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:20:49,948 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:20:49,953 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:49,953 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:20:49,953 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:50,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:20:50,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 08:20:50,220 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:20:50,220 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 08:20:50,221 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 08:20:50,221 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 08:20:50,221 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 08:20:50,222 INFO  L87              Difference]: Start difference. First operand 1291 states and 2090 transitions. Second operand 6 states.
[2019-09-08 08:20:52,848 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:20:52,849 INFO  L93              Difference]: Finished difference Result 4349 states and 7046 transitions.
[2019-09-08 08:20:52,850 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-08 08:20:52,850 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 148
[2019-09-08 08:20:52,851 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:20:52,875 INFO  L225             Difference]: With dead ends: 4349
[2019-09-08 08:20:52,875 INFO  L226             Difference]: Without dead ends: 3260
[2019-09-08 08:20:52,884 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-08 08:20:52,888 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3260 states.
[2019-09-08 08:20:53,010 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 3245.
[2019-09-08 08:20:53,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3245 states.
[2019-09-08 08:20:53,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 3245 states and 5234 transitions.
[2019-09-08 08:20:53,034 INFO  L78                 Accepts]: Start accepts. Automaton has 3245 states and 5234 transitions. Word has length 148
[2019-09-08 08:20:53,037 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:20:53,038 INFO  L475      AbstractCegarLoop]: Abstraction has 3245 states and 5234 transitions.
[2019-09-08 08:20:53,038 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 08:20:53,038 INFO  L276                IsEmpty]: Start isEmpty. Operand 3245 states and 5234 transitions.
[2019-09-08 08:20:53,041 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2019-09-08 08:20:53,042 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:20:53,042 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]
[2019-09-08 08:20:53,042 INFO  L418      AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:20:53,042 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:20:53,044 INFO  L82        PathProgramCache]: Analyzing trace with hash -878814535, now seen corresponding path program 1 times
[2019-09-08 08:20:53,044 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:20:53,044 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:20:53,047 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:53,047 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:20:53,047 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:53,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:20:53,425 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 08:20:53,425 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:20:53,425 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 08:20:53,427 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 08:20:53,428 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 08:20:53,428 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 08:20:53,428 INFO  L87              Difference]: Start difference. First operand 3245 states and 5234 transitions. Second operand 6 states.
[2019-09-08 08:20:55,892 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:20:55,893 INFO  L93              Difference]: Finished difference Result 11996 states and 19320 transitions.
[2019-09-08 08:20:55,894 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-08 08:20:55,894 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 149
[2019-09-08 08:20:55,895 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:20:55,945 INFO  L225             Difference]: With dead ends: 11996
[2019-09-08 08:20:55,945 INFO  L226             Difference]: Without dead ends: 8953
[2019-09-08 08:20:55,957 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2019-09-08 08:20:55,966 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8953 states.
[2019-09-08 08:20:56,274 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8953 to 8923.
[2019-09-08 08:20:56,274 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8923 states.
[2019-09-08 08:20:56,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8923 states to 8923 states and 14314 transitions.
[2019-09-08 08:20:56,324 INFO  L78                 Accepts]: Start accepts. Automaton has 8923 states and 14314 transitions. Word has length 149
[2019-09-08 08:20:56,324 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:20:56,325 INFO  L475      AbstractCegarLoop]: Abstraction has 8923 states and 14314 transitions.
[2019-09-08 08:20:56,325 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 08:20:56,325 INFO  L276                IsEmpty]: Start isEmpty. Operand 8923 states and 14314 transitions.
[2019-09-08 08:20:56,330 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2019-09-08 08:20:56,330 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:20:56,331 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]
[2019-09-08 08:20:56,331 INFO  L418      AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:20:56,331 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:20:56,332 INFO  L82        PathProgramCache]: Analyzing trace with hash 528303105, now seen corresponding path program 1 times
[2019-09-08 08:20:56,332 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:20:56,332 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:20:56,334 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:56,334 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:20:56,334 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:56,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:20:56,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 08:20:56,531 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:20:56,532 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 08:20:56,532 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 08:20:56,532 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 08:20:56,533 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 08:20:56,534 INFO  L87              Difference]: Start difference. First operand 8923 states and 14314 transitions. Second operand 6 states.
[2019-09-08 08:20:59,235 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:20:59,235 INFO  L93              Difference]: Finished difference Result 38961 states and 62394 transitions.
[2019-09-08 08:20:59,236 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-08 08:20:59,236 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 150
[2019-09-08 08:20:59,237 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:20:59,384 INFO  L225             Difference]: With dead ends: 38961
[2019-09-08 08:20:59,384 INFO  L226             Difference]: Without dead ends: 30240
[2019-09-08 08:20:59,414 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-08 08:20:59,446 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30240 states.
[2019-09-08 08:21:01,168 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30240 to 30152.
[2019-09-08 08:21:01,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30152 states.
[2019-09-08 08:21:01,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30152 states to 30152 states and 48148 transitions.
[2019-09-08 08:21:01,256 INFO  L78                 Accepts]: Start accepts. Automaton has 30152 states and 48148 transitions. Word has length 150
[2019-09-08 08:21:01,257 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:21:01,257 INFO  L475      AbstractCegarLoop]: Abstraction has 30152 states and 48148 transitions.
[2019-09-08 08:21:01,257 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 08:21:01,258 INFO  L276                IsEmpty]: Start isEmpty. Operand 30152 states and 48148 transitions.
[2019-09-08 08:21:01,263 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2019-09-08 08:21:01,263 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:21:01,264 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]
[2019-09-08 08:21:01,264 INFO  L418      AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:21:01,264 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:21:01,265 INFO  L82        PathProgramCache]: Analyzing trace with hash 1147592048, now seen corresponding path program 1 times
[2019-09-08 08:21:01,265 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:21:01,265 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:21:01,268 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:21:01,269 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:21:01,269 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:21:01,348 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:21:01,482 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 08:21:01,483 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:21:01,483 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 08:21:01,483 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 08:21:01,484 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 08:21:01,484 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-09-08 08:21:01,484 INFO  L87              Difference]: Start difference. First operand 30152 states and 48148 transitions. Second operand 6 states.
[2019-09-08 08:21:05,039 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:21:05,039 INFO  L93              Difference]: Finished difference Result 159566 states and 255677 transitions.
[2019-09-08 08:21:05,040 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-08 08:21:05,040 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 151
[2019-09-08 08:21:05,041 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:21:05,636 INFO  L225             Difference]: With dead ends: 159566
[2019-09-08 08:21:05,636 INFO  L226             Difference]: Without dead ends: 129616
[2019-09-08 08:21:05,746 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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-08 08:21:05,879 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 129616 states.
[2019-09-08 08:21:09,909 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 129616 to 103010.
[2019-09-08 08:21:09,910 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 103010 states.
[2019-09-08 08:21:12,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103010 states to 103010 states and 164958 transitions.
[2019-09-08 08:21:12,261 INFO  L78                 Accepts]: Start accepts. Automaton has 103010 states and 164958 transitions. Word has length 151
[2019-09-08 08:21:12,262 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:21:12,262 INFO  L475      AbstractCegarLoop]: Abstraction has 103010 states and 164958 transitions.
[2019-09-08 08:21:12,262 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 08:21:12,262 INFO  L276                IsEmpty]: Start isEmpty. Operand 103010 states and 164958 transitions.
[2019-09-08 08:21:12,268 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2019-09-08 08:21:12,269 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:21:12,269 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]
[2019-09-08 08:21:12,269 INFO  L418      AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:21:12,269 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:21:12,270 INFO  L82        PathProgramCache]: Analyzing trace with hash -1924125848, now seen corresponding path program 1 times
[2019-09-08 08:21:12,270 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:21:12,270 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:21:12,271 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:21:12,271 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:21:12,271 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:21:12,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:21:12,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 08:21:12,400 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:21:12,400 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 08:21:12,401 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 08:21:12,401 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 08:21:12,402 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 08:21:12,402 INFO  L87              Difference]: Start difference. First operand 103010 states and 164958 transitions. Second operand 4 states.
[2019-09-08 08:21:16,376 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:21:16,377 INFO  L93              Difference]: Finished difference Result 375425 states and 605553 transitions.
[2019-09-08 08:21:16,377 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 08:21:16,377 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 153
[2019-09-08 08:21:16,378 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:21:18,013 INFO  L225             Difference]: With dead ends: 375425
[2019-09-08 08:21:18,013 INFO  L226             Difference]: Without dead ends: 272617
[2019-09-08 08:21:18,182 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-08 08:21:18,393 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 272617 states.
[2019-09-08 08:21:27,476 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 272617 to 270609.
[2019-09-08 08:21:27,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 270609 states.
[2019-09-08 08:21:28,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 270609 states to 270609 states and 432240 transitions.
[2019-09-08 08:21:28,815 INFO  L78                 Accepts]: Start accepts. Automaton has 270609 states and 432240 transitions. Word has length 153
[2019-09-08 08:21:28,815 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:21:28,815 INFO  L475      AbstractCegarLoop]: Abstraction has 270609 states and 432240 transitions.
[2019-09-08 08:21:28,816 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 08:21:28,816 INFO  L276                IsEmpty]: Start isEmpty. Operand 270609 states and 432240 transitions.
[2019-09-08 08:21:28,825 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2019-09-08 08:21:28,826 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:21:28,826 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]
[2019-09-08 08:21:28,826 INFO  L418      AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:21:28,827 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:21:28,827 INFO  L82        PathProgramCache]: Analyzing trace with hash -512364064, now seen corresponding path program 1 times
[2019-09-08 08:21:28,827 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:21:28,827 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:21:28,828 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:21:28,828 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:21:28,828 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:21:28,882 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:21:29,047 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 08:21:29,048 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:21:29,048 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2019-09-08 08:21:29,049 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 11 states
[2019-09-08 08:21:29,049 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2019-09-08 08:21:29,049 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2019-09-08 08:21:29,049 INFO  L87              Difference]: Start difference. First operand 270609 states and 432240 transitions. Second operand 11 states.
[2019-09-08 08:21:45,728 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:21:45,729 INFO  L93              Difference]: Finished difference Result 466467 states and 746112 transitions.
[2019-09-08 08:21:45,729 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. 
[2019-09-08 08:21:45,729 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 154
[2019-09-08 08:21:45,730 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:21:47,021 INFO  L225             Difference]: With dead ends: 466467
[2019-09-08 08:21:47,022 INFO  L226             Difference]: Without dead ends: 388373
[2019-09-08 08:21:47,245 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080
[2019-09-08 08:21:47,591 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 388373 states.
[2019-09-08 08:22:04,844 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 388373 to 349117.
[2019-09-08 08:22:04,844 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 349117 states.
[2019-09-08 08:22:05,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 349117 states to 349117 states and 557564 transitions.
[2019-09-08 08:22:05,732 INFO  L78                 Accepts]: Start accepts. Automaton has 349117 states and 557564 transitions. Word has length 154
[2019-09-08 08:22:05,733 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:22:05,733 INFO  L475      AbstractCegarLoop]: Abstraction has 349117 states and 557564 transitions.
[2019-09-08 08:22:05,733 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2019-09-08 08:22:05,733 INFO  L276                IsEmpty]: Start isEmpty. Operand 349117 states and 557564 transitions.
[2019-09-08 08:22:05,739 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2019-09-08 08:22:05,740 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:22:05,740 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]
[2019-09-08 08:22:05,740 INFO  L418      AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:22:05,741 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:22:05,741 INFO  L82        PathProgramCache]: Analyzing trace with hash -893264308, now seen corresponding path program 1 times
[2019-09-08 08:22:05,741 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:22:05,741 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:22:05,742 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:22:05,743 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:22:05,743 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:22:05,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:22:05,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 08:22:05,967 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:22:05,967 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2019-09-08 08:22:05,967 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 12 states
[2019-09-08 08:22:05,967 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2019-09-08 08:22:05,968 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2019-09-08 08:22:05,968 INFO  L87              Difference]: Start difference. First operand 349117 states and 557564 transitions. Second operand 12 states.
[2019-09-08 08:22:36,189 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:22:36,190 INFO  L93              Difference]: Finished difference Result 1096800 states and 1772480 transitions.
[2019-09-08 08:22:36,191 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. 
[2019-09-08 08:22:36,191 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 155
[2019-09-08 08:22:36,191 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:22:39,460 INFO  L225             Difference]: With dead ends: 1096800
[2019-09-08 08:22:39,460 INFO  L226             Difference]: Without dead ends: 874613
[2019-09-08 08:22:39,828 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422
[2019-09-08 08:22:40,434 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 874613 states.
[2019-09-08 08:23:15,196 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 874613 to 720074.
[2019-09-08 08:23:15,196 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 720074 states.
[2019-09-08 08:23:18,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 720074 states to 720074 states and 1164852 transitions.
[2019-09-08 08:23:18,187 INFO  L78                 Accepts]: Start accepts. Automaton has 720074 states and 1164852 transitions. Word has length 155
[2019-09-08 08:23:18,188 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:23:18,188 INFO  L475      AbstractCegarLoop]: Abstraction has 720074 states and 1164852 transitions.
[2019-09-08 08:23:18,188 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2019-09-08 08:23:18,188 INFO  L276                IsEmpty]: Start isEmpty. Operand 720074 states and 1164852 transitions.
[2019-09-08 08:23:18,194 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2019-09-08 08:23:18,194 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:23:18,194 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]
[2019-09-08 08:23:18,195 INFO  L418      AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:23:18,195 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:23:18,195 INFO  L82        PathProgramCache]: Analyzing trace with hash -1922623606, now seen corresponding path program 1 times
[2019-09-08 08:23:18,195 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:23:18,195 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:23:18,196 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:23:18,197 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:23:18,197 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:23:18,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:23:18,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 08:23:18,340 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:23:18,340 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2019-09-08 08:23:18,340 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-09-08 08:23:18,340 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-09-08 08:23:18,341 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-09-08 08:23:18,341 INFO  L87              Difference]: Start difference. First operand 720074 states and 1164852 transitions. Second operand 7 states.
[2019-09-08 08:23:43,575 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:23:43,576 INFO  L93              Difference]: Finished difference Result 1289649 states and 2089580 transitions.
[2019-09-08 08:23:43,576 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-08 08:23:43,577 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 155
[2019-09-08 08:23:43,577 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:23:45,687 INFO  L225             Difference]: With dead ends: 1289649
[2019-09-08 08:23:45,687 INFO  L226             Difference]: Without dead ends: 704543
[2019-09-08 08:23:46,427 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2019-09-08 08:23:48,807 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 704543 states.
[2019-09-08 08:24:24,314 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 704543 to 594706.
[2019-09-08 08:24:24,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 594706 states.
[2019-09-08 08:24:26,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 594706 states to 594706 states and 962586 transitions.
[2019-09-08 08:24:26,553 INFO  L78                 Accepts]: Start accepts. Automaton has 594706 states and 962586 transitions. Word has length 155
[2019-09-08 08:24:26,554 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:24:26,554 INFO  L475      AbstractCegarLoop]: Abstraction has 594706 states and 962586 transitions.
[2019-09-08 08:24:26,554 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-09-08 08:24:26,554 INFO  L276                IsEmpty]: Start isEmpty. Operand 594706 states and 962586 transitions.
[2019-09-08 08:24:26,560 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2019-09-08 08:24:26,561 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:24:26,561 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]
[2019-09-08 08:24:26,561 INFO  L418      AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:24:26,561 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:24:26,562 INFO  L82        PathProgramCache]: Analyzing trace with hash 1352813233, now seen corresponding path program 1 times
[2019-09-08 08:24:26,562 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:24:26,562 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:24:26,563 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:24:26,563 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:24:26,563 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:24:26,696 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:24:26,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 08:24:26,838 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:24:26,838 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 08:24:26,839 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 08:24:26,839 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 08:24:26,839 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 08:24:26,840 INFO  L87              Difference]: Start difference. First operand 594706 states and 962586 transitions. Second operand 5 states.
[2019-09-08 08:25:14,707 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:25:14,708 INFO  L93              Difference]: Finished difference Result 1775571 states and 2903388 transitions.
[2019-09-08 08:25:14,708 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-09-08 08:25:14,708 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 156
[2019-09-08 08:25:14,708 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:25:19,506 INFO  L225             Difference]: With dead ends: 1775571
[2019-09-08 08:25:19,506 INFO  L226             Difference]: Without dead ends: 1180881
[2019-09-08 08:25:20,692 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2019-09-08 08:25:21,495 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1180881 states.
[2019-09-08 08:26:26,101 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180881 to 1180879.
[2019-09-08 08:26:26,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1180879 states.
[2019-09-08 08:26:45,040 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1180879 states to 1180879 states and 1898048 transitions.
[2019-09-08 08:26:45,073 INFO  L78                 Accepts]: Start accepts. Automaton has 1180879 states and 1898048 transitions. Word has length 156
[2019-09-08 08:26:45,073 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:26:45,073 INFO  L475      AbstractCegarLoop]: Abstraction has 1180879 states and 1898048 transitions.
[2019-09-08 08:26:45,073 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 08:26:45,074 INFO  L276                IsEmpty]: Start isEmpty. Operand 1180879 states and 1898048 transitions.
[2019-09-08 08:26:45,084 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2019-09-08 08:26:45,084 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:26:45,084 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]
[2019-09-08 08:26:45,085 INFO  L418      AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:26:45,085 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:26:45,085 INFO  L82        PathProgramCache]: Analyzing trace with hash -283469812, now seen corresponding path program 1 times
[2019-09-08 08:26:45,085 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:26:45,085 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:26:45,087 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:26:45,087 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:26:45,087 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:26:45,179 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:26:45,276 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 08:26:45,276 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:26:45,276 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 08:26:45,277 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 08:26:45,277 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 08:26:45,278 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 08:26:45,278 INFO  L87              Difference]: Start difference. First operand 1180879 states and 1898048 transitions. Second operand 5 states.