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


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


This is Ultimate 0.1.24-112bae1
[2019-09-08 07:28:19,429 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-09-08 07:28:19,437 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-09-08 07:28:19,452 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-09-08 07:28:19,452 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-09-08 07:28:19,453 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-09-08 07:28:19,455 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-09-08 07:28:19,457 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-09-08 07:28:19,458 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-09-08 07:28:19,459 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-09-08 07:28:19,460 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-09-08 07:28:19,462 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-09-08 07:28:19,462 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-09-08 07:28:19,463 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-09-08 07:28:19,464 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-09-08 07:28:19,465 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-09-08 07:28:19,466 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-09-08 07:28:19,467 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-09-08 07:28:19,468 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-09-08 07:28:19,471 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-09-08 07:28:19,473 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-09-08 07:28:19,474 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-09-08 07:28:19,475 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-09-08 07:28:19,476 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-09-08 07:28:19,479 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-09-08 07:28:19,479 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-09-08 07:28:19,479 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-09-08 07:28:19,480 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-09-08 07:28:19,481 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-09-08 07:28:19,482 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-09-08 07:28:19,482 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-09-08 07:28:19,483 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-09-08 07:28:19,483 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-09-08 07:28:19,484 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-09-08 07:28:19,485 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-09-08 07:28:19,486 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-09-08 07:28:19,486 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-09-08 07:28:19,487 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-09-08 07:28:19,487 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-09-08 07:28:19,488 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-09-08 07:28:19,490 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-09-08 07:28:19,491 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 07:28:19,520 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-09-08 07:28:19,520 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-09-08 07:28:19,523 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-09-08 07:28:19,523 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-09-08 07:28:19,524 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-09-08 07:28:19,524 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-09-08 07:28:19,524 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-09-08 07:28:19,525 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-09-08 07:28:19,525 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-09-08 07:28:19,525 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-09-08 07:28:19,526 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-09-08 07:28:19,526 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-09-08 07:28:19,526 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-09-08 07:28:19,527 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-09-08 07:28:19,527 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-09-08 07:28:19,527 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-09-08 07:28:19,527 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-09-08 07:28:19,528 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-09-08 07:28:19,528 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-09-08 07:28:19,528 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-09-08 07:28:19,529 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-09-08 07:28:19,529 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-09-08 07:28:19,529 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-09-08 07:28:19,530 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-09-08 07:28:19,530 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-09-08 07:28:19,530 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-09-08 07:28:19,530 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-09-08 07:28:19,530 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-09-08 07:28:19,531 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-09-08 07:28:19,574 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-09-08 07:28:19,587 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-09-08 07:28:19,591 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-09-08 07:28:19,592 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-09-08 07:28:19,593 INFO  L275        PluginConnector]: CDTParser initialized
[2019-09-08 07:28:19,593 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.4.ufo.UNBOUNDED.pals.c
[2019-09-08 07:28:19,657 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3384948e3/f5621c31c259492c8323581fd2dd82ad/FLAG2397eb857
[2019-09-08 07:28:20,296 INFO  L306              CDTParser]: Found 1 translation units.
[2019-09-08 07:28:20,296 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.4.ufo.UNBOUNDED.pals.c
[2019-09-08 07:28:20,335 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3384948e3/f5621c31c259492c8323581fd2dd82ad/FLAG2397eb857
[2019-09-08 07:28:20,605 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3384948e3/f5621c31c259492c8323581fd2dd82ad
[2019-09-08 07:28:20,615 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-09-08 07:28:20,616 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-09-08 07:28:20,617 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-09-08 07:28:20,618 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-09-08 07:28:20,621 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-09-08 07:28:20,622 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:28:20" (1/1) ...
[2019-09-08 07:28:20,625 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c19ae1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:20, skipping insertion in model container
[2019-09-08 07:28:20,625 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:28:20" (1/1) ...
[2019-09-08 07:28:20,631 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-09-08 07:28:20,714 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-09-08 07:28:21,330 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-08 07:28:21,353 INFO  L188         MainTranslator]: Completed pre-run
[2019-09-08 07:28:21,563 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-08 07:28:21,588 INFO  L192         MainTranslator]: Completed translation
[2019-09-08 07:28:21,588 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:21 WrapperNode
[2019-09-08 07:28:21,588 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-09-08 07:28:21,590 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-09-08 07:28:21,590 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-09-08 07:28:21,590 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-09-08 07:28:21,605 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:21" (1/1) ...
[2019-09-08 07:28:21,605 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:21" (1/1) ...
[2019-09-08 07:28:21,631 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:21" (1/1) ...
[2019-09-08 07:28:21,632 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:21" (1/1) ...
[2019-09-08 07:28:21,677 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:21" (1/1) ...
[2019-09-08 07:28:21,718 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:21" (1/1) ...
[2019-09-08 07:28:21,729 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:21" (1/1) ...
[2019-09-08 07:28:21,760 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-09-08 07:28:21,761 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-09-08 07:28:21,761 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-09-08 07:28:21,762 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-09-08 07:28:21,763 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:21" (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 07:28:21,839 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-09-08 07:28:21,840 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-09-08 07:28:21,840 INFO  L138     BoogieDeclarations]: Found implementation of procedure node1
[2019-09-08 07:28:21,840 INFO  L138     BoogieDeclarations]: Found implementation of procedure node2
[2019-09-08 07:28:21,841 INFO  L138     BoogieDeclarations]: Found implementation of procedure node3
[2019-09-08 07:28:21,841 INFO  L138     BoogieDeclarations]: Found implementation of procedure node4
[2019-09-08 07:28:21,842 INFO  L138     BoogieDeclarations]: Found implementation of procedure node5
[2019-09-08 07:28:21,842 INFO  L138     BoogieDeclarations]: Found implementation of procedure init
[2019-09-08 07:28:21,842 INFO  L138     BoogieDeclarations]: Found implementation of procedure check
[2019-09-08 07:28:21,842 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-09-08 07:28:21,842 INFO  L138     BoogieDeclarations]: Found implementation of procedure assert
[2019-09-08 07:28:21,843 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-09-08 07:28:21,844 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char
[2019-09-08 07:28:21,844 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar
[2019-09-08 07:28:21,845 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool
[2019-09-08 07:28:21,845 INFO  L130     BoogieDeclarations]: Found specification of procedure assert
[2019-09-08 07:28:21,848 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assume
[2019-09-08 07:28:21,848 INFO  L130     BoogieDeclarations]: Found specification of procedure read
[2019-09-08 07:28:21,849 INFO  L130     BoogieDeclarations]: Found specification of procedure write
[2019-09-08 07:28:21,849 INFO  L130     BoogieDeclarations]: Found specification of procedure node1
[2019-09-08 07:28:21,849 INFO  L130     BoogieDeclarations]: Found specification of procedure node2
[2019-09-08 07:28:21,849 INFO  L130     BoogieDeclarations]: Found specification of procedure node3
[2019-09-08 07:28:21,849 INFO  L130     BoogieDeclarations]: Found specification of procedure node4
[2019-09-08 07:28:21,850 INFO  L130     BoogieDeclarations]: Found specification of procedure node5
[2019-09-08 07:28:21,850 INFO  L130     BoogieDeclarations]: Found specification of procedure init
[2019-09-08 07:28:21,850 INFO  L130     BoogieDeclarations]: Found specification of procedure check
[2019-09-08 07:28:21,850 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-09-08 07:28:21,850 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-09-08 07:28:21,850 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-09-08 07:28:24,361 INFO  L278             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-09-08 07:28:24,362 INFO  L283             CfgBuilder]: Removed 1 assume(true) statements.
[2019-09-08 07:28:24,364 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:28:24 BoogieIcfgContainer
[2019-09-08 07:28:24,364 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-09-08 07:28:24,365 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-09-08 07:28:24,365 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-09-08 07:28:24,369 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-09-08 07:28:24,369 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:28:20" (1/3) ...
[2019-09-08 07:28:24,370 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5bc85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:28:24, skipping insertion in model container
[2019-09-08 07:28:24,370 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:21" (2/3) ...
[2019-09-08 07:28:24,371 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5bc85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:28:24, skipping insertion in model container
[2019-09-08 07:28:24,371 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:28:24" (3/3) ...
[2019-09-08 07:28:24,375 INFO  L109   eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.4.ufo.UNBOUNDED.pals.c
[2019-09-08 07:28:24,385 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-09-08 07:28:24,396 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-09-08 07:28:24,412 INFO  L252      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-09-08 07:28:24,459 INFO  L128   ementStrategyFactory]: Using default assertion order modulation
[2019-09-08 07:28:24,460 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2019-09-08 07:28:24,460 INFO  L378      AbstractCegarLoop]: Hoare is true
[2019-09-08 07:28:24,460 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-09-08 07:28:24,460 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-09-08 07:28:24,461 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-09-08 07:28:24,461 INFO  L382      AbstractCegarLoop]: Difference is false
[2019-09-08 07:28:24,461 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-09-08 07:28:24,461 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-09-08 07:28:24,507 INFO  L276                IsEmpty]: Start isEmpty. Operand 741 states.
[2019-09-08 07:28:24,555 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2019-09-08 07:28:24,555 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:28:24,557 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]
[2019-09-08 07:28:24,559 INFO  L418      AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:28:24,565 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:28:24,566 INFO  L82        PathProgramCache]: Analyzing trace with hash 1909906807, now seen corresponding path program 1 times
[2019-09-08 07:28:24,567 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:28:24,568 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:28:24,623 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:24,624 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:28:24,624 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:24,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:28:25,225 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:28:25,228 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:28:25,228 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 07:28:25,233 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 07:28:25,247 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 07:28:25,248 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 07:28:25,249 INFO  L87              Difference]: Start difference. First operand 741 states. Second operand 5 states.
[2019-09-08 07:28:25,578 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:28:25,578 INFO  L93              Difference]: Finished difference Result 929 states and 1653 transitions.
[2019-09-08 07:28:25,579 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 07:28:25,580 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 176
[2019-09-08 07:28:25,582 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:28:25,619 INFO  L225             Difference]: With dead ends: 929
[2019-09-08 07:28:25,620 INFO  L226             Difference]: Without dead ends: 736
[2019-09-08 07:28:25,629 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2019-09-08 07:28:25,658 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 736 states.
[2019-09-08 07:28:25,778 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736.
[2019-09-08 07:28:25,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 736 states.
[2019-09-08 07:28:25,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1275 transitions.
[2019-09-08 07:28:25,792 INFO  L78                 Accepts]: Start accepts. Automaton has 736 states and 1275 transitions. Word has length 176
[2019-09-08 07:28:25,796 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:28:25,797 INFO  L475      AbstractCegarLoop]: Abstraction has 736 states and 1275 transitions.
[2019-09-08 07:28:25,797 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 07:28:25,797 INFO  L276                IsEmpty]: Start isEmpty. Operand 736 states and 1275 transitions.
[2019-09-08 07:28:25,804 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 236
[2019-09-08 07:28:25,805 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:28:25,805 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:28:25,806 INFO  L418      AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:28:25,807 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:28:25,807 INFO  L82        PathProgramCache]: Analyzing trace with hash -268525100, now seen corresponding path program 1 times
[2019-09-08 07:28:25,807 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:28:25,808 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:28:25,811 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:25,811 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:28:25,812 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:26,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:28:26,508 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:28:26,508 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:28:26,509 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-09-08 07:28:26,512 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-09-08 07:28:26,512 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-09-08 07:28:26,513 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2019-09-08 07:28:26,513 INFO  L87              Difference]: Start difference. First operand 736 states and 1275 transitions. Second operand 13 states.
[2019-09-08 07:28:39,572 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:28:39,573 INFO  L93              Difference]: Finished difference Result 3006 states and 5054 transitions.
[2019-09-08 07:28:39,573 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. 
[2019-09-08 07:28:39,574 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 235
[2019-09-08 07:28:39,575 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:28:39,611 INFO  L225             Difference]: With dead ends: 3006
[2019-09-08 07:28:39,612 INFO  L226             Difference]: Without dead ends: 2822
[2019-09-08 07:28:39,621 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=631, Invalid=2125, Unknown=0, NotChecked=0, Total=2756
[2019-09-08 07:28:39,626 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2822 states.
[2019-09-08 07:28:39,771 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2030.
[2019-09-08 07:28:39,771 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2030 states.
[2019-09-08 07:28:39,783 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 3422 transitions.
[2019-09-08 07:28:39,784 INFO  L78                 Accepts]: Start accepts. Automaton has 2030 states and 3422 transitions. Word has length 235
[2019-09-08 07:28:39,785 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:28:39,785 INFO  L475      AbstractCegarLoop]: Abstraction has 2030 states and 3422 transitions.
[2019-09-08 07:28:39,786 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-09-08 07:28:39,786 INFO  L276                IsEmpty]: Start isEmpty. Operand 2030 states and 3422 transitions.
[2019-09-08 07:28:39,793 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 237
[2019-09-08 07:28:39,793 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:28:39,793 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:28:39,794 INFO  L418      AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:28:39,794 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:28:39,794 INFO  L82        PathProgramCache]: Analyzing trace with hash -699503355, now seen corresponding path program 1 times
[2019-09-08 07:28:39,794 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:28:39,795 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:28:39,796 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:39,797 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:28:39,797 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:39,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:28:40,195 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:28:40,199 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:28:40,201 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 07:28:40,201 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 07:28:40,202 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 07:28:40,210 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-09-08 07:28:40,211 INFO  L87              Difference]: Start difference. First operand 2030 states and 3422 transitions. Second operand 6 states.
[2019-09-08 07:28:44,063 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:28:44,064 INFO  L93              Difference]: Finished difference Result 5014 states and 8363 transitions.
[2019-09-08 07:28:44,064 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2019-09-08 07:28:44,065 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 236
[2019-09-08 07:28:44,066 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:28:44,100 INFO  L225             Difference]: With dead ends: 5014
[2019-09-08 07:28:44,101 INFO  L226             Difference]: Without dead ends: 3536
[2019-09-08 07:28:44,117 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110
[2019-09-08 07:28:44,125 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3536 states.
[2019-09-08 07:28:44,334 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 3345.
[2019-09-08 07:28:44,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3345 states.
[2019-09-08 07:28:44,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 5590 transitions.
[2019-09-08 07:28:44,360 INFO  L78                 Accepts]: Start accepts. Automaton has 3345 states and 5590 transitions. Word has length 236
[2019-09-08 07:28:44,362 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:28:44,362 INFO  L475      AbstractCegarLoop]: Abstraction has 3345 states and 5590 transitions.
[2019-09-08 07:28:44,363 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 07:28:44,363 INFO  L276                IsEmpty]: Start isEmpty. Operand 3345 states and 5590 transitions.
[2019-09-08 07:28:44,375 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 238
[2019-09-08 07:28:44,375 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:28:44,376 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:28:44,376 INFO  L418      AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:28:44,377 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:28:44,377 INFO  L82        PathProgramCache]: Analyzing trace with hash -1226612309, now seen corresponding path program 1 times
[2019-09-08 07:28:44,377 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:28:44,378 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:28:44,379 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:44,380 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:28:44,380 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:44,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:28:45,021 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:28:45,022 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:28:45,022 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 07:28:45,023 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 07:28:45,024 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 07:28:45,024 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-09-08 07:28:45,025 INFO  L87              Difference]: Start difference. First operand 3345 states and 5590 transitions. Second operand 6 states.
[2019-09-08 07:28:49,038 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:28:49,040 INFO  L93              Difference]: Finished difference Result 9374 states and 15534 transitions.
[2019-09-08 07:28:49,041 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2019-09-08 07:28:49,041 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 237
[2019-09-08 07:28:49,042 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:28:49,080 INFO  L225             Difference]: With dead ends: 9374
[2019-09-08 07:28:49,081 INFO  L226             Difference]: Without dead ends: 6581
[2019-09-08 07:28:49,091 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110
[2019-09-08 07:28:49,100 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6581 states.
[2019-09-08 07:28:49,313 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 5617.
[2019-09-08 07:28:49,313 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5617 states.
[2019-09-08 07:28:49,338 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5617 states to 5617 states and 9313 transitions.
[2019-09-08 07:28:49,339 INFO  L78                 Accepts]: Start accepts. Automaton has 5617 states and 9313 transitions. Word has length 237
[2019-09-08 07:28:49,340 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:28:49,340 INFO  L475      AbstractCegarLoop]: Abstraction has 5617 states and 9313 transitions.
[2019-09-08 07:28:49,340 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 07:28:49,340 INFO  L276                IsEmpty]: Start isEmpty. Operand 5617 states and 9313 transitions.
[2019-09-08 07:28:49,352 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 239
[2019-09-08 07:28:49,353 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:28:49,353 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:28:49,354 INFO  L418      AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:28:49,354 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:28:49,354 INFO  L82        PathProgramCache]: Analyzing trace with hash -438805636, now seen corresponding path program 1 times
[2019-09-08 07:28:49,355 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:28:49,355 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:28:49,356 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:49,357 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:28:49,357 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:49,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:28:49,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 07:28:49,654 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:28:49,654 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 07:28:49,655 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 07:28:49,655 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 07:28:49,656 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-09-08 07:28:49,656 INFO  L87              Difference]: Start difference. First operand 5617 states and 9313 transitions. Second operand 6 states.
[2019-09-08 07:28:53,487 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:28:53,487 INFO  L93              Difference]: Finished difference Result 21935 states and 36146 transitions.
[2019-09-08 07:28:53,488 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-08 07:28:53,488 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 238
[2019-09-08 07:28:53,489 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:28:53,576 INFO  L225             Difference]: With dead ends: 21935
[2019-09-08 07:28:53,576 INFO  L226             Difference]: Without dead ends: 16870
[2019-09-08 07:28:53,595 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110
[2019-09-08 07:28:53,617 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16870 states.
[2019-09-08 07:28:54,193 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16870 to 13926.
[2019-09-08 07:28:54,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13926 states.
[2019-09-08 07:28:54,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13926 states to 13926 states and 22887 transitions.
[2019-09-08 07:28:54,230 INFO  L78                 Accepts]: Start accepts. Automaton has 13926 states and 22887 transitions. Word has length 238
[2019-09-08 07:28:54,231 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:28:54,231 INFO  L475      AbstractCegarLoop]: Abstraction has 13926 states and 22887 transitions.
[2019-09-08 07:28:54,231 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 07:28:54,231 INFO  L276                IsEmpty]: Start isEmpty. Operand 13926 states and 22887 transitions.
[2019-09-08 07:28:54,240 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 240
[2019-09-08 07:28:54,240 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:28:54,241 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:28:54,241 INFO  L418      AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:28:54,241 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:28:54,242 INFO  L82        PathProgramCache]: Analyzing trace with hash -1838287486, now seen corresponding path program 1 times
[2019-09-08 07:28:54,242 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:28:54,242 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:28:54,243 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:54,243 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:28:54,243 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:54,341 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:28:54,508 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:28:54,509 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:28:54,509 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 07:28:54,509 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 07:28:54,510 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 07:28:54,510 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 07:28:54,510 INFO  L87              Difference]: Start difference. First operand 13926 states and 22887 transitions. Second operand 6 states.
[2019-09-08 07:28:59,535 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:28:59,536 INFO  L93              Difference]: Finished difference Result 80238 states and 131647 transitions.
[2019-09-08 07:28:59,536 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-08 07:28:59,536 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 239
[2019-09-08 07:28:59,537 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:28:59,824 INFO  L225             Difference]: With dead ends: 80238
[2019-09-08 07:28:59,825 INFO  L226             Difference]: Without dead ends: 66864
[2019-09-08 07:28:59,886 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2019-09-08 07:28:59,971 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66864 states.
[2019-09-08 07:29:02,792 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 66864 to 66712.
[2019-09-08 07:29:02,793 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 66712 states.
[2019-09-08 07:29:03,252 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 66712 states to 66712 states and 109154 transitions.
[2019-09-08 07:29:03,256 INFO  L78                 Accepts]: Start accepts. Automaton has 66712 states and 109154 transitions. Word has length 239
[2019-09-08 07:29:03,261 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:29:03,261 INFO  L475      AbstractCegarLoop]: Abstraction has 66712 states and 109154 transitions.
[2019-09-08 07:29:03,262 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 07:29:03,262 INFO  L276                IsEmpty]: Start isEmpty. Operand 66712 states and 109154 transitions.
[2019-09-08 07:29:03,276 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 241
[2019-09-08 07:29:03,280 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:29:03,280 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:29:03,281 INFO  L418      AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:29:03,281 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:29:03,281 INFO  L82        PathProgramCache]: Analyzing trace with hash 1970730483, now seen corresponding path program 1 times
[2019-09-08 07:29:03,281 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:29:03,282 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:29:03,283 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:29:03,284 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:29:03,284 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:29:03,423 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:29:03,605 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:29:03,606 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:29:03,606 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 07:29:03,606 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 07:29:03,607 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 07:29:03,607 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-09-08 07:29:03,608 INFO  L87              Difference]: Start difference. First operand 66712 states and 109154 transitions. Second operand 6 states.
[2019-09-08 07:29:12,115 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:29:12,115 INFO  L93              Difference]: Finished difference Result 302620 states and 494792 transitions.
[2019-09-08 07:29:12,116 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2019-09-08 07:29:12,116 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 240
[2019-09-08 07:29:12,117 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:29:13,188 INFO  L225             Difference]: With dead ends: 302620
[2019-09-08 07:29:13,188 INFO  L226             Difference]: Without dead ends: 236460
[2019-09-08 07:29:13,429 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110
[2019-09-08 07:29:13,691 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 236460 states.
[2019-09-08 07:29:22,813 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 236460 to 169720.
[2019-09-08 07:29:22,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 169720 states.
[2019-09-08 07:29:23,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 169720 states to 169720 states and 276953 transitions.
[2019-09-08 07:29:23,140 INFO  L78                 Accepts]: Start accepts. Automaton has 169720 states and 276953 transitions. Word has length 240
[2019-09-08 07:29:23,140 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:29:23,140 INFO  L475      AbstractCegarLoop]: Abstraction has 169720 states and 276953 transitions.
[2019-09-08 07:29:23,140 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 07:29:23,140 INFO  L276                IsEmpty]: Start isEmpty. Operand 169720 states and 276953 transitions.
[2019-09-08 07:29:23,152 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2019-09-08 07:29:23,152 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:29:23,153 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:29:23,153 INFO  L418      AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:29:23,153 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:29:23,153 INFO  L82        PathProgramCache]: Analyzing trace with hash 1025117066, now seen corresponding path program 1 times
[2019-09-08 07:29:23,154 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:29:23,154 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:29:23,155 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:29:23,155 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:29:23,155 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:29:23,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:29:23,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 07:29:23,527 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:29:23,527 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-09-08 07:29:23,527 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-09-08 07:29:23,528 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-09-08 07:29:23,528 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156
[2019-09-08 07:29:23,528 INFO  L87              Difference]: Start difference. First operand 169720 states and 276953 transitions. Second operand 13 states.
[2019-09-08 07:29:45,056 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:29:45,056 INFO  L93              Difference]: Finished difference Result 290738 states and 475117 transitions.
[2019-09-08 07:29:45,057 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. 
[2019-09-08 07:29:45,057 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 242
[2019-09-08 07:29:45,057 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:29:45,789 INFO  L225             Difference]: With dead ends: 290738
[2019-09-08 07:29:45,790 INFO  L226             Difference]: Without dead ends: 256896
[2019-09-08 07:29:45,904 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256
[2019-09-08 07:29:46,120 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 256896 states.
[2019-09-08 07:29:54,338 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 256896 to 233854.
[2019-09-08 07:29:54,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 233854 states.
[2019-09-08 07:29:54,786 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 233854 states to 233854 states and 382326 transitions.
[2019-09-08 07:29:54,790 INFO  L78                 Accepts]: Start accepts. Automaton has 233854 states and 382326 transitions. Word has length 242
[2019-09-08 07:29:54,790 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:29:54,791 INFO  L475      AbstractCegarLoop]: Abstraction has 233854 states and 382326 transitions.
[2019-09-08 07:29:54,791 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-09-08 07:29:54,791 INFO  L276                IsEmpty]: Start isEmpty. Operand 233854 states and 382326 transitions.
[2019-09-08 07:29:54,802 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2019-09-08 07:29:54,802 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:29:54,802 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:29:54,803 INFO  L418      AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:29:54,803 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:29:54,803 INFO  L82        PathProgramCache]: Analyzing trace with hash -1376652368, now seen corresponding path program 1 times
[2019-09-08 07:29:54,803 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:29:54,803 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:29:54,805 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:29:54,805 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:29:54,805 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:29:54,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:29:55,177 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:29:55,177 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:29:55,178 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-09-08 07:29:55,178 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-09-08 07:29:55,178 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-09-08 07:29:55,179 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156
[2019-09-08 07:29:55,179 INFO  L87              Difference]: Start difference. First operand 233854 states and 382326 transitions. Second operand 13 states.
[2019-09-08 07:30:17,871 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:30:17,871 INFO  L93              Difference]: Finished difference Result 374165 states and 613906 transitions.
[2019-09-08 07:30:17,872 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. 
[2019-09-08 07:30:17,872 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 242
[2019-09-08 07:30:17,872 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:30:18,632 INFO  L225             Difference]: With dead ends: 374165
[2019-09-08 07:30:18,632 INFO  L226             Difference]: Without dead ends: 307446
[2019-09-08 07:30:18,732 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256
[2019-09-08 07:30:18,967 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 307446 states.
[2019-09-08 07:30:29,520 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 307446 to 265306.
[2019-09-08 07:30:29,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 265306 states.
[2019-09-08 07:30:30,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 265306 states to 265306 states and 434221 transitions.
[2019-09-08 07:30:30,026 INFO  L78                 Accepts]: Start accepts. Automaton has 265306 states and 434221 transitions. Word has length 242
[2019-09-08 07:30:30,027 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:30:30,027 INFO  L475      AbstractCegarLoop]: Abstraction has 265306 states and 434221 transitions.
[2019-09-08 07:30:30,027 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-09-08 07:30:30,027 INFO  L276                IsEmpty]: Start isEmpty. Operand 265306 states and 434221 transitions.
[2019-09-08 07:30:30,037 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2019-09-08 07:30:30,037 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:30:30,037 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:30:30,038 INFO  L418      AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:30:30,038 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:30:30,038 INFO  L82        PathProgramCache]: Analyzing trace with hash -694496930, now seen corresponding path program 1 times
[2019-09-08 07:30:30,038 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:30:30,038 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:30:30,039 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:30:30,040 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:30:30,040 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:30:30,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:30:30,397 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:30:30,397 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:30:30,397 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-09-08 07:30:30,398 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-09-08 07:30:30,398 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-09-08 07:30:30,398 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156
[2019-09-08 07:30:30,398 INFO  L87              Difference]: Start difference. First operand 265306 states and 434221 transitions. Second operand 13 states.
[2019-09-08 07:30:55,721 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:30:55,721 INFO  L93              Difference]: Finished difference Result 427123 states and 700435 transitions.
[2019-09-08 07:30:55,722 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. 
[2019-09-08 07:30:55,722 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 242
[2019-09-08 07:30:55,723 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:30:56,705 INFO  L225             Difference]: With dead ends: 427123
[2019-09-08 07:30:56,705 INFO  L226             Difference]: Without dead ends: 332291
[2019-09-08 07:30:56,880 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2105 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1095, Invalid=4757, Unknown=0, NotChecked=0, Total=5852
[2019-09-08 07:30:57,149 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 332291 states.
[2019-09-08 07:31:09,239 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 332291 to 287769.
[2019-09-08 07:31:09,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 287769 states.
[2019-09-08 07:31:09,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 287769 states to 287769 states and 471387 transitions.
[2019-09-08 07:31:09,903 INFO  L78                 Accepts]: Start accepts. Automaton has 287769 states and 471387 transitions. Word has length 242
[2019-09-08 07:31:09,904 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:31:09,904 INFO  L475      AbstractCegarLoop]: Abstraction has 287769 states and 471387 transitions.
[2019-09-08 07:31:09,904 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-09-08 07:31:09,904 INFO  L276                IsEmpty]: Start isEmpty. Operand 287769 states and 471387 transitions.
[2019-09-08 07:31:09,914 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2019-09-08 07:31:09,914 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:31:09,914 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:31:09,915 INFO  L418      AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:31:09,915 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:31:09,915 INFO  L82        PathProgramCache]: Analyzing trace with hash 2014276523, now seen corresponding path program 1 times
[2019-09-08 07:31:09,915 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:31:09,915 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:31:09,916 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:31:09,917 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:31:09,917 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:31:10,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:31:10,224 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:31:10,224 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:31:10,224 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 07:31:10,225 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 07:31:10,225 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 07:31:10,226 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2019-09-08 07:31:10,226 INFO  L87              Difference]: Start difference. First operand 287769 states and 471387 transitions. Second operand 6 states.
[2019-09-08 07:31:29,483 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:31:29,483 INFO  L93              Difference]: Finished difference Result 910103 states and 1490333 transitions.
[2019-09-08 07:31:29,483 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2019-09-08 07:31:29,483 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 242
[2019-09-08 07:31:29,484 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:31:30,917 INFO  L225             Difference]: With dead ends: 910103
[2019-09-08 07:31:30,917 INFO  L226             Difference]: Without dead ends: 622886
[2019-09-08 07:31:32,028 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2019-09-08 07:31:32,392 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 622886 states.
[2019-09-08 07:31:59,769 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 622886 to 618585.
[2019-09-08 07:31:59,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 618585 states.
[2019-09-08 07:32:02,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 618585 states to 618585 states and 1002335 transitions.
[2019-09-08 07:32:02,020 INFO  L78                 Accepts]: Start accepts. Automaton has 618585 states and 1002335 transitions. Word has length 242
[2019-09-08 07:32:02,021 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:32:02,021 INFO  L475      AbstractCegarLoop]: Abstraction has 618585 states and 1002335 transitions.
[2019-09-08 07:32:02,021 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 07:32:02,021 INFO  L276                IsEmpty]: Start isEmpty. Operand 618585 states and 1002335 transitions.
[2019-09-08 07:32:02,026 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2019-09-08 07:32:02,026 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:32:02,026 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:32:02,027 INFO  L418      AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:32:02,027 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:32:02,027 INFO  L82        PathProgramCache]: Analyzing trace with hash -1854026225, now seen corresponding path program 1 times
[2019-09-08 07:32:02,027 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:32:02,027 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:32:02,028 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:32:02,029 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:32:02,029 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:32:02,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:32:02,488 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:32:02,489 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:32:02,489 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 07:32:02,489 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 07:32:02,490 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 07:32:02,490 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 07:32:02,490 INFO  L87              Difference]: Start difference. First operand 618585 states and 1002335 transitions. Second operand 5 states.
[2019-09-08 07:32:47,746 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:32:47,746 INFO  L93              Difference]: Finished difference Result 1848556 states and 3018611 transitions.
[2019-09-08 07:32:47,746 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-09-08 07:32:47,747 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 246
[2019-09-08 07:32:47,747 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:32:51,118 INFO  L225             Difference]: With dead ends: 1848556
[2019-09-08 07:32:51,119 INFO  L226             Difference]: Without dead ends: 1229989
[2019-09-08 07:32:52,928 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2019-09-08 07:32:53,842 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1229989 states.
[2019-09-08 07:34:09,066 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229989 to 1229987.
[2019-09-08 07:34:09,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1229987 states.
[2019-09-08 07:34:14,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1229987 states to 1229987 states and 1981596 transitions.
[2019-09-08 07:34:14,199 INFO  L78                 Accepts]: Start accepts. Automaton has 1229987 states and 1981596 transitions. Word has length 246
[2019-09-08 07:34:14,200 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:34:14,200 INFO  L475      AbstractCegarLoop]: Abstraction has 1229987 states and 1981596 transitions.
[2019-09-08 07:34:14,200 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 07:34:14,200 INFO  L276                IsEmpty]: Start isEmpty. Operand 1229987 states and 1981596 transitions.
[2019-09-08 07:34:14,214 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2019-09-08 07:34:14,215 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:34:14,215 INFO  L399         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:34:14,216 INFO  L418      AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:34:14,216 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:34:14,216 INFO  L82        PathProgramCache]: Analyzing trace with hash -965015689, now seen corresponding path program 1 times
[2019-09-08 07:34:14,216 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:34:14,216 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:34:14,221 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:34:14,221 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:34:14,221 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:34:14,386 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:34:14,723 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:34:14,724 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:34:14,724 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 07:34:14,724 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 07:34:14,725 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 07:34:14,725 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 07:34:14,725 INFO  L87              Difference]: Start difference. First operand 1229987 states and 1981596 transitions. Second operand 5 states.