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/systemc/transmitter.11.cil.c


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


This is Ultimate 0.1.24-112bae1
[2019-09-08 06:57:10,319 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-09-08 06:57:10,321 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-09-08 06:57:10,334 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-09-08 06:57:10,334 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-09-08 06:57:10,335 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-09-08 06:57:10,337 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-09-08 06:57:10,339 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-09-08 06:57:10,340 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-09-08 06:57:10,341 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-09-08 06:57:10,342 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-09-08 06:57:10,343 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-09-08 06:57:10,344 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-09-08 06:57:10,345 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-09-08 06:57:10,346 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-09-08 06:57:10,347 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-09-08 06:57:10,347 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-09-08 06:57:10,348 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-09-08 06:57:10,350 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-09-08 06:57:10,353 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-09-08 06:57:10,354 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-09-08 06:57:10,355 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-09-08 06:57:10,357 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-09-08 06:57:10,357 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-09-08 06:57:10,360 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-09-08 06:57:10,361 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-09-08 06:57:10,361 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-09-08 06:57:10,362 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-09-08 06:57:10,362 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-09-08 06:57:10,363 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-09-08 06:57:10,364 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-09-08 06:57:10,365 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-09-08 06:57:10,365 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-09-08 06:57:10,366 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-09-08 06:57:10,367 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-09-08 06:57:10,368 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-09-08 06:57:10,368 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-09-08 06:57:10,369 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-09-08 06:57:10,369 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-09-08 06:57:10,370 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-09-08 06:57:10,371 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-09-08 06:57:10,372 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 06:57:10,388 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-09-08 06:57:10,388 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-09-08 06:57:10,389 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-09-08 06:57:10,390 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-09-08 06:57:10,390 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-09-08 06:57:10,390 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-09-08 06:57:10,390 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-09-08 06:57:10,391 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-09-08 06:57:10,391 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-09-08 06:57:10,391 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-09-08 06:57:10,391 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-09-08 06:57:10,391 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-09-08 06:57:10,392 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-09-08 06:57:10,392 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-09-08 06:57:10,392 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-09-08 06:57:10,392 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-09-08 06:57:10,392 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-09-08 06:57:10,393 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-09-08 06:57:10,393 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-09-08 06:57:10,393 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-09-08 06:57:10,393 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-09-08 06:57:10,394 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-09-08 06:57:10,394 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-09-08 06:57:10,394 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-09-08 06:57:10,394 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-09-08 06:57:10,394 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-09-08 06:57:10,395 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-09-08 06:57:10,395 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-09-08 06:57:10,395 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-09-08 06:57:10,424 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-09-08 06:57:10,437 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-09-08 06:57:10,440 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-09-08 06:57:10,442 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-09-08 06:57:10,442 INFO  L275        PluginConnector]: CDTParser initialized
[2019-09-08 06:57:10,443 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.11.cil.c
[2019-09-08 06:57:10,508 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f809c2f1/4304be83c9a0421481871cda583522f5/FLAG1ed975b78
[2019-09-08 06:57:11,017 INFO  L306              CDTParser]: Found 1 translation units.
[2019-09-08 06:57:11,018 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.11.cil.c
[2019-09-08 06:57:11,035 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f809c2f1/4304be83c9a0421481871cda583522f5/FLAG1ed975b78
[2019-09-08 06:57:11,384 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f809c2f1/4304be83c9a0421481871cda583522f5
[2019-09-08 06:57:11,395 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-09-08 06:57:11,397 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-09-08 06:57:11,398 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-09-08 06:57:11,398 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-09-08 06:57:11,402 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-09-08 06:57:11,404 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:57:11" (1/1) ...
[2019-09-08 06:57:11,407 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32d0914e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:11, skipping insertion in model container
[2019-09-08 06:57:11,407 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:57:11" (1/1) ...
[2019-09-08 06:57:11,416 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-09-08 06:57:11,488 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-09-08 06:57:11,931 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-08 06:57:11,943 INFO  L188         MainTranslator]: Completed pre-run
[2019-09-08 06:57:12,085 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-08 06:57:12,129 INFO  L192         MainTranslator]: Completed translation
[2019-09-08 06:57:12,130 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:12 WrapperNode
[2019-09-08 06:57:12,130 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-09-08 06:57:12,131 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-09-08 06:57:12,131 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-09-08 06:57:12,132 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-09-08 06:57:12,146 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:12" (1/1) ...
[2019-09-08 06:57:12,147 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:12" (1/1) ...
[2019-09-08 06:57:12,161 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:12" (1/1) ...
[2019-09-08 06:57:12,161 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:12" (1/1) ...
[2019-09-08 06:57:12,187 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:12" (1/1) ...
[2019-09-08 06:57:12,232 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:12" (1/1) ...
[2019-09-08 06:57:12,237 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:12" (1/1) ...
[2019-09-08 06:57:12,261 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-09-08 06:57:12,262 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-09-08 06:57:12,262 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-09-08 06:57:12,262 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-09-08 06:57:12,264 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:12" (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 06:57:12,340 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-09-08 06:57:12,340 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-09-08 06:57:12,340 INFO  L138     BoogieDeclarations]: Found implementation of procedure error
[2019-09-08 06:57:12,340 INFO  L138     BoogieDeclarations]: Found implementation of procedure master
[2019-09-08 06:57:12,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure transmit1
[2019-09-08 06:57:12,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure transmit2
[2019-09-08 06:57:12,343 INFO  L138     BoogieDeclarations]: Found implementation of procedure transmit3
[2019-09-08 06:57:12,343 INFO  L138     BoogieDeclarations]: Found implementation of procedure transmit4
[2019-09-08 06:57:12,344 INFO  L138     BoogieDeclarations]: Found implementation of procedure transmit5
[2019-09-08 06:57:12,345 INFO  L138     BoogieDeclarations]: Found implementation of procedure transmit6
[2019-09-08 06:57:12,345 INFO  L138     BoogieDeclarations]: Found implementation of procedure transmit7
[2019-09-08 06:57:12,345 INFO  L138     BoogieDeclarations]: Found implementation of procedure transmit8
[2019-09-08 06:57:12,346 INFO  L138     BoogieDeclarations]: Found implementation of procedure transmit9
[2019-09-08 06:57:12,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure transmit10
[2019-09-08 06:57:12,349 INFO  L138     BoogieDeclarations]: Found implementation of procedure transmit11
[2019-09-08 06:57:12,349 INFO  L138     BoogieDeclarations]: Found implementation of procedure is_master_triggered
[2019-09-08 06:57:12,351 INFO  L138     BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered
[2019-09-08 06:57:12,352 INFO  L138     BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered
[2019-09-08 06:57:12,352 INFO  L138     BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered
[2019-09-08 06:57:12,352 INFO  L138     BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered
[2019-09-08 06:57:12,352 INFO  L138     BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered
[2019-09-08 06:57:12,352 INFO  L138     BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered
[2019-09-08 06:57:12,352 INFO  L138     BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered
[2019-09-08 06:57:12,353 INFO  L138     BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered
[2019-09-08 06:57:12,353 INFO  L138     BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered
[2019-09-08 06:57:12,353 INFO  L138     BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered
[2019-09-08 06:57:12,353 INFO  L138     BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered
[2019-09-08 06:57:12,353 INFO  L138     BoogieDeclarations]: Found implementation of procedure update_channels
[2019-09-08 06:57:12,353 INFO  L138     BoogieDeclarations]: Found implementation of procedure init_threads
[2019-09-08 06:57:12,354 INFO  L138     BoogieDeclarations]: Found implementation of procedure exists_runnable_thread
[2019-09-08 06:57:12,354 INFO  L138     BoogieDeclarations]: Found implementation of procedure eval
[2019-09-08 06:57:12,354 INFO  L138     BoogieDeclarations]: Found implementation of procedure fire_delta_events
[2019-09-08 06:57:12,354 INFO  L138     BoogieDeclarations]: Found implementation of procedure reset_delta_events
[2019-09-08 06:57:12,354 INFO  L138     BoogieDeclarations]: Found implementation of procedure activate_threads
[2019-09-08 06:57:12,354 INFO  L138     BoogieDeclarations]: Found implementation of procedure immediate_notify
[2019-09-08 06:57:12,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure fire_time_events
[2019-09-08 06:57:12,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure reset_time_events
[2019-09-08 06:57:12,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure init_model
[2019-09-08 06:57:12,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure stop_simulation
[2019-09-08 06:57:12,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure start_simulation
[2019-09-08 06:57:12,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-09-08 06:57:12,355 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-09-08 06:57:12,356 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-09-08 06:57:12,356 INFO  L130     BoogieDeclarations]: Found specification of procedure error
[2019-09-08 06:57:12,356 INFO  L130     BoogieDeclarations]: Found specification of procedure is_master_triggered
[2019-09-08 06:57:12,356 INFO  L130     BoogieDeclarations]: Found specification of procedure is_transmit1_triggered
[2019-09-08 06:57:12,357 INFO  L130     BoogieDeclarations]: Found specification of procedure is_transmit2_triggered
[2019-09-08 06:57:12,357 INFO  L130     BoogieDeclarations]: Found specification of procedure is_transmit3_triggered
[2019-09-08 06:57:12,357 INFO  L130     BoogieDeclarations]: Found specification of procedure is_transmit4_triggered
[2019-09-08 06:57:12,357 INFO  L130     BoogieDeclarations]: Found specification of procedure is_transmit5_triggered
[2019-09-08 06:57:12,357 INFO  L130     BoogieDeclarations]: Found specification of procedure is_transmit6_triggered
[2019-09-08 06:57:12,358 INFO  L130     BoogieDeclarations]: Found specification of procedure is_transmit7_triggered
[2019-09-08 06:57:12,358 INFO  L130     BoogieDeclarations]: Found specification of procedure is_transmit8_triggered
[2019-09-08 06:57:12,358 INFO  L130     BoogieDeclarations]: Found specification of procedure is_transmit9_triggered
[2019-09-08 06:57:12,358 INFO  L130     BoogieDeclarations]: Found specification of procedure is_transmit10_triggered
[2019-09-08 06:57:12,358 INFO  L130     BoogieDeclarations]: Found specification of procedure is_transmit11_triggered
[2019-09-08 06:57:12,358 INFO  L130     BoogieDeclarations]: Found specification of procedure immediate_notify
[2019-09-08 06:57:12,358 INFO  L130     BoogieDeclarations]: Found specification of procedure master
[2019-09-08 06:57:12,359 INFO  L130     BoogieDeclarations]: Found specification of procedure transmit1
[2019-09-08 06:57:12,359 INFO  L130     BoogieDeclarations]: Found specification of procedure transmit2
[2019-09-08 06:57:12,359 INFO  L130     BoogieDeclarations]: Found specification of procedure transmit3
[2019-09-08 06:57:12,359 INFO  L130     BoogieDeclarations]: Found specification of procedure transmit4
[2019-09-08 06:57:12,359 INFO  L130     BoogieDeclarations]: Found specification of procedure transmit5
[2019-09-08 06:57:12,359 INFO  L130     BoogieDeclarations]: Found specification of procedure transmit6
[2019-09-08 06:57:12,360 INFO  L130     BoogieDeclarations]: Found specification of procedure transmit7
[2019-09-08 06:57:12,360 INFO  L130     BoogieDeclarations]: Found specification of procedure transmit8
[2019-09-08 06:57:12,360 INFO  L130     BoogieDeclarations]: Found specification of procedure transmit9
[2019-09-08 06:57:12,360 INFO  L130     BoogieDeclarations]: Found specification of procedure transmit10
[2019-09-08 06:57:12,361 INFO  L130     BoogieDeclarations]: Found specification of procedure transmit11
[2019-09-08 06:57:12,361 INFO  L130     BoogieDeclarations]: Found specification of procedure update_channels
[2019-09-08 06:57:12,361 INFO  L130     BoogieDeclarations]: Found specification of procedure init_threads
[2019-09-08 06:57:12,361 INFO  L130     BoogieDeclarations]: Found specification of procedure exists_runnable_thread
[2019-09-08 06:57:12,361 INFO  L130     BoogieDeclarations]: Found specification of procedure eval
[2019-09-08 06:57:12,362 INFO  L130     BoogieDeclarations]: Found specification of procedure fire_delta_events
[2019-09-08 06:57:12,362 INFO  L130     BoogieDeclarations]: Found specification of procedure reset_delta_events
[2019-09-08 06:57:12,363 INFO  L130     BoogieDeclarations]: Found specification of procedure activate_threads
[2019-09-08 06:57:12,363 INFO  L130     BoogieDeclarations]: Found specification of procedure fire_time_events
[2019-09-08 06:57:12,363 INFO  L130     BoogieDeclarations]: Found specification of procedure reset_time_events
[2019-09-08 06:57:12,363 INFO  L130     BoogieDeclarations]: Found specification of procedure init_model
[2019-09-08 06:57:12,363 INFO  L130     BoogieDeclarations]: Found specification of procedure stop_simulation
[2019-09-08 06:57:12,363 INFO  L130     BoogieDeclarations]: Found specification of procedure start_simulation
[2019-09-08 06:57:12,364 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-09-08 06:57:12,364 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-09-08 06:57:12,365 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-09-08 06:57:13,762 INFO  L278             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-09-08 06:57:13,762 INFO  L283             CfgBuilder]: Removed 15 assume(true) statements.
[2019-09-08 06:57:13,769 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:57:13 BoogieIcfgContainer
[2019-09-08 06:57:13,770 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-09-08 06:57:13,771 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-09-08 06:57:13,771 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-09-08 06:57:13,775 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-09-08 06:57:13,775 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:57:11" (1/3) ...
[2019-09-08 06:57:13,776 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a35090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:57:13, skipping insertion in model container
[2019-09-08 06:57:13,777 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:12" (2/3) ...
[2019-09-08 06:57:13,777 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a35090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:57:13, skipping insertion in model container
[2019-09-08 06:57:13,777 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:57:13" (3/3) ...
[2019-09-08 06:57:13,779 INFO  L109   eAbstractionObserver]: Analyzing ICFG transmitter.11.cil.c
[2019-09-08 06:57:13,791 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-09-08 06:57:13,802 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-09-08 06:57:13,822 INFO  L252      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-09-08 06:57:13,863 INFO  L128   ementStrategyFactory]: Using default assertion order modulation
[2019-09-08 06:57:13,864 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2019-09-08 06:57:13,864 INFO  L378      AbstractCegarLoop]: Hoare is true
[2019-09-08 06:57:13,864 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-09-08 06:57:13,865 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-09-08 06:57:13,865 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-09-08 06:57:13,865 INFO  L382      AbstractCegarLoop]: Difference is false
[2019-09-08 06:57:13,865 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-09-08 06:57:13,865 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-09-08 06:57:13,910 INFO  L276                IsEmpty]: Start isEmpty. Operand 439 states.
[2019-09-08 06:57:13,951 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:13,951 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:13,953 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]
[2019-09-08 06:57:13,961 INFO  L418      AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:13,969 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:13,969 INFO  L82        PathProgramCache]: Analyzing trace with hash -1954601429, now seen corresponding path program 1 times
[2019-09-08 06:57:13,972 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:13,972 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:14,021 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:14,021 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:14,022 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:14,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:14,419 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 06:57:14,422 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:14,423 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 06:57:14,429 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 06:57:14,444 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 06:57:14,445 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 06:57:14,448 INFO  L87              Difference]: Start difference. First operand 439 states. Second operand 4 states.
[2019-09-08 06:57:14,955 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:14,955 INFO  L93              Difference]: Finished difference Result 858 states and 1323 transitions.
[2019-09-08 06:57:14,956 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 06:57:14,958 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 225
[2019-09-08 06:57:14,958 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:14,991 INFO  L225             Difference]: With dead ends: 858
[2019-09-08 06:57:14,991 INFO  L226             Difference]: Without dead ends: 430
[2019-09-08 06:57:15,004 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 06:57:15,026 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 430 states.
[2019-09-08 06:57:15,115 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430.
[2019-09-08 06:57:15,116 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:15,120 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 626 transitions.
[2019-09-08 06:57:15,122 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 626 transitions. Word has length 225
[2019-09-08 06:57:15,124 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:15,124 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 626 transitions.
[2019-09-08 06:57:15,124 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 06:57:15,125 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 626 transitions.
[2019-09-08 06:57:15,133 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:15,133 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:15,133 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]
[2019-09-08 06:57:15,134 INFO  L418      AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:15,134 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:15,135 INFO  L82        PathProgramCache]: Analyzing trace with hash -1100061971, now seen corresponding path program 1 times
[2019-09-08 06:57:15,135 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:15,135 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:15,137 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:15,137 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:15,137 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:15,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:15,375 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 06:57:15,375 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:15,375 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 06:57:15,382 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 06:57:15,382 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 06:57:15,383 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 06:57:15,384 INFO  L87              Difference]: Start difference. First operand 430 states and 626 transitions. Second operand 4 states.
[2019-09-08 06:57:15,747 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:15,747 INFO  L93              Difference]: Finished difference Result 834 states and 1214 transitions.
[2019-09-08 06:57:15,748 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 06:57:15,748 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 225
[2019-09-08 06:57:15,748 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:15,752 INFO  L225             Difference]: With dead ends: 834
[2019-09-08 06:57:15,752 INFO  L226             Difference]: Without dead ends: 430
[2019-09-08 06:57:15,755 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 06:57:15,756 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 430 states.
[2019-09-08 06:57:15,781 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430.
[2019-09-08 06:57:15,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:15,785 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 625 transitions.
[2019-09-08 06:57:15,785 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 625 transitions. Word has length 225
[2019-09-08 06:57:15,786 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:15,786 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 625 transitions.
[2019-09-08 06:57:15,786 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 06:57:15,786 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 625 transitions.
[2019-09-08 06:57:15,790 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:15,790 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:15,791 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]
[2019-09-08 06:57:15,791 INFO  L418      AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:15,791 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:15,791 INFO  L82        PathProgramCache]: Analyzing trace with hash 830439855, now seen corresponding path program 1 times
[2019-09-08 06:57:15,792 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:15,792 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:15,793 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:15,793 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:15,793 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:15,856 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:16,094 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 06:57:16,095 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:16,095 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:16,096 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:16,096 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:16,097 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:16,097 INFO  L87              Difference]: Start difference. First operand 430 states and 625 transitions. Second operand 5 states.
[2019-09-08 06:57:17,029 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:17,030 INFO  L93              Difference]: Finished difference Result 895 states and 1331 transitions.
[2019-09-08 06:57:17,031 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:17,031 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:17,032 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:17,036 INFO  L225             Difference]: With dead ends: 895
[2019-09-08 06:57:17,036 INFO  L226             Difference]: Without dead ends: 494
[2019-09-08 06:57:17,038 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:17,040 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 494 states.
[2019-09-08 06:57:17,074 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 430.
[2019-09-08 06:57:17,075 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:17,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 624 transitions.
[2019-09-08 06:57:17,078 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 624 transitions. Word has length 225
[2019-09-08 06:57:17,079 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:17,079 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 624 transitions.
[2019-09-08 06:57:17,079 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:17,079 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 624 transitions.
[2019-09-08 06:57:17,083 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:17,083 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:17,083 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]
[2019-09-08 06:57:17,084 INFO  L418      AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:17,084 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:17,084 INFO  L82        PathProgramCache]: Analyzing trace with hash 756855277, now seen corresponding path program 1 times
[2019-09-08 06:57:17,085 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:17,085 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:17,086 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:17,086 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:17,086 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:17,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:17,274 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 06:57:17,275 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:17,275 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:17,276 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:17,277 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:17,277 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:17,277 INFO  L87              Difference]: Start difference. First operand 430 states and 624 transitions. Second operand 5 states.
[2019-09-08 06:57:18,246 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:18,246 INFO  L93              Difference]: Finished difference Result 895 states and 1330 transitions.
[2019-09-08 06:57:18,246 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:18,246 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:18,247 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:18,251 INFO  L225             Difference]: With dead ends: 895
[2019-09-08 06:57:18,251 INFO  L226             Difference]: Without dead ends: 494
[2019-09-08 06:57:18,253 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:18,254 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 494 states.
[2019-09-08 06:57:18,276 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 430.
[2019-09-08 06:57:18,276 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:18,279 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 623 transitions.
[2019-09-08 06:57:18,280 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 623 transitions. Word has length 225
[2019-09-08 06:57:18,280 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:18,280 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 623 transitions.
[2019-09-08 06:57:18,280 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:18,280 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 623 transitions.
[2019-09-08 06:57:18,283 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:18,284 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:18,284 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]
[2019-09-08 06:57:18,284 INFO  L418      AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:18,285 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:18,285 INFO  L82        PathProgramCache]: Analyzing trace with hash -1323728401, now seen corresponding path program 1 times
[2019-09-08 06:57:18,285 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:18,285 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:18,286 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:18,286 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:18,287 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:18,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:18,428 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 06:57:18,428 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:18,428 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:18,429 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:18,429 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:18,430 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:18,430 INFO  L87              Difference]: Start difference. First operand 430 states and 623 transitions. Second operand 5 states.
[2019-09-08 06:57:19,306 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:19,306 INFO  L93              Difference]: Finished difference Result 893 states and 1324 transitions.
[2019-09-08 06:57:19,306 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:19,307 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:19,307 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:19,311 INFO  L225             Difference]: With dead ends: 893
[2019-09-08 06:57:19,311 INFO  L226             Difference]: Without dead ends: 492
[2019-09-08 06:57:19,313 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:19,314 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 492 states.
[2019-09-08 06:57:19,339 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 430.
[2019-09-08 06:57:19,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:19,342 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 622 transitions.
[2019-09-08 06:57:19,342 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 622 transitions. Word has length 225
[2019-09-08 06:57:19,343 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:19,343 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 622 transitions.
[2019-09-08 06:57:19,343 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:19,343 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 622 transitions.
[2019-09-08 06:57:19,346 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:19,346 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:19,347 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]
[2019-09-08 06:57:19,347 INFO  L418      AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:19,347 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:19,348 INFO  L82        PathProgramCache]: Analyzing trace with hash -836654675, now seen corresponding path program 1 times
[2019-09-08 06:57:19,348 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:19,348 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:19,349 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:19,349 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:19,349 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:19,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:19,497 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 06:57:19,498 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:19,498 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:19,498 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:19,499 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:19,499 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:19,499 INFO  L87              Difference]: Start difference. First operand 430 states and 622 transitions. Second operand 5 states.
[2019-09-08 06:57:20,289 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:20,290 INFO  L93              Difference]: Finished difference Result 891 states and 1318 transitions.
[2019-09-08 06:57:20,290 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:20,291 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:20,291 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:20,295 INFO  L225             Difference]: With dead ends: 891
[2019-09-08 06:57:20,295 INFO  L226             Difference]: Without dead ends: 490
[2019-09-08 06:57:20,297 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:20,298 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 490 states.
[2019-09-08 06:57:20,322 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 430.
[2019-09-08 06:57:20,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:20,325 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 621 transitions.
[2019-09-08 06:57:20,326 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 621 transitions. Word has length 225
[2019-09-08 06:57:20,326 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:20,326 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 621 transitions.
[2019-09-08 06:57:20,326 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:20,327 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 621 transitions.
[2019-09-08 06:57:20,330 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:20,330 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:20,330 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]
[2019-09-08 06:57:20,331 INFO  L418      AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:20,331 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:20,331 INFO  L82        PathProgramCache]: Analyzing trace with hash 1672909359, now seen corresponding path program 1 times
[2019-09-08 06:57:20,331 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:20,332 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:20,333 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:20,333 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:20,333 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:20,352 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:20,465 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 06:57:20,466 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:20,466 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:20,466 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:20,467 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:20,468 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:20,468 INFO  L87              Difference]: Start difference. First operand 430 states and 621 transitions. Second operand 5 states.
[2019-09-08 06:57:21,261 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:21,261 INFO  L93              Difference]: Finished difference Result 889 states and 1312 transitions.
[2019-09-08 06:57:21,262 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:21,262 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:21,263 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:21,267 INFO  L225             Difference]: With dead ends: 889
[2019-09-08 06:57:21,268 INFO  L226             Difference]: Without dead ends: 488
[2019-09-08 06:57:21,271 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:21,272 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 488 states.
[2019-09-08 06:57:21,300 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 430.
[2019-09-08 06:57:21,300 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:21,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 620 transitions.
[2019-09-08 06:57:21,303 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 620 transitions. Word has length 225
[2019-09-08 06:57:21,304 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:21,304 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 620 transitions.
[2019-09-08 06:57:21,304 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:21,304 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 620 transitions.
[2019-09-08 06:57:21,306 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:21,306 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:21,307 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]
[2019-09-08 06:57:21,307 INFO  L418      AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:21,307 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:21,308 INFO  L82        PathProgramCache]: Analyzing trace with hash 1199673709, now seen corresponding path program 1 times
[2019-09-08 06:57:21,308 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:21,308 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:21,309 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:21,309 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:21,309 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:21,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:21,422 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 06:57:21,423 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:21,423 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:21,424 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:21,424 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:21,425 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:21,425 INFO  L87              Difference]: Start difference. First operand 430 states and 620 transitions. Second operand 5 states.
[2019-09-08 06:57:22,306 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:22,306 INFO  L93              Difference]: Finished difference Result 887 states and 1306 transitions.
[2019-09-08 06:57:22,307 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:22,307 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:22,307 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:22,312 INFO  L225             Difference]: With dead ends: 887
[2019-09-08 06:57:22,312 INFO  L226             Difference]: Without dead ends: 486
[2019-09-08 06:57:22,314 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:22,315 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 486 states.
[2019-09-08 06:57:22,340 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 430.
[2019-09-08 06:57:22,341 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:22,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 619 transitions.
[2019-09-08 06:57:22,344 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 619 transitions. Word has length 225
[2019-09-08 06:57:22,344 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:22,344 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 619 transitions.
[2019-09-08 06:57:22,344 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:22,345 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 619 transitions.
[2019-09-08 06:57:22,346 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:22,347 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:22,347 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]
[2019-09-08 06:57:22,347 INFO  L418      AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:22,348 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:22,348 INFO  L82        PathProgramCache]: Analyzing trace with hash 1322955375, now seen corresponding path program 1 times
[2019-09-08 06:57:22,348 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:22,348 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:22,349 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:22,349 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:22,349 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:22,367 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:22,449 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 06:57:22,449 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:22,449 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:22,450 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:22,450 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:22,450 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:22,450 INFO  L87              Difference]: Start difference. First operand 430 states and 619 transitions. Second operand 5 states.
[2019-09-08 06:57:23,593 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:23,593 INFO  L93              Difference]: Finished difference Result 883 states and 1296 transitions.
[2019-09-08 06:57:23,594 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:23,594 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:23,594 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:23,598 INFO  L225             Difference]: With dead ends: 883
[2019-09-08 06:57:23,598 INFO  L226             Difference]: Without dead ends: 482
[2019-09-08 06:57:23,601 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:23,603 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 482 states.
[2019-09-08 06:57:23,638 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 430.
[2019-09-08 06:57:23,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:23,640 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 618 transitions.
[2019-09-08 06:57:23,641 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 618 transitions. Word has length 225
[2019-09-08 06:57:23,641 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:23,641 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 618 transitions.
[2019-09-08 06:57:23,641 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:23,641 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 618 transitions.
[2019-09-08 06:57:23,643 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:23,643 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:23,643 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]
[2019-09-08 06:57:23,644 INFO  L418      AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:23,644 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:23,644 INFO  L82        PathProgramCache]: Analyzing trace with hash -2069091343, now seen corresponding path program 1 times
[2019-09-08 06:57:23,644 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:23,644 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:23,646 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:23,646 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:23,647 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:23,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:23,780 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 06:57:23,780 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:23,780 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:23,781 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:23,781 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:23,781 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:23,782 INFO  L87              Difference]: Start difference. First operand 430 states and 618 transitions. Second operand 5 states.
[2019-09-08 06:57:24,572 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:24,572 INFO  L93              Difference]: Finished difference Result 881 states and 1290 transitions.
[2019-09-08 06:57:24,573 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:24,574 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:24,574 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:24,579 INFO  L225             Difference]: With dead ends: 881
[2019-09-08 06:57:24,580 INFO  L226             Difference]: Without dead ends: 480
[2019-09-08 06:57:24,582 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:24,583 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 480 states.
[2019-09-08 06:57:24,611 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 430.
[2019-09-08 06:57:24,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:24,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 617 transitions.
[2019-09-08 06:57:24,616 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 617 transitions. Word has length 225
[2019-09-08 06:57:24,616 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:24,617 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 617 transitions.
[2019-09-08 06:57:24,617 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:24,617 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 617 transitions.
[2019-09-08 06:57:24,620 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:24,620 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:24,621 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]
[2019-09-08 06:57:24,621 INFO  L418      AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:24,621 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:24,621 INFO  L82        PathProgramCache]: Analyzing trace with hash 1977907759, now seen corresponding path program 1 times
[2019-09-08 06:57:24,621 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:24,622 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:24,622 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:24,622 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:24,623 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:24,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:24,778 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 06:57:24,778 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:24,778 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:24,779 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:24,779 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:24,780 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:24,780 INFO  L87              Difference]: Start difference. First operand 430 states and 617 transitions. Second operand 5 states.
[2019-09-08 06:57:25,581 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:25,581 INFO  L93              Difference]: Finished difference Result 879 states and 1284 transitions.
[2019-09-08 06:57:25,582 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:25,582 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:25,582 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:25,585 INFO  L225             Difference]: With dead ends: 879
[2019-09-08 06:57:25,585 INFO  L226             Difference]: Without dead ends: 478
[2019-09-08 06:57:25,587 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:25,588 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 478 states.
[2019-09-08 06:57:25,614 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 430.
[2019-09-08 06:57:25,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:25,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 616 transitions.
[2019-09-08 06:57:25,617 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 616 transitions. Word has length 225
[2019-09-08 06:57:25,618 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:25,618 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 616 transitions.
[2019-09-08 06:57:25,618 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:25,618 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 616 transitions.
[2019-09-08 06:57:25,620 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:25,620 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:25,620 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]
[2019-09-08 06:57:25,620 INFO  L418      AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:25,621 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:25,621 INFO  L82        PathProgramCache]: Analyzing trace with hash 1969908785, now seen corresponding path program 1 times
[2019-09-08 06:57:25,621 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:25,621 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:25,622 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:25,622 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:25,622 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:25,638 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:25,710 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 06:57:25,711 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:25,711 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:25,711 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:25,712 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:25,712 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:25,712 INFO  L87              Difference]: Start difference. First operand 430 states and 616 transitions. Second operand 5 states.
[2019-09-08 06:57:26,587 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:26,587 INFO  L93              Difference]: Finished difference Result 877 states and 1278 transitions.
[2019-09-08 06:57:26,587 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:26,588 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:26,588 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:26,591 INFO  L225             Difference]: With dead ends: 877
[2019-09-08 06:57:26,591 INFO  L226             Difference]: Without dead ends: 476
[2019-09-08 06:57:26,593 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:26,594 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 476 states.
[2019-09-08 06:57:26,619 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 430.
[2019-09-08 06:57:26,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:26,622 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 615 transitions.
[2019-09-08 06:57:26,622 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 615 transitions. Word has length 225
[2019-09-08 06:57:26,622 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:26,623 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 615 transitions.
[2019-09-08 06:57:26,623 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:26,623 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 615 transitions.
[2019-09-08 06:57:26,624 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:26,625 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:26,625 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]
[2019-09-08 06:57:26,625 INFO  L418      AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:26,625 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:26,626 INFO  L82        PathProgramCache]: Analyzing trace with hash -801295889, now seen corresponding path program 1 times
[2019-09-08 06:57:26,626 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:26,626 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:26,627 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:26,627 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:26,627 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:26,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:26,718 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 06:57:26,718 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:26,719 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:26,719 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:26,720 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:26,720 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:26,720 INFO  L87              Difference]: Start difference. First operand 430 states and 615 transitions. Second operand 5 states.
[2019-09-08 06:57:27,518 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:27,518 INFO  L93              Difference]: Finished difference Result 875 states and 1272 transitions.
[2019-09-08 06:57:27,519 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:27,519 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:27,519 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:27,522 INFO  L225             Difference]: With dead ends: 875
[2019-09-08 06:57:27,522 INFO  L226             Difference]: Without dead ends: 474
[2019-09-08 06:57:27,524 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:27,525 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 474 states.
[2019-09-08 06:57:27,552 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 430.
[2019-09-08 06:57:27,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:27,555 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 614 transitions.
[2019-09-08 06:57:27,555 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 614 transitions. Word has length 225
[2019-09-08 06:57:27,555 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:27,555 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 614 transitions.
[2019-09-08 06:57:27,555 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:27,555 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 614 transitions.
[2019-09-08 06:57:27,557 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:27,557 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:27,558 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]
[2019-09-08 06:57:27,558 INFO  L418      AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:27,558 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:27,558 INFO  L82        PathProgramCache]: Analyzing trace with hash 356236401, now seen corresponding path program 1 times
[2019-09-08 06:57:27,558 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:27,558 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:27,559 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:27,559 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:27,559 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:27,576 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:27,654 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 06:57:27,654 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:27,654 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:27,655 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:27,655 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:27,655 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:27,656 INFO  L87              Difference]: Start difference. First operand 430 states and 614 transitions. Second operand 5 states.
[2019-09-08 06:57:28,578 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:28,578 INFO  L93              Difference]: Finished difference Result 919 states and 1352 transitions.
[2019-09-08 06:57:28,579 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:28,579 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:28,579 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:28,582 INFO  L225             Difference]: With dead ends: 919
[2019-09-08 06:57:28,582 INFO  L226             Difference]: Without dead ends: 518
[2019-09-08 06:57:28,584 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:28,586 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 518 states.
[2019-09-08 06:57:28,617 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 430.
[2019-09-08 06:57:28,617 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:28,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 613 transitions.
[2019-09-08 06:57:28,620 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 613 transitions. Word has length 225
[2019-09-08 06:57:28,620 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:28,620 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 613 transitions.
[2019-09-08 06:57:28,620 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:28,620 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 613 transitions.
[2019-09-08 06:57:28,622 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:28,622 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:28,622 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]
[2019-09-08 06:57:28,622 INFO  L418      AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:28,622 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:28,623 INFO  L82        PathProgramCache]: Analyzing trace with hash -991897169, now seen corresponding path program 1 times
[2019-09-08 06:57:28,623 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:28,623 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:28,624 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:28,624 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:28,624 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:28,642 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:28,772 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 06:57:28,773 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:28,773 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:28,775 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:28,775 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:28,776 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:28,776 INFO  L87              Difference]: Start difference. First operand 430 states and 613 transitions. Second operand 5 states.
[2019-09-08 06:57:29,929 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:29,929 INFO  L93              Difference]: Finished difference Result 917 states and 1346 transitions.
[2019-09-08 06:57:29,930 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:29,930 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:29,931 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:29,935 INFO  L225             Difference]: With dead ends: 917
[2019-09-08 06:57:29,935 INFO  L226             Difference]: Without dead ends: 516
[2019-09-08 06:57:29,941 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:29,943 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 516 states.
[2019-09-08 06:57:29,995 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 430.
[2019-09-08 06:57:29,996 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:29,998 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 612 transitions.
[2019-09-08 06:57:29,999 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 612 transitions. Word has length 225
[2019-09-08 06:57:29,999 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:30,000 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 612 transitions.
[2019-09-08 06:57:30,000 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:30,000 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 612 transitions.
[2019-09-08 06:57:30,002 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:30,003 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:30,003 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]
[2019-09-08 06:57:30,003 INFO  L418      AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:30,004 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:30,004 INFO  L82        PathProgramCache]: Analyzing trace with hash 765729969, now seen corresponding path program 1 times
[2019-09-08 06:57:30,004 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:30,004 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:30,006 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:30,006 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:30,006 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:30,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:30,196 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 06:57:30,200 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:30,201 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:30,201 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:30,202 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:30,202 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:30,203 INFO  L87              Difference]: Start difference. First operand 430 states and 612 transitions. Second operand 5 states.
[2019-09-08 06:57:31,053 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:31,053 INFO  L93              Difference]: Finished difference Result 913 states and 1336 transitions.
[2019-09-08 06:57:31,054 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:31,054 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:31,054 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:31,058 INFO  L225             Difference]: With dead ends: 913
[2019-09-08 06:57:31,058 INFO  L226             Difference]: Without dead ends: 512
[2019-09-08 06:57:31,060 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:31,061 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 512 states.
[2019-09-08 06:57:31,094 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 430.
[2019-09-08 06:57:31,095 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:31,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 611 transitions.
[2019-09-08 06:57:31,097 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 611 transitions. Word has length 225
[2019-09-08 06:57:31,097 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:31,098 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 611 transitions.
[2019-09-08 06:57:31,098 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:31,098 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 611 transitions.
[2019-09-08 06:57:31,099 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:31,099 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:31,100 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]
[2019-09-08 06:57:31,100 INFO  L418      AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:31,100 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:31,100 INFO  L82        PathProgramCache]: Analyzing trace with hash -50317261, now seen corresponding path program 1 times
[2019-09-08 06:57:31,100 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:31,101 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:31,101 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:31,101 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:31,102 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:31,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:31,198 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 06:57:31,199 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:31,199 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:31,199 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:31,200 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:31,200 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:31,200 INFO  L87              Difference]: Start difference. First operand 430 states and 611 transitions. Second operand 5 states.
[2019-09-08 06:57:32,062 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:32,062 INFO  L93              Difference]: Finished difference Result 911 states and 1330 transitions.
[2019-09-08 06:57:32,063 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:32,063 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:32,063 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:32,067 INFO  L225             Difference]: With dead ends: 911
[2019-09-08 06:57:32,067 INFO  L226             Difference]: Without dead ends: 510
[2019-09-08 06:57:32,069 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:32,070 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 510 states.
[2019-09-08 06:57:32,108 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 430.
[2019-09-08 06:57:32,109 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:32,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 610 transitions.
[2019-09-08 06:57:32,111 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 610 transitions. Word has length 225
[2019-09-08 06:57:32,112 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:32,112 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 610 transitions.
[2019-09-08 06:57:32,112 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:32,112 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 610 transitions.
[2019-09-08 06:57:32,114 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:32,114 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:32,114 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]
[2019-09-08 06:57:32,114 INFO  L418      AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:32,114 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:32,115 INFO  L82        PathProgramCache]: Analyzing trace with hash -2016304015, now seen corresponding path program 1 times
[2019-09-08 06:57:32,115 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:32,115 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:32,116 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:32,116 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:32,116 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:32,133 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:32,257 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 06:57:32,258 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:32,258 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:32,259 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:32,259 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:32,259 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:32,259 INFO  L87              Difference]: Start difference. First operand 430 states and 610 transitions. Second operand 5 states.
[2019-09-08 06:57:33,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:33,180 INFO  L93              Difference]: Finished difference Result 909 states and 1324 transitions.
[2019-09-08 06:57:33,180 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:33,180 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:33,181 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:33,185 INFO  L225             Difference]: With dead ends: 909
[2019-09-08 06:57:33,185 INFO  L226             Difference]: Without dead ends: 508
[2019-09-08 06:57:33,187 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:33,188 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 508 states.
[2019-09-08 06:57:33,225 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 430.
[2019-09-08 06:57:33,225 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:33,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 609 transitions.
[2019-09-08 06:57:33,227 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 609 transitions. Word has length 225
[2019-09-08 06:57:33,227 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:33,227 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 609 transitions.
[2019-09-08 06:57:33,227 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:33,228 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 609 transitions.
[2019-09-08 06:57:33,229 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:33,229 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:33,229 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]
[2019-09-08 06:57:33,230 INFO  L418      AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:33,230 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:33,230 INFO  L82        PathProgramCache]: Analyzing trace with hash -417154957, now seen corresponding path program 1 times
[2019-09-08 06:57:33,230 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:33,230 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:33,231 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:33,231 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:33,231 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:33,248 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:33,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 06:57:33,336 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:33,336 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:33,338 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:33,338 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:33,339 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:33,339 INFO  L87              Difference]: Start difference. First operand 430 states and 609 transitions. Second operand 5 states.
[2019-09-08 06:57:34,136 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:34,137 INFO  L93              Difference]: Finished difference Result 907 states and 1318 transitions.
[2019-09-08 06:57:34,137 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:34,137 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:34,138 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:34,141 INFO  L225             Difference]: With dead ends: 907
[2019-09-08 06:57:34,141 INFO  L226             Difference]: Without dead ends: 506
[2019-09-08 06:57:34,142 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:34,143 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 506 states.
[2019-09-08 06:57:34,181 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 430.
[2019-09-08 06:57:34,181 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:34,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 608 transitions.
[2019-09-08 06:57:34,183 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 608 transitions. Word has length 225
[2019-09-08 06:57:34,183 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:34,183 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 608 transitions.
[2019-09-08 06:57:34,183 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:34,183 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 608 transitions.
[2019-09-08 06:57:34,185 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:34,185 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:34,185 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]
[2019-09-08 06:57:34,186 INFO  L418      AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:34,186 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:34,186 INFO  L82        PathProgramCache]: Analyzing trace with hash 188619825, now seen corresponding path program 1 times
[2019-09-08 06:57:34,186 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:34,186 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:34,187 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:34,187 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:34,187 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:34,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:34,308 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 06:57:34,309 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:34,309 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:34,309 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:34,310 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:34,310 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:34,310 INFO  L87              Difference]: Start difference. First operand 430 states and 608 transitions. Second operand 5 states.
[2019-09-08 06:57:35,164 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:35,165 INFO  L93              Difference]: Finished difference Result 905 states and 1312 transitions.
[2019-09-08 06:57:35,165 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:35,165 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:35,166 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:35,169 INFO  L225             Difference]: With dead ends: 905
[2019-09-08 06:57:35,169 INFO  L226             Difference]: Without dead ends: 504
[2019-09-08 06:57:35,170 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:35,171 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 504 states.
[2019-09-08 06:57:35,211 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 430.
[2019-09-08 06:57:35,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:35,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 607 transitions.
[2019-09-08 06:57:35,213 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 607 transitions. Word has length 225
[2019-09-08 06:57:35,214 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:35,214 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 607 transitions.
[2019-09-08 06:57:35,214 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:35,214 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 607 transitions.
[2019-09-08 06:57:35,216 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:35,216 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:35,216 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]
[2019-09-08 06:57:35,216 INFO  L418      AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:35,216 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:35,217 INFO  L82        PathProgramCache]: Analyzing trace with hash 208160947, now seen corresponding path program 1 times
[2019-09-08 06:57:35,217 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:35,217 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:35,218 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:35,218 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:35,218 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:35,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:35,311 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 06:57:35,311 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:35,311 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:35,312 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:35,312 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:35,313 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:35,313 INFO  L87              Difference]: Start difference. First operand 430 states and 607 transitions. Second operand 5 states.
[2019-09-08 06:57:36,123 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:36,124 INFO  L93              Difference]: Finished difference Result 903 states and 1306 transitions.
[2019-09-08 06:57:36,124 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:36,124 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:36,125 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:36,128 INFO  L225             Difference]: With dead ends: 903
[2019-09-08 06:57:36,128 INFO  L226             Difference]: Without dead ends: 502
[2019-09-08 06:57:36,130 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:36,130 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 502 states.
[2019-09-08 06:57:36,166 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 430.
[2019-09-08 06:57:36,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:36,168 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 606 transitions.
[2019-09-08 06:57:36,169 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 606 transitions. Word has length 225
[2019-09-08 06:57:36,169 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:36,169 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 606 transitions.
[2019-09-08 06:57:36,169 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:36,169 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 606 transitions.
[2019-09-08 06:57:36,171 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:36,171 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:36,171 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]
[2019-09-08 06:57:36,172 INFO  L418      AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:36,172 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:36,172 INFO  L82        PathProgramCache]: Analyzing trace with hash -622492687, now seen corresponding path program 1 times
[2019-09-08 06:57:36,172 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:36,172 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:36,173 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:36,173 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:36,173 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:36,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:36,303 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 06:57:36,303 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:36,303 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 06:57:36,304 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 06:57:36,304 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 06:57:36,304 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 06:57:36,304 INFO  L87              Difference]: Start difference. First operand 430 states and 606 transitions. Second operand 5 states.
[2019-09-08 06:57:37,340 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:37,340 INFO  L93              Difference]: Finished difference Result 901 states and 1300 transitions.
[2019-09-08 06:57:37,341 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 06:57:37,341 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 225
[2019-09-08 06:57:37,341 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:37,345 INFO  L225             Difference]: With dead ends: 901
[2019-09-08 06:57:37,345 INFO  L226             Difference]: Without dead ends: 500
[2019-09-08 06:57:37,347 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:57:37,348 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 500 states.
[2019-09-08 06:57:37,417 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 430.
[2019-09-08 06:57:37,417 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2019-09-08 06:57:37,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 605 transitions.
[2019-09-08 06:57:37,420 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 605 transitions. Word has length 225
[2019-09-08 06:57:37,420 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:37,421 INFO  L475      AbstractCegarLoop]: Abstraction has 430 states and 605 transitions.
[2019-09-08 06:57:37,421 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 06:57:37,421 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 605 transitions.
[2019-09-08 06:57:37,423 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:37,424 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:37,424 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]
[2019-09-08 06:57:37,425 INFO  L418      AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:37,425 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:37,425 INFO  L82        PathProgramCache]: Analyzing trace with hash -95098637, now seen corresponding path program 1 times
[2019-09-08 06:57:37,425 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:37,426 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:37,426 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:37,427 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:37,427 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:37,451 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:37,592 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 06:57:37,593 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:37,593 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 06:57:37,594 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 06:57:37,594 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 06:57:37,594 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 06:57:37,595 INFO  L87              Difference]: Start difference. First operand 430 states and 605 transitions. Second operand 4 states.
[2019-09-08 06:57:38,329 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:38,330 INFO  L93              Difference]: Finished difference Result 1222 states and 1774 transitions.
[2019-09-08 06:57:38,330 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 06:57:38,330 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 225
[2019-09-08 06:57:38,331 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:38,339 INFO  L225             Difference]: With dead ends: 1222
[2019-09-08 06:57:38,339 INFO  L226             Difference]: Without dead ends: 822
[2019-09-08 06:57:38,342 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 06:57:38,344 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 822 states.
[2019-09-08 06:57:38,556 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 817.
[2019-09-08 06:57:38,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 817 states.
[2019-09-08 06:57:38,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1149 transitions.
[2019-09-08 06:57:38,561 INFO  L78                 Accepts]: Start accepts. Automaton has 817 states and 1149 transitions. Word has length 225
[2019-09-08 06:57:38,561 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:38,561 INFO  L475      AbstractCegarLoop]: Abstraction has 817 states and 1149 transitions.
[2019-09-08 06:57:38,561 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 06:57:38,562 INFO  L276                IsEmpty]: Start isEmpty. Operand 817 states and 1149 transitions.
[2019-09-08 06:57:38,564 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:38,564 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:38,565 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]
[2019-09-08 06:57:38,565 INFO  L418      AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:38,566 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:38,566 INFO  L82        PathProgramCache]: Analyzing trace with hash 884601780, now seen corresponding path program 1 times
[2019-09-08 06:57:38,566 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:38,567 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:38,569 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:38,569 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:38,569 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:38,602 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:38,728 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 06:57:38,730 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:38,731 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 06:57:38,731 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 06:57:38,732 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 06:57:38,734 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 06:57:38,734 INFO  L87              Difference]: Start difference. First operand 817 states and 1149 transitions. Second operand 6 states.
[2019-09-08 06:57:39,035 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:39,035 INFO  L93              Difference]: Finished difference Result 1644 states and 2372 transitions.
[2019-09-08 06:57:39,036 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-09-08 06:57:39,036 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 225
[2019-09-08 06:57:39,036 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:39,042 INFO  L225             Difference]: With dead ends: 1644
[2019-09-08 06:57:39,042 INFO  L226             Difference]: Without dead ends: 857
[2019-09-08 06:57:39,052 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-09-08 06:57:39,054 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 857 states.
[2019-09-08 06:57:39,268 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 822.
[2019-09-08 06:57:39,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 822 states.
[2019-09-08 06:57:39,272 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1153 transitions.
[2019-09-08 06:57:39,273 INFO  L78                 Accepts]: Start accepts. Automaton has 822 states and 1153 transitions. Word has length 225
[2019-09-08 06:57:39,273 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:39,274 INFO  L475      AbstractCegarLoop]: Abstraction has 822 states and 1153 transitions.
[2019-09-08 06:57:39,274 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 06:57:39,274 INFO  L276                IsEmpty]: Start isEmpty. Operand 822 states and 1153 transitions.
[2019-09-08 06:57:39,277 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:39,277 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:39,277 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]
[2019-09-08 06:57:39,278 INFO  L418      AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:39,278 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:39,278 INFO  L82        PathProgramCache]: Analyzing trace with hash 1551983670, now seen corresponding path program 1 times
[2019-09-08 06:57:39,278 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:39,279 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:39,280 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:39,281 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:39,281 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:39,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:39,457 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 06:57:39,458 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:39,458 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 06:57:39,459 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 06:57:39,459 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 06:57:39,459 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 06:57:39,459 INFO  L87              Difference]: Start difference. First operand 822 states and 1153 transitions. Second operand 4 states.
[2019-09-08 06:57:40,128 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:40,128 INFO  L93              Difference]: Finished difference Result 2393 states and 3465 transitions.
[2019-09-08 06:57:40,129 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 06:57:40,129 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 225
[2019-09-08 06:57:40,129 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:40,137 INFO  L225             Difference]: With dead ends: 2393
[2019-09-08 06:57:40,137 INFO  L226             Difference]: Without dead ends: 1601
[2019-09-08 06:57:40,140 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 06:57:40,142 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1601 states.
[2019-09-08 06:57:40,315 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1594.
[2019-09-08 06:57:40,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1594 states.
[2019-09-08 06:57:40,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2234 transitions.
[2019-09-08 06:57:40,324 INFO  L78                 Accepts]: Start accepts. Automaton has 1594 states and 2234 transitions. Word has length 225
[2019-09-08 06:57:40,324 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:40,324 INFO  L475      AbstractCegarLoop]: Abstraction has 1594 states and 2234 transitions.
[2019-09-08 06:57:40,325 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 06:57:40,325 INFO  L276                IsEmpty]: Start isEmpty. Operand 1594 states and 2234 transitions.
[2019-09-08 06:57:40,328 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:40,328 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:40,328 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]
[2019-09-08 06:57:40,329 INFO  L418      AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:40,329 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:40,329 INFO  L82        PathProgramCache]: Analyzing trace with hash 1824394325, now seen corresponding path program 1 times
[2019-09-08 06:57:40,329 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:40,330 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:40,331 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:40,331 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:40,331 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:40,355 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:40,467 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 06:57:40,468 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:40,468 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 06:57:40,469 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 06:57:40,470 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 06:57:40,470 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 06:57:40,470 INFO  L87              Difference]: Start difference. First operand 1594 states and 2234 transitions. Second operand 6 states.
[2019-09-08 06:57:40,859 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:40,859 INFO  L93              Difference]: Finished difference Result 3232 states and 4647 transitions.
[2019-09-08 06:57:40,860 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-09-08 06:57:40,860 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 225
[2019-09-08 06:57:40,861 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:40,876 INFO  L225             Difference]: With dead ends: 3232
[2019-09-08 06:57:40,876 INFO  L226             Difference]: Without dead ends: 1668
[2019-09-08 06:57:40,883 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-09-08 06:57:40,885 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1668 states.
[2019-09-08 06:57:41,167 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1604.
[2019-09-08 06:57:41,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1604 states.
[2019-09-08 06:57:41,175 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2242 transitions.
[2019-09-08 06:57:41,176 INFO  L78                 Accepts]: Start accepts. Automaton has 1604 states and 2242 transitions. Word has length 225
[2019-09-08 06:57:41,177 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:41,177 INFO  L475      AbstractCegarLoop]: Abstraction has 1604 states and 2242 transitions.
[2019-09-08 06:57:41,177 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 06:57:41,177 INFO  L276                IsEmpty]: Start isEmpty. Operand 1604 states and 2242 transitions.
[2019-09-08 06:57:41,180 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:41,180 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:41,181 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]
[2019-09-08 06:57:41,181 INFO  L418      AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:41,181 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:41,182 INFO  L82        PathProgramCache]: Analyzing trace with hash 901226899, now seen corresponding path program 1 times
[2019-09-08 06:57:41,182 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:41,182 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:41,183 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:41,183 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:41,183 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:41,211 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:41,322 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 06:57:41,322 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:41,323 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 06:57:41,323 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 06:57:41,324 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 06:57:41,324 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 06:57:41,324 INFO  L87              Difference]: Start difference. First operand 1604 states and 2242 transitions. Second operand 6 states.
[2019-09-08 06:57:41,584 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:41,585 INFO  L93              Difference]: Finished difference Result 3314 states and 4764 transitions.
[2019-09-08 06:57:41,585 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-09-08 06:57:41,585 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 225
[2019-09-08 06:57:41,586 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:41,599 INFO  L225             Difference]: With dead ends: 3314
[2019-09-08 06:57:41,599 INFO  L226             Difference]: Without dead ends: 1740
[2019-09-08 06:57:41,605 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-09-08 06:57:41,607 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1740 states.
[2019-09-08 06:57:41,787 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1624.
[2019-09-08 06:57:41,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1624 states.
[2019-09-08 06:57:41,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2262 transitions.
[2019-09-08 06:57:41,793 INFO  L78                 Accepts]: Start accepts. Automaton has 1624 states and 2262 transitions. Word has length 225
[2019-09-08 06:57:41,793 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:41,794 INFO  L475      AbstractCegarLoop]: Abstraction has 1624 states and 2262 transitions.
[2019-09-08 06:57:41,794 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 06:57:41,794 INFO  L276                IsEmpty]: Start isEmpty. Operand 1624 states and 2262 transitions.
[2019-09-08 06:57:41,795 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:41,796 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:41,796 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]
[2019-09-08 06:57:41,796 INFO  L418      AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:41,796 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:41,797 INFO  L82        PathProgramCache]: Analyzing trace with hash 745246357, now seen corresponding path program 1 times
[2019-09-08 06:57:41,797 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:41,797 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:41,798 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:41,798 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:41,798 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:41,814 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:41,890 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 06:57:41,890 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:41,890 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 06:57:41,891 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 06:57:41,891 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 06:57:41,892 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 06:57:41,892 INFO  L87              Difference]: Start difference. First operand 1624 states and 2262 transitions. Second operand 4 states.
[2019-09-08 06:57:42,709 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:42,710 INFO  L93              Difference]: Finished difference Result 4787 states and 6886 transitions.
[2019-09-08 06:57:42,710 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 06:57:42,710 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 225
[2019-09-08 06:57:42,711 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:42,727 INFO  L225             Difference]: With dead ends: 4787
[2019-09-08 06:57:42,727 INFO  L226             Difference]: Without dead ends: 3193
[2019-09-08 06:57:42,734 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 06:57:42,738 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3193 states.
[2019-09-08 06:57:43,086 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3182.
[2019-09-08 06:57:43,087 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3182 states.
[2019-09-08 06:57:43,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4430 transitions.
[2019-09-08 06:57:43,098 INFO  L78                 Accepts]: Start accepts. Automaton has 3182 states and 4430 transitions. Word has length 225
[2019-09-08 06:57:43,099 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:43,099 INFO  L475      AbstractCegarLoop]: Abstraction has 3182 states and 4430 transitions.
[2019-09-08 06:57:43,099 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 06:57:43,099 INFO  L276                IsEmpty]: Start isEmpty. Operand 3182 states and 4430 transitions.
[2019-09-08 06:57:43,101 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:43,101 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:43,101 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]
[2019-09-08 06:57:43,102 INFO  L418      AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:43,102 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:43,102 INFO  L82        PathProgramCache]: Analyzing trace with hash -78950284, now seen corresponding path program 1 times
[2019-09-08 06:57:43,102 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:43,102 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:43,103 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:43,103 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:43,103 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:43,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:43,185 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 06:57:43,185 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:43,186 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 06:57:43,186 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 06:57:43,186 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 06:57:43,187 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 06:57:43,187 INFO  L87              Difference]: Start difference. First operand 3182 states and 4430 transitions. Second operand 6 states.
[2019-09-08 06:57:43,584 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:43,585 INFO  L93              Difference]: Finished difference Result 6458 states and 9221 transitions.
[2019-09-08 06:57:43,585 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-09-08 06:57:43,585 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 225
[2019-09-08 06:57:43,586 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:43,606 INFO  L225             Difference]: With dead ends: 6458
[2019-09-08 06:57:43,606 INFO  L226             Difference]: Without dead ends: 3306
[2019-09-08 06:57:43,620 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-09-08 06:57:43,626 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3306 states.
[2019-09-08 06:57:43,989 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 3202.
[2019-09-08 06:57:43,989 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3202 states.
[2019-09-08 06:57:44,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 4446 transitions.
[2019-09-08 06:57:44,002 INFO  L78                 Accepts]: Start accepts. Automaton has 3202 states and 4446 transitions. Word has length 225
[2019-09-08 06:57:44,002 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:44,002 INFO  L475      AbstractCegarLoop]: Abstraction has 3202 states and 4446 transitions.
[2019-09-08 06:57:44,002 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 06:57:44,003 INFO  L276                IsEmpty]: Start isEmpty. Operand 3202 states and 4446 transitions.
[2019-09-08 06:57:44,005 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:44,005 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:44,005 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]
[2019-09-08 06:57:44,005 INFO  L418      AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:44,005 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:44,006 INFO  L82        PathProgramCache]: Analyzing trace with hash 209869106, now seen corresponding path program 1 times
[2019-09-08 06:57:44,006 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:44,006 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:44,007 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:44,007 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:44,007 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:44,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:44,106 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 06:57:44,106 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:44,107 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 06:57:44,107 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 06:57:44,107 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 06:57:44,108 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 06:57:44,108 INFO  L87              Difference]: Start difference. First operand 3202 states and 4446 transitions. Second operand 4 states.
[2019-09-08 06:57:45,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:45,179 INFO  L93              Difference]: Finished difference Result 9497 states and 13636 transitions.
[2019-09-08 06:57:45,180 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 06:57:45,180 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 225
[2019-09-08 06:57:45,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:45,221 INFO  L225             Difference]: With dead ends: 9497
[2019-09-08 06:57:45,222 INFO  L226             Difference]: Without dead ends: 6325
[2019-09-08 06:57:45,237 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 06:57:45,248 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6325 states.
[2019-09-08 06:57:46,075 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6325 to 6306.
[2019-09-08 06:57:46,075 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6306 states.
[2019-09-08 06:57:46,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6306 states to 6306 states and 8760 transitions.
[2019-09-08 06:57:46,103 INFO  L78                 Accepts]: Start accepts. Automaton has 6306 states and 8760 transitions. Word has length 225
[2019-09-08 06:57:46,104 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:46,104 INFO  L475      AbstractCegarLoop]: Abstraction has 6306 states and 8760 transitions.
[2019-09-08 06:57:46,104 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 06:57:46,104 INFO  L276                IsEmpty]: Start isEmpty. Operand 6306 states and 8760 transitions.
[2019-09-08 06:57:46,107 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:46,107 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:46,108 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]
[2019-09-08 06:57:46,110 INFO  L418      AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:46,110 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:46,110 INFO  L82        PathProgramCache]: Analyzing trace with hash -567660429, now seen corresponding path program 1 times
[2019-09-08 06:57:46,110 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:46,111 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:46,111 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:46,112 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:46,112 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:46,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:46,252 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 06:57:46,252 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:46,253 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 06:57:46,253 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 06:57:46,254 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 06:57:46,254 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 06:57:46,255 INFO  L87              Difference]: Start difference. First operand 6306 states and 8760 transitions. Second operand 6 states.
[2019-09-08 06:57:46,960 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:46,960 INFO  L93              Difference]: Finished difference Result 12806 states and 18255 transitions.
[2019-09-08 06:57:46,960 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-09-08 06:57:46,961 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 225
[2019-09-08 06:57:46,961 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:46,989 INFO  L225             Difference]: With dead ends: 12806
[2019-09-08 06:57:46,989 INFO  L226             Difference]: Without dead ends: 6530
[2019-09-08 06:57:47,012 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-09-08 06:57:47,022 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6530 states.
[2019-09-08 06:57:47,528 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6530 to 6346.
[2019-09-08 06:57:47,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6346 states.
[2019-09-08 06:57:47,543 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6346 states to 6346 states and 8792 transitions.
[2019-09-08 06:57:47,545 INFO  L78                 Accepts]: Start accepts. Automaton has 6346 states and 8792 transitions. Word has length 225
[2019-09-08 06:57:47,546 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:47,546 INFO  L475      AbstractCegarLoop]: Abstraction has 6346 states and 8792 transitions.
[2019-09-08 06:57:47,546 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 06:57:47,546 INFO  L276                IsEmpty]: Start isEmpty. Operand 6346 states and 8792 transitions.
[2019-09-08 06:57:47,548 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:47,548 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:47,548 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]
[2019-09-08 06:57:47,549 INFO  L418      AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:47,549 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:47,549 INFO  L82        PathProgramCache]: Analyzing trace with hash 294173173, now seen corresponding path program 1 times
[2019-09-08 06:57:47,549 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:47,549 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:47,550 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:47,550 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:47,550 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:47,571 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:48,111 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 06:57:48,111 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:48,112 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 06:57:48,112 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 06:57:48,113 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 06:57:48,113 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 06:57:48,113 INFO  L87              Difference]: Start difference. First operand 6346 states and 8792 transitions. Second operand 4 states.
[2019-09-08 06:57:49,438 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:49,438 INFO  L93              Difference]: Finished difference Result 18881 states and 27108 transitions.
[2019-09-08 06:57:49,438 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 06:57:49,439 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 225
[2019-09-08 06:57:49,439 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:49,489 INFO  L225             Difference]: With dead ends: 18881
[2019-09-08 06:57:49,489 INFO  L226             Difference]: Without dead ends: 12565
[2019-09-08 06:57:49,508 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 06:57:49,521 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12565 states.
[2019-09-08 06:57:50,592 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12565 to 12530.
[2019-09-08 06:57:50,592 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12530 states.
[2019-09-08 06:57:50,618 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12530 states to 12530 states and 17394 transitions.
[2019-09-08 06:57:50,621 INFO  L78                 Accepts]: Start accepts. Automaton has 12530 states and 17394 transitions. Word has length 225
[2019-09-08 06:57:50,621 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:50,621 INFO  L475      AbstractCegarLoop]: Abstraction has 12530 states and 17394 transitions.
[2019-09-08 06:57:50,621 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 06:57:50,622 INFO  L276                IsEmpty]: Start isEmpty. Operand 12530 states and 17394 transitions.
[2019-09-08 06:57:50,623 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:50,624 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:50,624 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]
[2019-09-08 06:57:50,624 INFO  L418      AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:50,624 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:50,624 INFO  L82        PathProgramCache]: Analyzing trace with hash -934115948, now seen corresponding path program 1 times
[2019-09-08 06:57:50,625 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:50,625 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:50,625 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:50,626 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:50,626 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:50,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:50,716 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 06:57:50,716 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:50,717 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 06:57:50,717 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 06:57:50,717 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 06:57:50,718 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 06:57:50,718 INFO  L87              Difference]: Start difference. First operand 12530 states and 17394 transitions. Second operand 6 states.
[2019-09-08 06:57:51,716 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:51,716 INFO  L93              Difference]: Finished difference Result 25430 states and 36269 transitions.
[2019-09-08 06:57:51,716 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-09-08 06:57:51,716 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 225
[2019-09-08 06:57:51,717 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:51,765 INFO  L225             Difference]: With dead ends: 25430
[2019-09-08 06:57:51,765 INFO  L226             Difference]: Without dead ends: 12930
[2019-09-08 06:57:51,799 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-09-08 06:57:51,813 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12930 states.
[2019-09-08 06:57:52,715 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12930 to 12610.
[2019-09-08 06:57:52,715 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12610 states.
[2019-09-08 06:57:52,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12610 states to 12610 states and 17458 transitions.
[2019-09-08 06:57:52,744 INFO  L78                 Accepts]: Start accepts. Automaton has 12610 states and 17458 transitions. Word has length 225
[2019-09-08 06:57:52,745 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:52,745 INFO  L475      AbstractCegarLoop]: Abstraction has 12610 states and 17458 transitions.
[2019-09-08 06:57:52,745 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 06:57:52,745 INFO  L276                IsEmpty]: Start isEmpty. Operand 12610 states and 17458 transitions.
[2019-09-08 06:57:52,747 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:52,747 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:52,747 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]
[2019-09-08 06:57:52,747 INFO  L418      AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:52,748 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:52,748 INFO  L82        PathProgramCache]: Analyzing trace with hash 1067770322, now seen corresponding path program 1 times
[2019-09-08 06:57:52,748 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:52,748 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:52,749 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:52,749 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:52,749 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:52,770 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:53,001 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 06:57:53,002 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:53,002 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 06:57:53,002 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 06:57:53,003 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 06:57:53,003 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 06:57:53,003 INFO  L87              Difference]: Start difference. First operand 12610 states and 17458 transitions. Second operand 4 states.
[2019-09-08 06:57:55,210 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:57:55,211 INFO  L93              Difference]: Finished difference Result 37577 states and 54104 transitions.
[2019-09-08 06:57:55,211 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 06:57:55,211 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 225
[2019-09-08 06:57:55,211 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:57:55,295 INFO  L225             Difference]: With dead ends: 37577
[2019-09-08 06:57:55,295 INFO  L226             Difference]: Without dead ends: 24997
[2019-09-08 06:57:55,343 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 06:57:55,368 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24997 states.
[2019-09-08 06:57:57,404 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24997 to 24930.
[2019-09-08 06:57:57,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24930 states.
[2019-09-08 06:57:57,472 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24930 states to 24930 states and 34664 transitions.
[2019-09-08 06:57:57,476 INFO  L78                 Accepts]: Start accepts. Automaton has 24930 states and 34664 transitions. Word has length 225
[2019-09-08 06:57:57,477 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:57:57,477 INFO  L475      AbstractCegarLoop]: Abstraction has 24930 states and 34664 transitions.
[2019-09-08 06:57:57,477 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 06:57:57,477 INFO  L276                IsEmpty]: Start isEmpty. Operand 24930 states and 34664 transitions.
[2019-09-08 06:57:57,479 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:57:57,479 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:57:57,479 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]
[2019-09-08 06:57:57,480 INFO  L418      AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:57:57,480 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:57:57,480 INFO  L82        PathProgramCache]: Analyzing trace with hash 1792849747, now seen corresponding path program 1 times
[2019-09-08 06:57:57,480 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:57:57,480 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:57:57,481 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:57,481 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:57:57,481 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:57:57,502 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:57:57,577 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 06:57:57,577 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:57:57,578 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 06:57:57,578 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 06:57:57,579 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 06:57:57,579 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 06:57:57,579 INFO  L87              Difference]: Start difference. First operand 24930 states and 34664 transitions. Second operand 6 states.
[2019-09-08 06:58:00,150 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:58:00,150 INFO  L93              Difference]: Finished difference Result 50534 states and 72351 transitions.
[2019-09-08 06:58:00,153 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-09-08 06:58:00,153 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 225
[2019-09-08 06:58:00,154 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:58:00,244 INFO  L225             Difference]: With dead ends: 50534
[2019-09-08 06:58:00,245 INFO  L226             Difference]: Without dead ends: 25634
[2019-09-08 06:58:00,324 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-09-08 06:58:00,352 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25634 states.
[2019-09-08 06:58:02,373 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25634 to 25090.
[2019-09-08 06:58:02,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25090 states.
[2019-09-08 06:58:02,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25090 states to 25090 states and 34792 transitions.
[2019-09-08 06:58:02,433 INFO  L78                 Accepts]: Start accepts. Automaton has 25090 states and 34792 transitions. Word has length 225
[2019-09-08 06:58:02,434 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:58:02,434 INFO  L475      AbstractCegarLoop]: Abstraction has 25090 states and 34792 transitions.
[2019-09-08 06:58:02,434 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 06:58:02,434 INFO  L276                IsEmpty]: Start isEmpty. Operand 25090 states and 34792 transitions.
[2019-09-08 06:58:02,435 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:58:02,435 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:58:02,435 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]
[2019-09-08 06:58:02,435 INFO  L418      AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:58:02,436 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:58:02,436 INFO  L82        PathProgramCache]: Analyzing trace with hash 1911291221, now seen corresponding path program 1 times
[2019-09-08 06:58:02,436 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:58:02,436 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:58:02,436 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:58:02,437 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:58:02,437 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:58:02,455 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:58:02,526 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 06:58:02,526 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:58:02,526 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 06:58:02,527 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 06:58:02,527 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 06:58:02,527 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 06:58:02,527 INFO  L87              Difference]: Start difference. First operand 25090 states and 34792 transitions. Second operand 4 states.
[2019-09-08 06:58:07,698 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:58:07,698 INFO  L93              Difference]: Finished difference Result 74825 states and 108524 transitions.
[2019-09-08 06:58:07,698 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 06:58:07,698 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 225
[2019-09-08 06:58:07,699 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:58:07,895 INFO  L225             Difference]: With dead ends: 74825
[2019-09-08 06:58:07,895 INFO  L226             Difference]: Without dead ends: 49765
[2019-09-08 06:58:08,006 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 06:58:08,057 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49765 states.
[2019-09-08 06:58:13,443 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49765 to 49634.
[2019-09-08 06:58:13,444 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 49634 states.
[2019-09-08 06:58:13,595 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49634 states to 49634 states and 69370 transitions.
[2019-09-08 06:58:13,605 INFO  L78                 Accepts]: Start accepts. Automaton has 49634 states and 69370 transitions. Word has length 225
[2019-09-08 06:58:13,605 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:58:13,605 INFO  L475      AbstractCegarLoop]: Abstraction has 49634 states and 69370 transitions.
[2019-09-08 06:58:13,605 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 06:58:13,606 INFO  L276                IsEmpty]: Start isEmpty. Operand 49634 states and 69370 transitions.
[2019-09-08 06:58:13,607 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:58:13,607 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:58:13,608 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]
[2019-09-08 06:58:13,608 INFO  L418      AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:58:13,608 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:58:13,608 INFO  L82        PathProgramCache]: Analyzing trace with hash 46318260, now seen corresponding path program 1 times
[2019-09-08 06:58:13,608 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:58:13,608 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:58:13,609 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:58:13,609 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:58:13,609 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:58:13,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:58:13,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 06:58:13,692 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:58:13,692 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 06:58:13,693 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 06:58:13,693 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 06:58:13,693 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 06:58:13,693 INFO  L87              Difference]: Start difference. First operand 49634 states and 69370 transitions. Second operand 6 states.
[2019-09-08 06:58:17,419 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:58:17,420 INFO  L93              Difference]: Finished difference Result 100454 states and 145109 transitions.
[2019-09-08 06:58:17,420 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-09-08 06:58:17,420 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 225
[2019-09-08 06:58:17,420 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:58:17,602 INFO  L225             Difference]: With dead ends: 100454
[2019-09-08 06:58:17,602 INFO  L226             Difference]: Without dead ends: 50850
[2019-09-08 06:58:17,773 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-09-08 06:58:17,828 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50850 states.
[2019-09-08 06:58:23,844 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50850 to 49954.
[2019-09-08 06:58:23,844 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 49954 states.
[2019-09-08 06:58:24,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49954 states to 49954 states and 69626 transitions.
[2019-09-08 06:58:24,013 INFO  L78                 Accepts]: Start accepts. Automaton has 49954 states and 69626 transitions. Word has length 225
[2019-09-08 06:58:24,014 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:58:24,014 INFO  L475      AbstractCegarLoop]: Abstraction has 49954 states and 69626 transitions.
[2019-09-08 06:58:24,014 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 06:58:24,014 INFO  L276                IsEmpty]: Start isEmpty. Operand 49954 states and 69626 transitions.
[2019-09-08 06:58:24,016 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:58:24,016 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:58:24,016 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]
[2019-09-08 06:58:24,017 INFO  L418      AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:58:24,017 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:58:24,017 INFO  L82        PathProgramCache]: Analyzing trace with hash -1010412942, now seen corresponding path program 1 times
[2019-09-08 06:58:24,017 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:58:24,017 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:58:24,018 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:58:24,018 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:58:24,018 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:58:24,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:58:24,110 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 06:58:24,111 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:58:24,111 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 06:58:24,112 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 06:58:24,112 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 06:58:24,112 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 06:58:24,112 INFO  L87              Difference]: Start difference. First operand 49954 states and 69626 transitions. Second operand 4 states.
[2019-09-08 06:58:32,283 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:58:32,283 INFO  L93              Difference]: Finished difference Result 149033 states and 219192 transitions.
[2019-09-08 06:58:32,284 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 06:58:32,284 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 225
[2019-09-08 06:58:32,284 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:58:32,594 INFO  L225             Difference]: With dead ends: 149033
[2019-09-08 06:58:32,594 INFO  L226             Difference]: Without dead ends: 99109
[2019-09-08 06:58:32,791 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 06:58:32,864 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99109 states.
[2019-09-08 06:58:42,808 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99109 to 98850.
[2019-09-08 06:58:42,808 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 98850 states.
[2019-09-08 06:58:43,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98850 states to 98850 states and 139600 transitions.
[2019-09-08 06:58:43,461 INFO  L78                 Accepts]: Start accepts. Automaton has 98850 states and 139600 transitions. Word has length 225
[2019-09-08 06:58:43,461 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:58:43,461 INFO  L475      AbstractCegarLoop]: Abstraction has 98850 states and 139600 transitions.
[2019-09-08 06:58:43,462 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 06:58:43,462 INFO  L276                IsEmpty]: Start isEmpty. Operand 98850 states and 139600 transitions.
[2019-09-08 06:58:43,463 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:58:43,464 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:58:43,464 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]
[2019-09-08 06:58:43,464 INFO  L418      AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:58:43,464 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:58:43,465 INFO  L82        PathProgramCache]: Analyzing trace with hash 106772019, now seen corresponding path program 1 times
[2019-09-08 06:58:43,465 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:58:43,465 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:58:43,465 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:58:43,466 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:58:43,466 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:58:43,492 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:58:43,562 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 06:58:43,563 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:58:43,563 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 06:58:43,563 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 06:58:43,563 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 06:58:43,564 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 06:58:43,564 INFO  L87              Difference]: Start difference. First operand 98850 states and 139600 transitions. Second operand 6 states.
[2019-09-08 06:58:54,835 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:58:54,835 INFO  L93              Difference]: Finished difference Result 199718 states and 293271 transitions.
[2019-09-08 06:58:54,836 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-09-08 06:58:54,836 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 225
[2019-09-08 06:58:54,836 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:58:55,209 INFO  L225             Difference]: With dead ends: 199718
[2019-09-08 06:58:55,209 INFO  L226             Difference]: Without dead ends: 100898
[2019-09-08 06:58:55,884 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-09-08 06:58:55,952 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 100898 states.
[2019-09-08 06:59:07,339 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 100898 to 99490.
[2019-09-08 06:59:07,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 99490 states.
[2019-09-08 06:59:07,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99490 states to 99490 states and 140112 transitions.
[2019-09-08 06:59:07,721 INFO  L78                 Accepts]: Start accepts. Automaton has 99490 states and 140112 transitions. Word has length 225
[2019-09-08 06:59:07,722 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:59:07,722 INFO  L475      AbstractCegarLoop]: Abstraction has 99490 states and 140112 transitions.
[2019-09-08 06:59:07,722 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 06:59:07,722 INFO  L276                IsEmpty]: Start isEmpty. Operand 99490 states and 140112 transitions.
[2019-09-08 06:59:07,723 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:59:07,724 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:59:07,724 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]
[2019-09-08 06:59:07,724 INFO  L418      AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:59:07,724 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:59:07,724 INFO  L82        PathProgramCache]: Analyzing trace with hash -479504203, now seen corresponding path program 1 times
[2019-09-08 06:59:07,724 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:59:07,724 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:59:07,725 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:59:07,725 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:59:07,725 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:59:07,742 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:59:07,808 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 06:59:07,809 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:59:07,809 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 06:59:07,809 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 06:59:07,810 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 06:59:07,810 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 06:59:07,810 INFO  L87              Difference]: Start difference. First operand 99490 states and 140112 transitions. Second operand 4 states.
[2019-09-08 06:59:25,851 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 06:59:25,851 INFO  L93              Difference]: Finished difference Result 296873 states and 447100 transitions.
[2019-09-08 06:59:25,851 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 06:59:25,851 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 225
[2019-09-08 06:59:25,852 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 06:59:26,550 INFO  L225             Difference]: With dead ends: 296873
[2019-09-08 06:59:26,551 INFO  L226             Difference]: Without dead ends: 197413
[2019-09-08 06:59:27,089 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 06:59:27,255 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 197413 states.
[2019-09-08 06:59:49,320 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 197413 to 196898.
[2019-09-08 06:59:49,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 196898 states.
[2019-09-08 06:59:50,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 196898 states to 196898 states and 283154 transitions.
[2019-09-08 06:59:50,312 INFO  L78                 Accepts]: Start accepts. Automaton has 196898 states and 283154 transitions. Word has length 225
[2019-09-08 06:59:50,313 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 06:59:50,313 INFO  L475      AbstractCegarLoop]: Abstraction has 196898 states and 283154 transitions.
[2019-09-08 06:59:50,313 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 06:59:50,313 INFO  L276                IsEmpty]: Start isEmpty. Operand 196898 states and 283154 transitions.
[2019-09-08 06:59:50,315 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 06:59:50,315 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 06:59:50,316 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]
[2019-09-08 06:59:50,316 INFO  L418      AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 06:59:50,316 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 06:59:50,317 INFO  L82        PathProgramCache]: Analyzing trace with hash -934410284, now seen corresponding path program 1 times
[2019-09-08 06:59:50,317 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 06:59:50,317 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 06:59:50,320 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:59:50,320 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 06:59:50,320 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 06:59:50,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 06:59:50,421 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 06:59:50,422 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 06:59:50,422 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 06:59:50,423 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 06:59:50,423 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 06:59:50,423 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 06:59:50,423 INFO  L87              Difference]: Start difference. First operand 196898 states and 283154 transitions. Second operand 6 states.
[2019-09-08 07:00:13,842 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:00:13,842 INFO  L93              Difference]: Finished difference Result 397094 states and 599261 transitions.
[2019-09-08 07:00:13,843 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-09-08 07:00:13,843 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 225
[2019-09-08 07:00:13,843 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:00:14,601 INFO  L225             Difference]: With dead ends: 397094
[2019-09-08 07:00:14,602 INFO  L226             Difference]: Without dead ends: 200226
[2019-09-08 07:00:16,427 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-09-08 07:00:16,553 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 200226 states.
[2019-09-08 07:00:43,711 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 200226 to 198178.
[2019-09-08 07:00:43,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 198178 states.
[2019-09-08 07:00:44,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 198178 states to 198178 states and 284178 transitions.
[2019-09-08 07:00:44,727 INFO  L78                 Accepts]: Start accepts. Automaton has 198178 states and 284178 transitions. Word has length 225
[2019-09-08 07:00:44,727 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:00:44,727 INFO  L475      AbstractCegarLoop]: Abstraction has 198178 states and 284178 transitions.
[2019-09-08 07:00:44,727 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 07:00:44,728 INFO  L276                IsEmpty]: Start isEmpty. Operand 198178 states and 284178 transitions.
[2019-09-08 07:00:44,729 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 07:00:44,729 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:00:44,729 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]
[2019-09-08 07:00:44,730 INFO  L418      AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:00:44,730 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:00:44,730 INFO  L82        PathProgramCache]: Analyzing trace with hash -95376622, now seen corresponding path program 1 times
[2019-09-08 07:00:44,730 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:00:44,730 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:00:44,731 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:00:44,732 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:00:44,732 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:00:44,752 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:00:44,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 07:00:44,821 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:00:44,821 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 07:00:44,822 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 07:00:44,822 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 07:00:44,822 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 07:00:44,822 INFO  L87              Difference]: Start difference. First operand 198178 states and 284178 transitions. Second operand 4 states.
[2019-09-08 07:01:32,305 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:01:32,306 INFO  L93              Difference]: Finished difference Result 591401 states and 924808 transitions.
[2019-09-08 07:01:32,306 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 07:01:32,306 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 225
[2019-09-08 07:01:32,307 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:01:33,791 INFO  L225             Difference]: With dead ends: 591401
[2019-09-08 07:01:33,792 INFO  L226             Difference]: Without dead ends: 393253
[2019-09-08 07:01:45,385 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 07:01:45,630 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 393253 states.
[2019-09-08 07:02:35,788 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 393253 to 392226.
[2019-09-08 07:02:35,788 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 392226 states.
[2019-09-08 07:02:49,661 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 392226 states to 392226 states and 580824 transitions.
[2019-09-08 07:02:49,713 INFO  L78                 Accepts]: Start accepts. Automaton has 392226 states and 580824 transitions. Word has length 225
[2019-09-08 07:02:49,713 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:02:49,713 INFO  L475      AbstractCegarLoop]: Abstraction has 392226 states and 580824 transitions.
[2019-09-08 07:02:49,713 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 07:02:49,713 INFO  L276                IsEmpty]: Start isEmpty. Operand 392226 states and 580824 transitions.
[2019-09-08 07:02:49,715 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 07:02:49,715 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:02:49,715 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]
[2019-09-08 07:02:49,715 INFO  L418      AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:02:49,715 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:02:49,715 INFO  L82        PathProgramCache]: Analyzing trace with hash 45722899, now seen corresponding path program 1 times
[2019-09-08 07:02:49,715 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:02:49,716 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:02:49,716 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:02:49,716 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:02:49,716 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:02:49,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:02:49,815 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 07:02:49,815 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:02:49,816 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 07:02:49,816 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 07:02:49,816 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 07:02:49,817 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 07:02:49,817 INFO  L87              Difference]: Start difference. First operand 392226 states and 580824 transitions. Second operand 6 states.
[2019-09-08 07:03:44,328 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:03:44,328 INFO  L93              Difference]: Finished difference Result 789542 states and 1243695 transitions.
[2019-09-08 07:03:44,329 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-09-08 07:03:44,329 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 225
[2019-09-08 07:03:44,329 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:03:45,997 INFO  L225             Difference]: With dead ends: 789542
[2019-09-08 07:03:45,997 INFO  L226             Difference]: Without dead ends: 397346
[2019-09-08 07:04:04,463 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-09-08 07:04:04,723 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 397346 states.
[2019-09-08 07:04:56,399 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 397346 to 394786.
[2019-09-08 07:04:56,400 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 394786 states.
[2019-09-08 07:04:59,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 394786 states to 394786 states and 582872 transitions.
[2019-09-08 07:05:00,007 INFO  L78                 Accepts]: Start accepts. Automaton has 394786 states and 582872 transitions. Word has length 225
[2019-09-08 07:05:00,007 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:05:00,007 INFO  L475      AbstractCegarLoop]: Abstraction has 394786 states and 582872 transitions.
[2019-09-08 07:05:00,007 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 07:05:00,007 INFO  L276                IsEmpty]: Start isEmpty. Operand 394786 states and 582872 transitions.
[2019-09-08 07:05:00,009 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2019-09-08 07:05:00,009 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:05:00,009 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]
[2019-09-08 07:05:00,010 INFO  L418      AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:05:00,010 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:05:00,010 INFO  L82        PathProgramCache]: Analyzing trace with hash -446903275, now seen corresponding path program 1 times
[2019-09-08 07:05:00,010 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:05:00,010 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:05:00,011 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:05:00,011 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:05:00,011 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:05:00,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:05:00,099 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 07:05:00,099 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:05:00,099 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 07:05:00,100 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 07:05:00,100 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 07:05:00,100 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 07:05:00,100 INFO  L87              Difference]: Start difference. First operand 394786 states and 582872 transitions. Second operand 4 states.
[2019-09-08 07:07:04,195 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:07:04,195 INFO  L93              Difference]: Finished difference Result 1179174 states and 1953322 transitions.
[2019-09-08 07:07:04,196 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 07:07:04,196 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 225
[2019-09-08 07:07:04,196 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:07:09,934 INFO  L225             Difference]: With dead ends: 1179174
[2019-09-08 07:07:09,934 INFO  L226             Difference]: Without dead ends: 784418
[2019-09-08 07:07:17,421 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12