java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:56:59,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:56:59,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:56:59,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:56:59,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:56:59,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:56:59,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:56:59,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:56:59,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:56:59,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:56:59,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:56:59,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:56:59,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:56:59,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:56:59,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:56:59,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:56:59,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:56:59,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:56:59,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:56:59,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:56:59,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:56:59,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:56:59,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:56:59,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:56:59,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:56:59,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:56:59,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:56:59,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:56:59,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:56:59,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:56:59,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:56:59,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:56:59,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:56:59,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:56:59,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:56:59,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:56:59,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:56:59,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:56:59,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:56:59,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:56:59,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:56:59,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:56:59,583 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:56:59,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:56:59,584 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:56:59,584 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:56:59,585 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:56:59,585 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:56:59,585 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:56:59,585 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:56:59,585 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:56:59,586 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:56:59,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:56:59,586 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:56:59,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:56:59,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:56:59,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:56:59,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:56:59,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:56:59,588 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:56:59,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:56:59,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:56:59,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:56:59,588 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:56:59,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:56:59,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:56:59,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:56:59,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:56:59,589 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:56:59,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:56:59,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:56:59,590 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:56:59,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:56:59,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:56:59,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:56:59,638 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:56:59,639 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:56:59,640 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:56:59,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/901f949ab/b771146bddc6406f89f0f1c6be04e7e1/FLAGf8175ab7f [2019-09-10 08:57:00,302 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:57:00,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:57:00,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/901f949ab/b771146bddc6406f89f0f1c6be04e7e1/FLAGf8175ab7f [2019-09-10 08:57:00,521 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/901f949ab/b771146bddc6406f89f0f1c6be04e7e1 [2019-09-10 08:57:00,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:57:00,531 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:57:00,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:57:00,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:57:00,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:57:00,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:57:00" (1/1) ... [2019-09-10 08:57:00,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc150de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:00, skipping insertion in model container [2019-09-10 08:57:00,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:57:00" (1/1) ... [2019-09-10 08:57:00,547 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:57:00,703 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:57:02,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:57:02,252 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:57:03,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:57:03,236 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:57:03,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:03 WrapperNode [2019-09-10 08:57:03,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:57:03,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:57:03,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:57:03,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:57:03,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:03" (1/1) ... [2019-09-10 08:57:03,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:03" (1/1) ... [2019-09-10 08:57:03,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:03" (1/1) ... [2019-09-10 08:57:03,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:03" (1/1) ... [2019-09-10 08:57:03,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:03" (1/1) ... [2019-09-10 08:57:03,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:03" (1/1) ... [2019-09-10 08:57:03,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:03" (1/1) ... [2019-09-10 08:57:03,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:57:03,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:57:03,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:57:03,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:57:03,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:57:03,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:57:03,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:57:03,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:57:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:57:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:57:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:57:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:57:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:57:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:57:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:57:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:57:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:57:03,510 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:57:03,510 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:57:03,510 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:57:03,510 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:57:03,510 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:57:03,511 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:57:03,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:57:03,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:57:06,750 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:57:06,750 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:57:06,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:57:06 BoogieIcfgContainer [2019-09-10 08:57:06,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:57:06,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:57:06,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:57:06,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:57:06,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:57:00" (1/3) ... [2019-09-10 08:57:06,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e84d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:57:06, skipping insertion in model container [2019-09-10 08:57:06,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:03" (2/3) ... [2019-09-10 08:57:06,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e84d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:57:06, skipping insertion in model container [2019-09-10 08:57:06,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:57:06" (3/3) ... [2019-09-10 08:57:06,765 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:57:06,774 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:57:06,783 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 08:57:06,799 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 08:57:06,826 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:57:06,826 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:57:06,826 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:57:06,826 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:57:06,827 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:57:06,827 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:57:06,827 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:57:06,827 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:57:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states. [2019-09-10 08:57:06,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 08:57:06,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:06,894 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:06,896 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:06,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:06,902 INFO L82 PathProgramCache]: Analyzing trace with hash -746248007, now seen corresponding path program 1 times [2019-09-10 08:57:06,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:06,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:06,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:06,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:06,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:07,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:07,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:07,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:07,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:07,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:07,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:07,890 INFO L87 Difference]: Start difference. First operand 997 states. Second operand 3 states. [2019-09-10 08:57:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:08,249 INFO L93 Difference]: Finished difference Result 1439 states and 2543 transitions. [2019-09-10 08:57:08,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:08,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 08:57:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:08,288 INFO L225 Difference]: With dead ends: 1439 [2019-09-10 08:57:08,288 INFO L226 Difference]: Without dead ends: 1431 [2019-09-10 08:57:08,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-09-10 08:57:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1429. [2019-09-10 08:57:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-09-10 08:57:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2185 transitions. [2019-09-10 08:57:08,426 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2185 transitions. Word has length 320 [2019-09-10 08:57:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:08,430 INFO L475 AbstractCegarLoop]: Abstraction has 1429 states and 2185 transitions. [2019-09-10 08:57:08,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:08,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2185 transitions. [2019-09-10 08:57:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 08:57:08,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:08,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:08,445 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:08,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1357486743, now seen corresponding path program 1 times [2019-09-10 08:57:08,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:08,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:08,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:08,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:08,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:08,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:08,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:08,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:08,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:08,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:08,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:08,928 INFO L87 Difference]: Start difference. First operand 1429 states and 2185 transitions. Second operand 3 states. [2019-09-10 08:57:09,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:09,182 INFO L93 Difference]: Finished difference Result 2305 states and 3542 transitions. [2019-09-10 08:57:09,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:09,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 08:57:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:09,199 INFO L225 Difference]: With dead ends: 2305 [2019-09-10 08:57:09,199 INFO L226 Difference]: Without dead ends: 2305 [2019-09-10 08:57:09,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2019-09-10 08:57:09,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2303. [2019-09-10 08:57:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2303 states. [2019-09-10 08:57:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 3541 transitions. [2019-09-10 08:57:09,267 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 3541 transitions. Word has length 320 [2019-09-10 08:57:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:09,268 INFO L475 AbstractCegarLoop]: Abstraction has 2303 states and 3541 transitions. [2019-09-10 08:57:09,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 3541 transitions. [2019-09-10 08:57:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 08:57:09,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:09,276 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:09,277 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:09,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash -387626201, now seen corresponding path program 1 times [2019-09-10 08:57:09,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:09,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:09,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:09,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:09,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:09,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:09,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:09,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:09,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:09,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:09,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:09,751 INFO L87 Difference]: Start difference. First operand 2303 states and 3541 transitions. Second operand 3 states. [2019-09-10 08:57:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:10,053 INFO L93 Difference]: Finished difference Result 4105 states and 6334 transitions. [2019-09-10 08:57:10,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:10,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 08:57:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:10,074 INFO L225 Difference]: With dead ends: 4105 [2019-09-10 08:57:10,075 INFO L226 Difference]: Without dead ends: 4105 [2019-09-10 08:57:10,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:10,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2019-09-10 08:57:10,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 4103. [2019-09-10 08:57:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4103 states. [2019-09-10 08:57:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4103 states to 4103 states and 6333 transitions. [2019-09-10 08:57:10,180 INFO L78 Accepts]: Start accepts. Automaton has 4103 states and 6333 transitions. Word has length 320 [2019-09-10 08:57:10,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:10,180 INFO L475 AbstractCegarLoop]: Abstraction has 4103 states and 6333 transitions. [2019-09-10 08:57:10,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 6333 transitions. [2019-09-10 08:57:10,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 08:57:10,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:10,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:10,191 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:10,192 INFO L82 PathProgramCache]: Analyzing trace with hash -387964825, now seen corresponding path program 1 times [2019-09-10 08:57:10,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:10,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:10,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:10,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:10,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:11,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:11,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:57:11,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:11,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:57:11,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:57:11,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:57:11,004 INFO L87 Difference]: Start difference. First operand 4103 states and 6333 transitions. Second operand 4 states. [2019-09-10 08:57:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:11,196 INFO L93 Difference]: Finished difference Result 8078 states and 12401 transitions. [2019-09-10 08:57:11,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:57:11,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-10 08:57:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:11,238 INFO L225 Difference]: With dead ends: 8078 [2019-09-10 08:57:11,239 INFO L226 Difference]: Without dead ends: 8078 [2019-09-10 08:57:11,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:57:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8078 states. [2019-09-10 08:57:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8078 to 7907. [2019-09-10 08:57:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7907 states. [2019-09-10 08:57:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7907 states to 7907 states and 12176 transitions. [2019-09-10 08:57:11,433 INFO L78 Accepts]: Start accepts. Automaton has 7907 states and 12176 transitions. Word has length 320 [2019-09-10 08:57:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:11,433 INFO L475 AbstractCegarLoop]: Abstraction has 7907 states and 12176 transitions. [2019-09-10 08:57:11,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:57:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 7907 states and 12176 transitions. [2019-09-10 08:57:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 08:57:11,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:11,451 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:11,451 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:11,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:11,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1741428615, now seen corresponding path program 1 times [2019-09-10 08:57:11,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:11,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:11,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:11,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:11,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:11,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:11,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:11,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:11,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:11,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:11,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:11,760 INFO L87 Difference]: Start difference. First operand 7907 states and 12176 transitions. Second operand 3 states. [2019-09-10 08:57:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:11,895 INFO L93 Difference]: Finished difference Result 15492 states and 23706 transitions. [2019-09-10 08:57:11,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:11,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-10 08:57:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:11,953 INFO L225 Difference]: With dead ends: 15492 [2019-09-10 08:57:11,954 INFO L226 Difference]: Without dead ends: 15492 [2019-09-10 08:57:11,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15492 states. [2019-09-10 08:57:12,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15492 to 15321. [2019-09-10 08:57:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15321 states. [2019-09-10 08:57:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15321 states to 15321 states and 23481 transitions. [2019-09-10 08:57:12,304 INFO L78 Accepts]: Start accepts. Automaton has 15321 states and 23481 transitions. Word has length 322 [2019-09-10 08:57:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:12,305 INFO L475 AbstractCegarLoop]: Abstraction has 15321 states and 23481 transitions. [2019-09-10 08:57:12,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 15321 states and 23481 transitions. [2019-09-10 08:57:12,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 08:57:12,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:12,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:12,332 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:12,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:12,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1240919436, now seen corresponding path program 1 times [2019-09-10 08:57:12,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:12,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:12,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:12,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:12,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:12,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:12,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:12,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:12,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:12,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:12,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:12,477 INFO L87 Difference]: Start difference. First operand 15321 states and 23481 transitions. Second operand 3 states. [2019-09-10 08:57:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:12,603 INFO L93 Difference]: Finished difference Result 30609 states and 46902 transitions. [2019-09-10 08:57:12,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:12,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-10 08:57:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:12,682 INFO L225 Difference]: With dead ends: 30609 [2019-09-10 08:57:12,682 INFO L226 Difference]: Without dead ends: 30609 [2019-09-10 08:57:12,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30609 states. [2019-09-10 08:57:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30609 to 15340. [2019-09-10 08:57:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15340 states. [2019-09-10 08:57:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15340 states to 15340 states and 23509 transitions. [2019-09-10 08:57:13,198 INFO L78 Accepts]: Start accepts. Automaton has 15340 states and 23509 transitions. Word has length 322 [2019-09-10 08:57:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:13,199 INFO L475 AbstractCegarLoop]: Abstraction has 15340 states and 23509 transitions. [2019-09-10 08:57:13,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 15340 states and 23509 transitions. [2019-09-10 08:57:13,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-10 08:57:13,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:13,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:13,227 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:13,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:13,228 INFO L82 PathProgramCache]: Analyzing trace with hash 543705657, now seen corresponding path program 1 times [2019-09-10 08:57:13,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:13,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:13,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:13,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:13,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:13,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:13,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:13,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:13,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:13,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:13,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:13,364 INFO L87 Difference]: Start difference. First operand 15340 states and 23509 transitions. Second operand 3 states. [2019-09-10 08:57:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:13,486 INFO L93 Difference]: Finished difference Result 30627 states and 46923 transitions. [2019-09-10 08:57:13,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:13,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-09-10 08:57:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:13,557 INFO L225 Difference]: With dead ends: 30627 [2019-09-10 08:57:13,557 INFO L226 Difference]: Without dead ends: 30627 [2019-09-10 08:57:13,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30627 states. [2019-09-10 08:57:14,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30627 to 15358. [2019-09-10 08:57:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15358 states. [2019-09-10 08:57:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15358 states to 15358 states and 23530 transitions. [2019-09-10 08:57:14,102 INFO L78 Accepts]: Start accepts. Automaton has 15358 states and 23530 transitions. Word has length 323 [2019-09-10 08:57:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:14,103 INFO L475 AbstractCegarLoop]: Abstraction has 15358 states and 23530 transitions. [2019-09-10 08:57:14,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 15358 states and 23530 transitions. [2019-09-10 08:57:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:57:14,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:14,130 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:14,130 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:14,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2007449599, now seen corresponding path program 1 times [2019-09-10 08:57:14,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:14,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:14,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:14,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:14,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:14,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:14,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:57:14,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:14,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:57:14,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:57:14,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:57:14,479 INFO L87 Difference]: Start difference. First operand 15358 states and 23530 transitions. Second operand 4 states. [2019-09-10 08:57:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:14,629 INFO L93 Difference]: Finished difference Result 30554 states and 46772 transitions. [2019-09-10 08:57:14,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:57:14,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-10 08:57:14,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:14,684 INFO L225 Difference]: With dead ends: 30554 [2019-09-10 08:57:14,685 INFO L226 Difference]: Without dead ends: 30554 [2019-09-10 08:57:14,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:57:14,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30554 states. [2019-09-10 08:57:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30554 to 15565. [2019-09-10 08:57:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15565 states. [2019-09-10 08:57:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15565 states to 15565 states and 23883 transitions. [2019-09-10 08:57:15,785 INFO L78 Accepts]: Start accepts. Automaton has 15565 states and 23883 transitions. Word has length 324 [2019-09-10 08:57:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:15,785 INFO L475 AbstractCegarLoop]: Abstraction has 15565 states and 23883 transitions. [2019-09-10 08:57:15,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:57:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 15565 states and 23883 transitions. [2019-09-10 08:57:15,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:57:15,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:15,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:15,816 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:15,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:15,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1304795810, now seen corresponding path program 1 times [2019-09-10 08:57:15,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:15,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:15,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:15,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:15,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:16,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:16,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:16,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:16,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:16,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:16,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:16,066 INFO L87 Difference]: Start difference. First operand 15565 states and 23883 transitions. Second operand 3 states. [2019-09-10 08:57:16,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:16,216 INFO L93 Difference]: Finished difference Result 28568 states and 43471 transitions. [2019-09-10 08:57:16,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:16,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 08:57:16,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:16,265 INFO L225 Difference]: With dead ends: 28568 [2019-09-10 08:57:16,266 INFO L226 Difference]: Without dead ends: 28568 [2019-09-10 08:57:16,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28568 states. [2019-09-10 08:57:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28568 to 28397. [2019-09-10 08:57:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28397 states. [2019-09-10 08:57:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28397 states to 28397 states and 43246 transitions. [2019-09-10 08:57:16,782 INFO L78 Accepts]: Start accepts. Automaton has 28397 states and 43246 transitions. Word has length 324 [2019-09-10 08:57:16,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:16,783 INFO L475 AbstractCegarLoop]: Abstraction has 28397 states and 43246 transitions. [2019-09-10 08:57:16,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 28397 states and 43246 transitions. [2019-09-10 08:57:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-10 08:57:16,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:16,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:16,816 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:16,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash 901762143, now seen corresponding path program 1 times [2019-09-10 08:57:16,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:16,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:16,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:16,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:16,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:16,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:16,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:16,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:16,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:16,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:16,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:16,995 INFO L87 Difference]: Start difference. First operand 28397 states and 43246 transitions. Second operand 3 states. [2019-09-10 08:57:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:17,154 INFO L93 Difference]: Finished difference Result 41231 states and 63633 transitions. [2019-09-10 08:57:17,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:17,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-09-10 08:57:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:17,203 INFO L225 Difference]: With dead ends: 41231 [2019-09-10 08:57:17,203 INFO L226 Difference]: Without dead ends: 41231 [2019-09-10 08:57:17,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:17,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41231 states. [2019-09-10 08:57:17,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41231 to 35869. [2019-09-10 08:57:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35869 states. [2019-09-10 08:57:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35869 states to 35869 states and 55564 transitions. [2019-09-10 08:57:17,664 INFO L78 Accepts]: Start accepts. Automaton has 35869 states and 55564 transitions. Word has length 325 [2019-09-10 08:57:17,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:17,665 INFO L475 AbstractCegarLoop]: Abstraction has 35869 states and 55564 transitions. [2019-09-10 08:57:17,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 35869 states and 55564 transitions. [2019-09-10 08:57:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:57:17,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:17,690 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:17,691 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:17,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:17,691 INFO L82 PathProgramCache]: Analyzing trace with hash 642945536, now seen corresponding path program 1 times [2019-09-10 08:57:17,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:17,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:17,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:17,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:17,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:18,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:18,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:18,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:18,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:18,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:18,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:18,050 INFO L87 Difference]: Start difference. First operand 35869 states and 55564 transitions. Second operand 3 states. [2019-09-10 08:57:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:18,236 INFO L93 Difference]: Finished difference Result 70971 states and 109772 transitions. [2019-09-10 08:57:18,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:18,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 08:57:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:18,317 INFO L225 Difference]: With dead ends: 70971 [2019-09-10 08:57:18,317 INFO L226 Difference]: Without dead ends: 70971 [2019-09-10 08:57:18,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70971 states. [2019-09-10 08:57:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70971 to 35973. [2019-09-10 08:57:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35973 states. [2019-09-10 08:57:18,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35973 states to 35973 states and 55707 transitions. [2019-09-10 08:57:18,810 INFO L78 Accepts]: Start accepts. Automaton has 35973 states and 55707 transitions. Word has length 326 [2019-09-10 08:57:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:18,810 INFO L475 AbstractCegarLoop]: Abstraction has 35973 states and 55707 transitions. [2019-09-10 08:57:18,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:18,811 INFO L276 IsEmpty]: Start isEmpty. Operand 35973 states and 55707 transitions. [2019-09-10 08:57:18,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 08:57:18,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:18,835 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:18,835 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:18,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:18,836 INFO L82 PathProgramCache]: Analyzing trace with hash 512545709, now seen corresponding path program 1 times [2019-09-10 08:57:18,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:18,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:18,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:18,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:18,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:19,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:19,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:19,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:19,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:19,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:19,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:19,826 INFO L87 Difference]: Start difference. First operand 35973 states and 55707 transitions. Second operand 3 states. [2019-09-10 08:57:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:20,014 INFO L93 Difference]: Finished difference Result 71096 states and 109918 transitions. [2019-09-10 08:57:20,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:20,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-10 08:57:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:20,087 INFO L225 Difference]: With dead ends: 71096 [2019-09-10 08:57:20,088 INFO L226 Difference]: Without dead ends: 71096 [2019-09-10 08:57:20,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71096 states. [2019-09-10 08:57:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71096 to 36098. [2019-09-10 08:57:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36098 states. [2019-09-10 08:57:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36098 states to 36098 states and 55853 transitions. [2019-09-10 08:57:20,581 INFO L78 Accepts]: Start accepts. Automaton has 36098 states and 55853 transitions. Word has length 327 [2019-09-10 08:57:20,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:20,581 INFO L475 AbstractCegarLoop]: Abstraction has 36098 states and 55853 transitions. [2019-09-10 08:57:20,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:20,582 INFO L276 IsEmpty]: Start isEmpty. Operand 36098 states and 55853 transitions. [2019-09-10 08:57:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:57:20,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:20,605 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:20,606 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:20,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:20,606 INFO L82 PathProgramCache]: Analyzing trace with hash 669895453, now seen corresponding path program 1 times [2019-09-10 08:57:20,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:20,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:20,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:20,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:20,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:20,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:20,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:20,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:20,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:20,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:20,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:20,770 INFO L87 Difference]: Start difference. First operand 36098 states and 55853 transitions. Second operand 3 states. [2019-09-10 08:57:20,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:20,996 INFO L93 Difference]: Finished difference Result 57916 states and 90170 transitions. [2019-09-10 08:57:20,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:20,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-10 08:57:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:21,054 INFO L225 Difference]: With dead ends: 57916 [2019-09-10 08:57:21,054 INFO L226 Difference]: Without dead ends: 57916 [2019-09-10 08:57:21,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:21,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57916 states. [2019-09-10 08:57:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57916 to 49770. [2019-09-10 08:57:21,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49770 states. [2019-09-10 08:57:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49770 states to 49770 states and 78203 transitions. [2019-09-10 08:57:21,664 INFO L78 Accepts]: Start accepts. Automaton has 49770 states and 78203 transitions. Word has length 328 [2019-09-10 08:57:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:21,665 INFO L475 AbstractCegarLoop]: Abstraction has 49770 states and 78203 transitions. [2019-09-10 08:57:21,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 49770 states and 78203 transitions. [2019-09-10 08:57:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:57:21,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:21,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:21,683 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:21,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:21,683 INFO L82 PathProgramCache]: Analyzing trace with hash 814681459, now seen corresponding path program 1 times [2019-09-10 08:57:21,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:21,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:21,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:21,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:21,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:22,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:22,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:57:22,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:22,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:57:22,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:57:22,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:57:22,091 INFO L87 Difference]: Start difference. First operand 49770 states and 78203 transitions. Second operand 4 states. [2019-09-10 08:57:22,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:22,225 INFO L93 Difference]: Finished difference Result 47348 states and 74353 transitions. [2019-09-10 08:57:22,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:57:22,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-10 08:57:22,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:22,308 INFO L225 Difference]: With dead ends: 47348 [2019-09-10 08:57:22,308 INFO L226 Difference]: Without dead ends: 46551 [2019-09-10 08:57:22,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:57:22,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46551 states. [2019-09-10 08:57:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46551 to 46531. [2019-09-10 08:57:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46531 states. [2019-09-10 08:57:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46531 states to 46531 states and 73086 transitions. [2019-09-10 08:57:23,029 INFO L78 Accepts]: Start accepts. Automaton has 46531 states and 73086 transitions. Word has length 328 [2019-09-10 08:57:23,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:23,029 INFO L475 AbstractCegarLoop]: Abstraction has 46531 states and 73086 transitions. [2019-09-10 08:57:23,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:57:23,030 INFO L276 IsEmpty]: Start isEmpty. Operand 46531 states and 73086 transitions. [2019-09-10 08:57:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:57:23,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:23,050 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:23,050 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:23,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:23,051 INFO L82 PathProgramCache]: Analyzing trace with hash 172661983, now seen corresponding path program 1 times [2019-09-10 08:57:23,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:23,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:23,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:23,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:23,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:23,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-10 08:57:23,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:23,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:57:23,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:23,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:57:23,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:57:23,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:57:23,490 INFO L87 Difference]: Start difference. First operand 46531 states and 73086 transitions. Second operand 5 states. [2019-09-10 08:57:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:24,398 INFO L93 Difference]: Finished difference Result 46533 states and 72853 transitions. [2019-09-10 08:57:24,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:57:24,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 328 [2019-09-10 08:57:24,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:24,446 INFO L225 Difference]: With dead ends: 46533 [2019-09-10 08:57:24,446 INFO L226 Difference]: Without dead ends: 46533 [2019-09-10 08:57:24,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:57:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46533 states. [2019-09-10 08:57:24,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46533 to 46531. [2019-09-10 08:57:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46531 states. [2019-09-10 08:57:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46531 states to 46531 states and 72852 transitions. [2019-09-10 08:57:24,852 INFO L78 Accepts]: Start accepts. Automaton has 46531 states and 72852 transitions. Word has length 328 [2019-09-10 08:57:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:24,852 INFO L475 AbstractCegarLoop]: Abstraction has 46531 states and 72852 transitions. [2019-09-10 08:57:24,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:57:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 46531 states and 72852 transitions. [2019-09-10 08:57:24,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:57:24,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:24,867 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:24,868 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:24,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:24,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1736727398, now seen corresponding path program 1 times [2019-09-10 08:57:24,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:24,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:24,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:24,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:24,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:25,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:25,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:57:25,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:25,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:57:25,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:57:25,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:57:25,678 INFO L87 Difference]: Start difference. First operand 46531 states and 72852 transitions. Second operand 4 states. [2019-09-10 08:57:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:26,009 INFO L93 Difference]: Finished difference Result 91445 states and 142585 transitions. [2019-09-10 08:57:26,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:57:26,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-10 08:57:26,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:26,135 INFO L225 Difference]: With dead ends: 91445 [2019-09-10 08:57:26,135 INFO L226 Difference]: Without dead ends: 91445 [2019-09-10 08:57:26,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:57:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91445 states. [2019-09-10 08:57:27,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91445 to 91288. [2019-09-10 08:57:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91288 states. [2019-09-10 08:57:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91288 states to 91288 states and 142378 transitions. [2019-09-10 08:57:27,183 INFO L78 Accepts]: Start accepts. Automaton has 91288 states and 142378 transitions. Word has length 328 [2019-09-10 08:57:27,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:27,183 INFO L475 AbstractCegarLoop]: Abstraction has 91288 states and 142378 transitions. [2019-09-10 08:57:27,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:57:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 91288 states and 142378 transitions. [2019-09-10 08:57:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:57:27,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:27,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:27,212 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:27,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:27,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1274556407, now seen corresponding path program 1 times [2019-09-10 08:57:27,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:27,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:27,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:27,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:27,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:27,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:27,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:27,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:27,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:27,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:27,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:27,785 INFO L87 Difference]: Start difference. First operand 91288 states and 142378 transitions. Second operand 3 states. [2019-09-10 08:57:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:28,221 INFO L93 Difference]: Finished difference Result 178097 states and 276115 transitions. [2019-09-10 08:57:28,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:28,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 08:57:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:28,427 INFO L225 Difference]: With dead ends: 178097 [2019-09-10 08:57:28,428 INFO L226 Difference]: Without dead ends: 178097 [2019-09-10 08:57:28,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178097 states. [2019-09-10 08:57:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178097 to 177944. [2019-09-10 08:57:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177944 states. [2019-09-10 08:57:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177944 states to 177944 states and 275916 transitions. [2019-09-10 08:57:32,267 INFO L78 Accepts]: Start accepts. Automaton has 177944 states and 275916 transitions. Word has length 330 [2019-09-10 08:57:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:32,267 INFO L475 AbstractCegarLoop]: Abstraction has 177944 states and 275916 transitions. [2019-09-10 08:57:32,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 177944 states and 275916 transitions. [2019-09-10 08:57:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:57:32,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:32,326 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:32,327 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1779435786, now seen corresponding path program 1 times [2019-09-10 08:57:32,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:32,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:32,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:32,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:32,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:32,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:32,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:32,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:32,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:32,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:32,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:32,537 INFO L87 Difference]: Start difference. First operand 177944 states and 275916 transitions. Second operand 3 states. [2019-09-10 08:57:33,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:33,430 INFO L93 Difference]: Finished difference Result 295197 states and 461154 transitions. [2019-09-10 08:57:33,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:33,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 08:57:33,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:33,750 INFO L225 Difference]: With dead ends: 295197 [2019-09-10 08:57:33,750 INFO L226 Difference]: Without dead ends: 295197 [2019-09-10 08:57:33,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:33,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295197 states. [2019-09-10 08:57:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295197 to 264856. [2019-09-10 08:57:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264856 states. [2019-09-10 08:57:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264856 states to 264856 states and 415796 transitions. [2019-09-10 08:57:40,321 INFO L78 Accepts]: Start accepts. Automaton has 264856 states and 415796 transitions. Word has length 332 [2019-09-10 08:57:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:40,321 INFO L475 AbstractCegarLoop]: Abstraction has 264856 states and 415796 transitions. [2019-09-10 08:57:40,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 264856 states and 415796 transitions. [2019-09-10 08:57:40,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:57:40,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:40,382 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:40,382 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:40,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:40,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1490284718, now seen corresponding path program 1 times [2019-09-10 08:57:40,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:40,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:40,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:40,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:40,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:40,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:40,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:40,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:40,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:40,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:40,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:40,622 INFO L87 Difference]: Start difference. First operand 264856 states and 415796 transitions. Second operand 3 states. [2019-09-10 08:57:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:46,440 INFO L93 Difference]: Finished difference Result 519704 states and 811630 transitions. [2019-09-10 08:57:46,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:46,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 08:57:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:47,092 INFO L225 Difference]: With dead ends: 519704 [2019-09-10 08:57:47,093 INFO L226 Difference]: Without dead ends: 519704 [2019-09-10 08:57:47,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519704 states. [2019-09-10 08:57:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519704 to 519555. [2019-09-10 08:57:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519555 states. [2019-09-10 08:58:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519555 states to 519555 states and 811439 transitions. [2019-09-10 08:58:02,165 INFO L78 Accepts]: Start accepts. Automaton has 519555 states and 811439 transitions. Word has length 332 [2019-09-10 08:58:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:02,165 INFO L475 AbstractCegarLoop]: Abstraction has 519555 states and 811439 transitions. [2019-09-10 08:58:02,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:58:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 519555 states and 811439 transitions. [2019-09-10 08:58:02,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:58:02,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:58:02,280 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:02,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:02,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1071547665, now seen corresponding path program 1 times [2019-09-10 08:58:02,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:02,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:02,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:02,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:02,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:58:02,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:02,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:58:02,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:02,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:58:02,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:58:02,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:58:02,563 INFO L87 Difference]: Start difference. First operand 519555 states and 811439 transitions. Second operand 4 states. [2019-09-10 08:58:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:04,441 INFO L93 Difference]: Finished difference Result 876970 states and 1366652 transitions. [2019-09-10 08:58:04,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:58:04,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-10 08:58:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:14,363 INFO L225 Difference]: With dead ends: 876970 [2019-09-10 08:58:14,364 INFO L226 Difference]: Without dead ends: 876970 [2019-09-10 08:58:14,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:58:14,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876970 states. [2019-09-10 08:58:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876970 to 502737. [2019-09-10 08:58:21,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502737 states. [2019-09-10 08:58:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502737 states to 502737 states and 784686 transitions. [2019-09-10 08:58:22,359 INFO L78 Accepts]: Start accepts. Automaton has 502737 states and 784686 transitions. Word has length 332 [2019-09-10 08:58:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:22,359 INFO L475 AbstractCegarLoop]: Abstraction has 502737 states and 784686 transitions. [2019-09-10 08:58:22,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:58:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 502737 states and 784686 transitions. [2019-09-10 08:58:22,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-10 08:58:22,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:22,482 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:58:22,482 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:22,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2006517705, now seen corresponding path program 1 times [2019-09-10 08:58:22,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:22,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:22,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:58:29,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:29,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:58:29,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:29,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:58:29,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:58:29,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:58:29,082 INFO L87 Difference]: Start difference. First operand 502737 states and 784686 transitions. Second operand 3 states. [2019-09-10 08:58:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:31,785 INFO L93 Difference]: Finished difference Result 903019 states and 1407731 transitions. [2019-09-10 08:58:31,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:58:31,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-10 08:58:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:33,049 INFO L225 Difference]: With dead ends: 903019 [2019-09-10 08:58:33,049 INFO L226 Difference]: Without dead ends: 903019 [2019-09-10 08:58:33,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:58:33,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903019 states. [2019-09-10 08:58:48,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903019 to 503218. [2019-09-10 08:58:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503218 states. [2019-09-10 08:58:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503218 states to 503218 states and 785284 transitions. [2019-09-10 08:58:48,829 INFO L78 Accepts]: Start accepts. Automaton has 503218 states and 785284 transitions. Word has length 335 [2019-09-10 08:58:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:48,829 INFO L475 AbstractCegarLoop]: Abstraction has 503218 states and 785284 transitions. [2019-09-10 08:58:48,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:58:48,829 INFO L276 IsEmpty]: Start isEmpty. Operand 503218 states and 785284 transitions. [2019-09-10 08:58:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 08:58:48,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:48,942 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:58:48,942 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:48,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:48,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2068349541, now seen corresponding path program 1 times [2019-09-10 08:58:48,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:48,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:48,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:48,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:48,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:58:49,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:49,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:58:49,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:49,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:58:49,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:58:49,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:58:49,296 INFO L87 Difference]: Start difference. First operand 503218 states and 785284 transitions. Second operand 8 states. [2019-09-10 08:59:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:59:02,992 INFO L93 Difference]: Finished difference Result 1333243 states and 2062493 transitions. [2019-09-10 08:59:02,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:59:02,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 336 [2019-09-10 08:59:02,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:59:05,685 INFO L225 Difference]: With dead ends: 1333243 [2019-09-10 08:59:05,686 INFO L226 Difference]: Without dead ends: 1333243 [2019-09-10 08:59:05,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:59:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333243 states. [2019-09-10 08:59:26,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333243 to 728362. [2019-09-10 08:59:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728362 states. [2019-09-10 08:59:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728362 states to 728362 states and 1125986 transitions. [2019-09-10 08:59:39,453 INFO L78 Accepts]: Start accepts. Automaton has 728362 states and 1125986 transitions. Word has length 336 [2019-09-10 08:59:39,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:59:39,454 INFO L475 AbstractCegarLoop]: Abstraction has 728362 states and 1125986 transitions. [2019-09-10 08:59:39,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:59:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 728362 states and 1125986 transitions. [2019-09-10 08:59:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 08:59:39,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:59:39,578 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:59:39,579 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:59:39,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:59:39,579 INFO L82 PathProgramCache]: Analyzing trace with hash -32274158, now seen corresponding path program 1 times [2019-09-10 08:59:39,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:59:39,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:59:39,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:59:39,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:59:39,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:59:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:59:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:59:40,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:59:40,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:59:40,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:59:40,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:59:40,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:59:40,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:59:40,107 INFO L87 Difference]: Start difference. First operand 728362 states and 1125986 transitions. Second operand 4 states. [2019-09-10 08:59:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:59:53,590 INFO L93 Difference]: Finished difference Result 1388206 states and 2137191 transitions. [2019-09-10 08:59:53,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:59:53,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2019-09-10 08:59:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:59:55,363 INFO L225 Difference]: With dead ends: 1388206 [2019-09-10 08:59:55,363 INFO L226 Difference]: Without dead ends: 1388206 [2019-09-10 08:59:55,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:59:56,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388206 states. [2019-09-10 09:00:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388206 to 1388095. [2019-09-10 09:00:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388095 states. [2019-09-10 09:00:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388095 states to 1388095 states and 2137056 transitions. [2019-09-10 09:00:44,236 INFO L78 Accepts]: Start accepts. Automaton has 1388095 states and 2137056 transitions. Word has length 336 [2019-09-10 09:00:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:44,236 INFO L475 AbstractCegarLoop]: Abstraction has 1388095 states and 2137056 transitions. [2019-09-10 09:00:44,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1388095 states and 2137056 transitions. [2019-09-10 09:00:44,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 09:00:44,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:44,507 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:44,507 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:44,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:44,508 INFO L82 PathProgramCache]: Analyzing trace with hash -308606696, now seen corresponding path program 1 times [2019-09-10 09:00:44,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:44,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:44,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:44,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:44,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:00:44,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:44,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:44,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:44,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:44,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:44,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:44,752 INFO L87 Difference]: Start difference. First operand 1388095 states and 2137056 transitions. Second operand 3 states.