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_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:29:20,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:29:20,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:29:20,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:29:20,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:29:20,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:29:20,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:29:20,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:29:20,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:29:20,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:29:20,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:29:20,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:29:20,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:29:20,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:29:20,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:29:20,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:29:20,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:29:20,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:29:20,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:29:20,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:29:20,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:29:20,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:29:20,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:29:20,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:29:20,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:29:20,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:29:20,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:29:20,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:29:20,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:29:20,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:29:20,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:29:20,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:29:20,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:29:20,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:29:20,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:29:20,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:29:20,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:29:20,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:29:20,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:29:20,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:29:20,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:29:20,539 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 06:29:20,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:29:20,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:29:20,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:29:20,554 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:29:20,555 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:29:20,555 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:29:20,555 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:29:20,555 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:29:20,556 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:29:20,556 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:29:20,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:29:20,557 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:29:20,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:29:20,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:29:20,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:29:20,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:29:20,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:29:20,558 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:29:20,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:29:20,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:29:20,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:29:20,559 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:29:20,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:29:20,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:29:20,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:29:20,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:29:20,560 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:29:20,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:29:20,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:29:20,560 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:29:20,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:29:20,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:29:20,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:29:20,621 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:29:20,622 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:29:20,622 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 06:29:20,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2235ce1a2/a1445769890e4fb6998feb2f6a1870ff/FLAG347c0eee2 [2019-09-10 06:29:21,393 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:29:21,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 06:29:21,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2235ce1a2/a1445769890e4fb6998feb2f6a1870ff/FLAG347c0eee2 [2019-09-10 06:29:21,526 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2235ce1a2/a1445769890e4fb6998feb2f6a1870ff [2019-09-10 06:29:21,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:29:21,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:29:21,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:29:21,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:29:21,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:29:21,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:29:21" (1/1) ... [2019-09-10 06:29:21,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d5c9c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:21, skipping insertion in model container [2019-09-10 06:29:21,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:29:21" (1/1) ... [2019-09-10 06:29:21,551 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:29:21,710 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:29:23,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:29:23,139 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:29:24,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:29:24,452 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:29:24,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:24 WrapperNode [2019-09-10 06:29:24,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:29:24,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:29:24,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:29:24,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:29:24,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:24" (1/1) ... [2019-09-10 06:29:24,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:24" (1/1) ... [2019-09-10 06:29:24,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:24" (1/1) ... [2019-09-10 06:29:24,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:24" (1/1) ... [2019-09-10 06:29:24,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:24" (1/1) ... [2019-09-10 06:29:24,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:24" (1/1) ... [2019-09-10 06:29:24,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:24" (1/1) ... [2019-09-10 06:29:24,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:29:24,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:29:24,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:29:24,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:29:24,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:24" (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 06:29:24,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:29:24,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:29:24,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:29:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:29:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:29:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:29:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:29:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:29:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:29:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:29:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:29:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:29:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:29:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:29:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 06:29:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:29:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:29:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:29:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:29:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:29:29,464 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:29:29,464 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:29:29,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:29:29 BoogieIcfgContainer [2019-09-10 06:29:29,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:29:29,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:29:29,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:29:29,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:29:29,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:29:21" (1/3) ... [2019-09-10 06:29:29,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c94b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:29:29, skipping insertion in model container [2019-09-10 06:29:29,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:24" (2/3) ... [2019-09-10 06:29:29,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c94b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:29:29, skipping insertion in model container [2019-09-10 06:29:29,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:29:29" (3/3) ... [2019-09-10 06:29:29,483 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 06:29:29,494 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:29:29,525 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 06:29:29,544 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 06:29:29,577 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:29:29,577 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:29:29,577 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:29:29,578 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:29:29,578 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:29:29,578 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:29:29,579 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:29:29,579 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:29:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states. [2019-09-10 06:29:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-09-10 06:29:29,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:29,685 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:29,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:29,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1628601858, now seen corresponding path program 1 times [2019-09-10 06:29:29,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:29,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:29,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:29,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:29,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:32,192 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 06:29:32,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:32,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:32,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:32,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:32,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:32,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:32,219 INFO L87 Difference]: Start difference. First operand 1371 states. Second operand 4 states. [2019-09-10 06:29:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:32,629 INFO L93 Difference]: Finished difference Result 2705 states and 4873 transitions. [2019-09-10 06:29:32,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:29:32,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 464 [2019-09-10 06:29:32,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:32,669 INFO L225 Difference]: With dead ends: 2705 [2019-09-10 06:29:32,669 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 06:29:32,672 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 06:29:32,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 06:29:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2647. [2019-09-10 06:29:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2647 states. [2019-09-10 06:29:32,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 4347 transitions. [2019-09-10 06:29:32,823 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 4347 transitions. Word has length 464 [2019-09-10 06:29:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:32,824 INFO L475 AbstractCegarLoop]: Abstraction has 2647 states and 4347 transitions. [2019-09-10 06:29:32,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:29:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 4347 transitions. [2019-09-10 06:29:32,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-10 06:29:32,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:32,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:32,846 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:32,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:32,846 INFO L82 PathProgramCache]: Analyzing trace with hash -283070934, now seen corresponding path program 1 times [2019-09-10 06:29:32,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:32,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:32,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:32,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:32,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:33,677 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 06:29:33,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:33,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:33,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:33,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:33,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:33,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:33,694 INFO L87 Difference]: Start difference. First operand 2647 states and 4347 transitions. Second operand 3 states. [2019-09-10 06:29:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:33,941 INFO L93 Difference]: Finished difference Result 5237 states and 8571 transitions. [2019-09-10 06:29:33,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:33,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 466 [2019-09-10 06:29:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:33,975 INFO L225 Difference]: With dead ends: 5237 [2019-09-10 06:29:33,975 INFO L226 Difference]: Without dead ends: 5237 [2019-09-10 06:29:33,976 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 06:29:33,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5237 states. [2019-09-10 06:29:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5237 to 5189. [2019-09-10 06:29:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5189 states. [2019-09-10 06:29:34,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 8497 transitions. [2019-09-10 06:29:34,122 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 8497 transitions. Word has length 466 [2019-09-10 06:29:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:34,124 INFO L475 AbstractCegarLoop]: Abstraction has 5189 states and 8497 transitions. [2019-09-10 06:29:34,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 8497 transitions. [2019-09-10 06:29:34,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-10 06:29:34,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:34,147 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:34,147 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:34,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:34,149 INFO L82 PathProgramCache]: Analyzing trace with hash 806995065, now seen corresponding path program 1 times [2019-09-10 06:29:34,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:34,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:34,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:34,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:34,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:34,528 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 06:29:34,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:34,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:34,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:34,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:34,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:34,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:34,531 INFO L87 Difference]: Start difference. First operand 5189 states and 8497 transitions. Second operand 3 states. [2019-09-10 06:29:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:34,660 INFO L93 Difference]: Finished difference Result 10333 states and 16906 transitions. [2019-09-10 06:29:34,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:34,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 467 [2019-09-10 06:29:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:34,717 INFO L225 Difference]: With dead ends: 10333 [2019-09-10 06:29:34,717 INFO L226 Difference]: Without dead ends: 10333 [2019-09-10 06:29:34,717 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 06:29:34,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10333 states. [2019-09-10 06:29:34,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10333 to 5236. [2019-09-10 06:29:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5236 states. [2019-09-10 06:29:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 8571 transitions. [2019-09-10 06:29:34,892 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 8571 transitions. Word has length 467 [2019-09-10 06:29:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:34,893 INFO L475 AbstractCegarLoop]: Abstraction has 5236 states and 8571 transitions. [2019-09-10 06:29:34,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 8571 transitions. [2019-09-10 06:29:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-10 06:29:34,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:34,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:34,913 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:34,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:34,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1222308475, now seen corresponding path program 1 times [2019-09-10 06:29:34,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:34,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:34,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:34,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:34,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:35,563 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 06:29:35,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:35,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:35,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:35,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:35,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:35,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:35,567 INFO L87 Difference]: Start difference. First operand 5236 states and 8571 transitions. Second operand 3 states. [2019-09-10 06:29:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:35,825 INFO L93 Difference]: Finished difference Result 10211 states and 16627 transitions. [2019-09-10 06:29:35,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:35,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 468 [2019-09-10 06:29:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:35,866 INFO L225 Difference]: With dead ends: 10211 [2019-09-10 06:29:35,866 INFO L226 Difference]: Without dead ends: 10211 [2019-09-10 06:29:35,867 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 06:29:35,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10211 states. [2019-09-10 06:29:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10211 to 10165. [2019-09-10 06:29:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10165 states. [2019-09-10 06:29:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10165 states to 10165 states and 16557 transitions. [2019-09-10 06:29:36,084 INFO L78 Accepts]: Start accepts. Automaton has 10165 states and 16557 transitions. Word has length 468 [2019-09-10 06:29:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:36,085 INFO L475 AbstractCegarLoop]: Abstraction has 10165 states and 16557 transitions. [2019-09-10 06:29:36,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 10165 states and 16557 transitions. [2019-09-10 06:29:36,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-10 06:29:36,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:36,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:36,109 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:36,110 INFO L82 PathProgramCache]: Analyzing trace with hash -600839798, now seen corresponding path program 1 times [2019-09-10 06:29:36,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:36,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:36,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:36,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:36,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:36,913 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 06:29:36,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:36,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:36,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:36,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:36,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:36,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:36,916 INFO L87 Difference]: Start difference. First operand 10165 states and 16557 transitions. Second operand 3 states. [2019-09-10 06:29:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:37,072 INFO L93 Difference]: Finished difference Result 20218 states and 32904 transitions. [2019-09-10 06:29:37,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:37,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 468 [2019-09-10 06:29:37,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:37,120 INFO L225 Difference]: With dead ends: 20218 [2019-09-10 06:29:37,120 INFO L226 Difference]: Without dead ends: 20218 [2019-09-10 06:29:37,121 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 06:29:37,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20218 states. [2019-09-10 06:29:37,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20218 to 10263. [2019-09-10 06:29:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10263 states. [2019-09-10 06:29:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10263 states to 10263 states and 16708 transitions. [2019-09-10 06:29:37,408 INFO L78 Accepts]: Start accepts. Automaton has 10263 states and 16708 transitions. Word has length 468 [2019-09-10 06:29:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:37,409 INFO L475 AbstractCegarLoop]: Abstraction has 10263 states and 16708 transitions. [2019-09-10 06:29:37,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 10263 states and 16708 transitions. [2019-09-10 06:29:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-10 06:29:37,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:37,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:37,437 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:37,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1594930186, now seen corresponding path program 1 times [2019-09-10 06:29:37,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:37,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:37,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:37,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:37,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:37,735 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 06:29:37,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:37,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:37,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:37,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:37,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:37,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:37,738 INFO L87 Difference]: Start difference. First operand 10263 states and 16708 transitions. Second operand 3 states. [2019-09-10 06:29:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:37,909 INFO L93 Difference]: Finished difference Result 20335 states and 33050 transitions. [2019-09-10 06:29:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:37,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-09-10 06:29:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:37,952 INFO L225 Difference]: With dead ends: 20335 [2019-09-10 06:29:37,953 INFO L226 Difference]: Without dead ends: 20335 [2019-09-10 06:29:37,953 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 06:29:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20335 states. [2019-09-10 06:29:38,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20335 to 10380. [2019-09-10 06:29:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10380 states. [2019-09-10 06:29:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10380 states to 10380 states and 16854 transitions. [2019-09-10 06:29:38,259 INFO L78 Accepts]: Start accepts. Automaton has 10380 states and 16854 transitions. Word has length 469 [2019-09-10 06:29:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:38,260 INFO L475 AbstractCegarLoop]: Abstraction has 10380 states and 16854 transitions. [2019-09-10 06:29:38,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 10380 states and 16854 transitions. [2019-09-10 06:29:38,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-09-10 06:29:38,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:38,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:38,293 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:38,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:38,293 INFO L82 PathProgramCache]: Analyzing trace with hash -243448576, now seen corresponding path program 1 times [2019-09-10 06:29:38,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:38,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:38,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:38,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:38,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:38,786 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 06:29:38,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:38,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:38,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:38,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:38,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:38,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:38,788 INFO L87 Difference]: Start difference. First operand 10380 states and 16854 transitions. Second operand 3 states. [2019-09-10 06:29:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:38,989 INFO L93 Difference]: Finished difference Result 20045 states and 32393 transitions. [2019-09-10 06:29:38,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:38,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2019-09-10 06:29:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:39,035 INFO L225 Difference]: With dead ends: 20045 [2019-09-10 06:29:39,036 INFO L226 Difference]: Without dead ends: 20045 [2019-09-10 06:29:39,036 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 06:29:39,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20045 states. [2019-09-10 06:29:39,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20045 to 20001. [2019-09-10 06:29:39,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20001 states. [2019-09-10 06:29:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20001 states to 20001 states and 32327 transitions. [2019-09-10 06:29:39,332 INFO L78 Accepts]: Start accepts. Automaton has 20001 states and 32327 transitions. Word has length 470 [2019-09-10 06:29:39,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:39,333 INFO L475 AbstractCegarLoop]: Abstraction has 20001 states and 32327 transitions. [2019-09-10 06:29:39,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 20001 states and 32327 transitions. [2019-09-10 06:29:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-09-10 06:29:39,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:39,382 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:39,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:39,383 INFO L82 PathProgramCache]: Analyzing trace with hash -539508643, now seen corresponding path program 1 times [2019-09-10 06:29:39,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:39,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:39,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:39,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:39,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:40,223 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 06:29:40,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:40,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:40,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:40,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:40,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:40,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:40,225 INFO L87 Difference]: Start difference. First operand 20001 states and 32327 transitions. Second operand 4 states. [2019-09-10 06:29:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:40,416 INFO L93 Difference]: Finished difference Result 37652 states and 60635 transitions. [2019-09-10 06:29:40,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:40,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 470 [2019-09-10 06:29:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:40,484 INFO L225 Difference]: With dead ends: 37652 [2019-09-10 06:29:40,485 INFO L226 Difference]: Without dead ends: 37652 [2019-09-10 06:29:40,485 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 06:29:40,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37652 states. [2019-09-10 06:29:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37652 to 21294. [2019-09-10 06:29:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21294 states. [2019-09-10 06:29:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21294 states to 21294 states and 34606 transitions. [2019-09-10 06:29:40,848 INFO L78 Accepts]: Start accepts. Automaton has 21294 states and 34606 transitions. Word has length 470 [2019-09-10 06:29:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:40,848 INFO L475 AbstractCegarLoop]: Abstraction has 21294 states and 34606 transitions. [2019-09-10 06:29:40,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:29:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 21294 states and 34606 transitions. [2019-09-10 06:29:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-09-10 06:29:40,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:40,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:40,876 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:40,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:40,877 INFO L82 PathProgramCache]: Analyzing trace with hash 252581075, now seen corresponding path program 1 times [2019-09-10 06:29:40,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:40,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:40,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:40,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:40,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:41,987 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 06:29:41,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:41,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:41,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:41,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:41,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:41,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:41,990 INFO L87 Difference]: Start difference. First operand 21294 states and 34606 transitions. Second operand 3 states. [2019-09-10 06:29:42,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:42,164 INFO L93 Difference]: Finished difference Result 39110 states and 62934 transitions. [2019-09-10 06:29:42,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:42,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 473 [2019-09-10 06:29:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:42,243 INFO L225 Difference]: With dead ends: 39110 [2019-09-10 06:29:42,244 INFO L226 Difference]: Without dead ends: 39110 [2019-09-10 06:29:42,245 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 06:29:42,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39110 states. [2019-09-10 06:29:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39110 to 21741. [2019-09-10 06:29:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21741 states. [2019-09-10 06:29:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21741 states to 21741 states and 35281 transitions. [2019-09-10 06:29:42,620 INFO L78 Accepts]: Start accepts. Automaton has 21741 states and 35281 transitions. Word has length 473 [2019-09-10 06:29:42,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:42,621 INFO L475 AbstractCegarLoop]: Abstraction has 21741 states and 35281 transitions. [2019-09-10 06:29:42,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 21741 states and 35281 transitions. [2019-09-10 06:29:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2019-09-10 06:29:42,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:42,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:42,642 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:42,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:42,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1266776201, now seen corresponding path program 1 times [2019-09-10 06:29:42,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:42,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:42,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:42,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:42,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:42,911 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 06:29:42,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:42,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:42,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:42,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:42,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:42,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:42,914 INFO L87 Difference]: Start difference. First operand 21741 states and 35281 transitions. Second operand 3 states. [2019-09-10 06:29:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:43,093 INFO L93 Difference]: Finished difference Result 39725 states and 63810 transitions. [2019-09-10 06:29:43,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:43,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 474 [2019-09-10 06:29:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:43,145 INFO L225 Difference]: With dead ends: 39725 [2019-09-10 06:29:43,146 INFO L226 Difference]: Without dead ends: 39725 [2019-09-10 06:29:43,146 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 06:29:43,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39725 states. [2019-09-10 06:29:43,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39725 to 22388. [2019-09-10 06:29:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22388 states. [2019-09-10 06:29:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22388 states to 22388 states and 36221 transitions. [2019-09-10 06:29:43,479 INFO L78 Accepts]: Start accepts. Automaton has 22388 states and 36221 transitions. Word has length 474 [2019-09-10 06:29:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:43,479 INFO L475 AbstractCegarLoop]: Abstraction has 22388 states and 36221 transitions. [2019-09-10 06:29:43,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 22388 states and 36221 transitions. [2019-09-10 06:29:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-09-10 06:29:43,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:43,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:43,508 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:43,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:43,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1149335967, now seen corresponding path program 1 times [2019-09-10 06:29:43,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:43,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:43,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:43,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:43,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:43,942 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 06:29:43,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:43,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:43,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:43,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:43,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:43,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:43,945 INFO L87 Difference]: Start difference. First operand 22388 states and 36221 transitions. Second operand 3 states. [2019-09-10 06:29:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:44,086 INFO L93 Difference]: Finished difference Result 40579 states and 64872 transitions. [2019-09-10 06:29:44,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:44,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2019-09-10 06:29:44,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:44,130 INFO L225 Difference]: With dead ends: 40579 [2019-09-10 06:29:44,131 INFO L226 Difference]: Without dead ends: 40579 [2019-09-10 06:29:44,132 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 06:29:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40579 states. [2019-09-10 06:29:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40579 to 23242. [2019-09-10 06:29:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23242 states. [2019-09-10 06:29:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23242 states to 23242 states and 37283 transitions. [2019-09-10 06:29:44,462 INFO L78 Accepts]: Start accepts. Automaton has 23242 states and 37283 transitions. Word has length 475 [2019-09-10 06:29:44,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:44,463 INFO L475 AbstractCegarLoop]: Abstraction has 23242 states and 37283 transitions. [2019-09-10 06:29:44,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 23242 states and 37283 transitions. [2019-09-10 06:29:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-10 06:29:44,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:44,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:44,485 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:44,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:44,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1200487636, now seen corresponding path program 1 times [2019-09-10 06:29:44,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:44,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:44,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:44,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:44,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:45,200 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 06:29:45,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:45,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:29:45,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:45,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:29:45,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:29:45,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:29:45,202 INFO L87 Difference]: Start difference. First operand 23242 states and 37283 transitions. Second operand 5 states. [2019-09-10 06:29:46,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:46,705 INFO L93 Difference]: Finished difference Result 32092 states and 50868 transitions. [2019-09-10 06:29:46,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:29:46,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 476 [2019-09-10 06:29:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:46,733 INFO L225 Difference]: With dead ends: 32092 [2019-09-10 06:29:46,733 INFO L226 Difference]: Without dead ends: 32092 [2019-09-10 06:29:46,734 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 06:29:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-09-10 06:29:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32090. [2019-09-10 06:29:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32090 states. [2019-09-10 06:29:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32090 states to 32090 states and 50867 transitions. [2019-09-10 06:29:47,010 INFO L78 Accepts]: Start accepts. Automaton has 32090 states and 50867 transitions. Word has length 476 [2019-09-10 06:29:47,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:47,010 INFO L475 AbstractCegarLoop]: Abstraction has 32090 states and 50867 transitions. [2019-09-10 06:29:47,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:29:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 32090 states and 50867 transitions. [2019-09-10 06:29:47,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-10 06:29:47,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:47,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:47,039 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:47,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:47,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1910003993, now seen corresponding path program 1 times [2019-09-10 06:29:47,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:47,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:47,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:47,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:47,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:48,741 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 06:29:48,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:48,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:29:48,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:48,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:29:48,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:29:48,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:29:48,744 INFO L87 Difference]: Start difference. First operand 32090 states and 50867 transitions. Second operand 16 states. [2019-09-10 06:29:48,885 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-09-10 06:29:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:55,284 INFO L93 Difference]: Finished difference Result 52151 states and 81816 transitions. [2019-09-10 06:29:55,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:29:55,286 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 476 [2019-09-10 06:29:55,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:55,329 INFO L225 Difference]: With dead ends: 52151 [2019-09-10 06:29:55,330 INFO L226 Difference]: Without dead ends: 52151 [2019-09-10 06:29:55,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=331, Invalid=791, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:29:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52151 states. [2019-09-10 06:29:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52151 to 34606. [2019-09-10 06:29:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34606 states. [2019-09-10 06:29:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34606 states to 34606 states and 54535 transitions. [2019-09-10 06:29:55,668 INFO L78 Accepts]: Start accepts. Automaton has 34606 states and 54535 transitions. Word has length 476 [2019-09-10 06:29:55,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:55,668 INFO L475 AbstractCegarLoop]: Abstraction has 34606 states and 54535 transitions. [2019-09-10 06:29:55,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:29:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 34606 states and 54535 transitions. [2019-09-10 06:29:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-10 06:29:55,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:55,690 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:55,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:55,691 INFO L82 PathProgramCache]: Analyzing trace with hash 554075518, now seen corresponding path program 1 times [2019-09-10 06:29:55,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:55,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:55,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:55,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:55,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:57,258 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 06:29:57,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:57,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:57,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:57,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:57,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:57,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:57,260 INFO L87 Difference]: Start difference. First operand 34606 states and 54535 transitions. Second operand 4 states. [2019-09-10 06:29:57,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:57,611 INFO L93 Difference]: Finished difference Result 67496 states and 105921 transitions. [2019-09-10 06:29:57,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:57,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 476 [2019-09-10 06:29:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:57,686 INFO L225 Difference]: With dead ends: 67496 [2019-09-10 06:29:57,686 INFO L226 Difference]: Without dead ends: 67496 [2019-09-10 06:29:57,690 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 06:29:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67496 states. [2019-09-10 06:29:58,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67496 to 67456. [2019-09-10 06:29:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67456 states. [2019-09-10 06:29:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67456 states to 67456 states and 105861 transitions. [2019-09-10 06:29:58,362 INFO L78 Accepts]: Start accepts. Automaton has 67456 states and 105861 transitions. Word has length 476 [2019-09-10 06:29:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:58,362 INFO L475 AbstractCegarLoop]: Abstraction has 67456 states and 105861 transitions. [2019-09-10 06:29:58,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:29:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 67456 states and 105861 transitions. [2019-09-10 06:29:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-09-10 06:29:58,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:58,405 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:58,405 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:58,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:58,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1128589042, now seen corresponding path program 1 times [2019-09-10 06:29:58,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:58,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:58,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:58,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:58,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:58,888 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 06:29:58,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:58,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:58,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:58,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:58,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:58,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:58,891 INFO L87 Difference]: Start difference. First operand 67456 states and 105861 transitions. Second operand 3 states. [2019-09-10 06:30:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:00,712 INFO L93 Difference]: Finished difference Result 131951 states and 205887 transitions. [2019-09-10 06:30:00,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:00,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 478 [2019-09-10 06:30:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:00,821 INFO L225 Difference]: With dead ends: 131951 [2019-09-10 06:30:00,822 INFO L226 Difference]: Without dead ends: 131951 [2019-09-10 06:30:00,822 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 06:30:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131951 states. [2019-09-10 06:30:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131951 to 131913. [2019-09-10 06:30:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131913 states. [2019-09-10 06:30:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131913 states to 131913 states and 205831 transitions. [2019-09-10 06:30:01,866 INFO L78 Accepts]: Start accepts. Automaton has 131913 states and 205831 transitions. Word has length 478 [2019-09-10 06:30:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:01,867 INFO L475 AbstractCegarLoop]: Abstraction has 131913 states and 205831 transitions. [2019-09-10 06:30:01,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 131913 states and 205831 transitions. [2019-09-10 06:30:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-09-10 06:30:01,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:01,957 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:30:01,957 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:01,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:01,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1641276250, now seen corresponding path program 1 times [2019-09-10 06:30:01,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:01,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:01,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:01,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:01,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:04,358 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 06:30:04,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:04,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:04,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:04,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:04,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:04,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:04,363 INFO L87 Difference]: Start difference. First operand 131913 states and 205831 transitions. Second operand 3 states. [2019-09-10 06:30:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:04,966 INFO L93 Difference]: Finished difference Result 259559 states and 403177 transitions. [2019-09-10 06:30:04,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:04,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 478 [2019-09-10 06:30:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:05,218 INFO L225 Difference]: With dead ends: 259559 [2019-09-10 06:30:05,218 INFO L226 Difference]: Without dead ends: 259559 [2019-09-10 06:30:05,218 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 06:30:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259559 states. [2019-09-10 06:30:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259559 to 259523. [2019-09-10 06:30:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259523 states. [2019-09-10 06:30:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259523 states to 259523 states and 403125 transitions. [2019-09-10 06:30:10,770 INFO L78 Accepts]: Start accepts. Automaton has 259523 states and 403125 transitions. Word has length 478 [2019-09-10 06:30:10,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:10,770 INFO L475 AbstractCegarLoop]: Abstraction has 259523 states and 403125 transitions. [2019-09-10 06:30:10,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 259523 states and 403125 transitions. [2019-09-10 06:30:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-09-10 06:30:10,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:10,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:30:10,945 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:10,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:10,945 INFO L82 PathProgramCache]: Analyzing trace with hash -767378623, now seen corresponding path program 1 times [2019-09-10 06:30:10,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:10,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:10,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:10,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:10,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:11,427 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 06:30:11,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:11,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:11,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:11,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:11,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:11,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:11,429 INFO L87 Difference]: Start difference. First operand 259523 states and 403125 transitions. Second operand 3 states. [2019-09-10 06:30:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:12,605 INFO L93 Difference]: Finished difference Result 509992 states and 788140 transitions. [2019-09-10 06:30:12,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:12,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 480 [2019-09-10 06:30:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:18,694 INFO L225 Difference]: With dead ends: 509992 [2019-09-10 06:30:18,695 INFO L226 Difference]: Without dead ends: 509992 [2019-09-10 06:30:18,695 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 06:30:18,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509992 states. [2019-09-10 06:30:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509992 to 509958. [2019-09-10 06:30:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509958 states. [2019-09-10 06:30:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509958 states to 509958 states and 788092 transitions. [2019-09-10 06:30:31,059 INFO L78 Accepts]: Start accepts. Automaton has 509958 states and 788092 transitions. Word has length 480 [2019-09-10 06:30:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:31,059 INFO L475 AbstractCegarLoop]: Abstraction has 509958 states and 788092 transitions. [2019-09-10 06:30:31,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 509958 states and 788092 transitions. [2019-09-10 06:30:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-09-10 06:30:31,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:30:31,444 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:31,445 INFO L82 PathProgramCache]: Analyzing trace with hash -838451170, now seen corresponding path program 1 times [2019-09-10 06:30:31,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:31,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:31,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:31,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:31,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:32,127 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 06:30:32,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:32,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:30:32,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:32,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:30:32,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:30:32,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:30:32,129 INFO L87 Difference]: Start difference. First operand 509958 states and 788092 transitions. Second operand 4 states. [2019-09-10 06:30:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:39,896 INFO L93 Difference]: Finished difference Result 933957 states and 1436789 transitions. [2019-09-10 06:30:39,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:30:39,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 480 [2019-09-10 06:30:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:40,869 INFO L225 Difference]: With dead ends: 933957 [2019-09-10 06:30:40,869 INFO L226 Difference]: Without dead ends: 933957 [2019-09-10 06:30:40,870 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 06:30:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933957 states. [2019-09-10 06:30:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933957 to 556870. [2019-09-10 06:30:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556870 states. [2019-09-10 06:31:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556870 states to 556870 states and 867122 transitions. [2019-09-10 06:31:02,905 INFO L78 Accepts]: Start accepts. Automaton has 556870 states and 867122 transitions. Word has length 480 [2019-09-10 06:31:02,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:02,906 INFO L475 AbstractCegarLoop]: Abstraction has 556870 states and 867122 transitions. [2019-09-10 06:31:02,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:31:02,906 INFO L276 IsEmpty]: Start isEmpty. Operand 556870 states and 867122 transitions. [2019-09-10 06:31:03,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2019-09-10 06:31:03,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:03,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:31:03,313 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:03,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:03,313 INFO L82 PathProgramCache]: Analyzing trace with hash -319048795, now seen corresponding path program 1 times [2019-09-10 06:31:03,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:03,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:03,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:03,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:03,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:31:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:31:03,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:31:03,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:31:03,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:31:03,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:31:03,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:31:03,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:31:03,782 INFO L87 Difference]: Start difference. First operand 556870 states and 867122 transitions. Second operand 4 states. [2019-09-10 06:31:15,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:31:15,493 INFO L93 Difference]: Finished difference Result 1031518 states and 1601451 transitions. [2019-09-10 06:31:15,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:31:15,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 482 [2019-09-10 06:31:15,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:16,537 INFO L225 Difference]: With dead ends: 1031518 [2019-09-10 06:31:16,537 INFO L226 Difference]: Without dead ends: 1031518 [2019-09-10 06:31:16,537 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 06:31:17,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031518 states. [2019-09-10 06:31:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031518 to 570711. [2019-09-10 06:31:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570711 states. [2019-09-10 06:31:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570711 states to 570711 states and 891755 transitions. [2019-09-10 06:31:35,424 INFO L78 Accepts]: Start accepts. Automaton has 570711 states and 891755 transitions. Word has length 482 [2019-09-10 06:31:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:35,425 INFO L475 AbstractCegarLoop]: Abstraction has 570711 states and 891755 transitions. [2019-09-10 06:31:35,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:31:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 570711 states and 891755 transitions. [2019-09-10 06:31:35,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-10 06:31:35,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:35,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:31:35,886 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:35,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:35,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1103837281, now seen corresponding path program 1 times [2019-09-10 06:31:35,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:35,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:35,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:35,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:35,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:31:36,126 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 06:31:36,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:31:36,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:31:36,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:31:36,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:31:36,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:31:36,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:31:36,128 INFO L87 Difference]: Start difference. First operand 570711 states and 891755 transitions. Second operand 3 states. [2019-09-10 06:31:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:31:40,630 INFO L93 Difference]: Finished difference Result 1022476 states and 1589636 transitions. [2019-09-10 06:31:40,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:31:40,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 487 [2019-09-10 06:31:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:41,777 INFO L225 Difference]: With dead ends: 1022476 [2019-09-10 06:31:41,777 INFO L226 Difference]: Without dead ends: 1022476 [2019-09-10 06:31:41,777 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 06:31:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022476 states. [2019-09-10 06:31:57,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022476 to 584250. [2019-09-10 06:31:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584250 states. [2019-09-10 06:31:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584250 states to 584250 states and 909346 transitions. [2019-09-10 06:31:59,441 INFO L78 Accepts]: Start accepts. Automaton has 584250 states and 909346 transitions. Word has length 487 [2019-09-10 06:31:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:59,441 INFO L475 AbstractCegarLoop]: Abstraction has 584250 states and 909346 transitions. [2019-09-10 06:31:59,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:31:59,441 INFO L276 IsEmpty]: Start isEmpty. Operand 584250 states and 909346 transitions. [2019-09-10 06:31:59,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-10 06:31:59,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:59,974 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:31:59,974 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:59,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:59,974 INFO L82 PathProgramCache]: Analyzing trace with hash -290293404, now seen corresponding path program 1 times [2019-09-10 06:31:59,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:59,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:59,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:59,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:59,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:07,784 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 06:32:07,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:07,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:07,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:07,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:07,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:07,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:07,785 INFO L87 Difference]: Start difference. First operand 584250 states and 909346 transitions. Second operand 3 states. [2019-09-10 06:32:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:10,277 INFO L93 Difference]: Finished difference Result 989327 states and 1521715 transitions. [2019-09-10 06:32:10,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:10,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 487 [2019-09-10 06:32:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:11,296 INFO L225 Difference]: With dead ends: 989327 [2019-09-10 06:32:11,297 INFO L226 Difference]: Without dead ends: 989327 [2019-09-10 06:32:11,297 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 06:32:11,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989327 states. [2019-09-10 06:32:20,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989327 to 591376. [2019-09-10 06:32:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591376 states. [2019-09-10 06:32:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591376 states to 591376 states and 920104 transitions. [2019-09-10 06:32:34,096 INFO L78 Accepts]: Start accepts. Automaton has 591376 states and 920104 transitions. Word has length 487 [2019-09-10 06:32:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:34,096 INFO L475 AbstractCegarLoop]: Abstraction has 591376 states and 920104 transitions. [2019-09-10 06:32:34,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:34,096 INFO L276 IsEmpty]: Start isEmpty. Operand 591376 states and 920104 transitions. [2019-09-10 06:32:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-09-10 06:32:34,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:34,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:32:34,572 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:34,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:34,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1745903148, now seen corresponding path program 1 times [2019-09-10 06:32:34,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:34,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:34,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:34,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:34,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:35,182 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 06:32:35,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:35,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:32:35,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:35,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:32:35,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:32:35,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:32:35,185 INFO L87 Difference]: Start difference. First operand 591376 states and 920104 transitions. Second operand 4 states. [2019-09-10 06:32:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:38,401 INFO L93 Difference]: Finished difference Result 1039749 states and 1611935 transitions. [2019-09-10 06:32:38,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:32:38,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 488 [2019-09-10 06:32:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:39,590 INFO L225 Difference]: With dead ends: 1039749 [2019-09-10 06:32:39,590 INFO L226 Difference]: Without dead ends: 1039749 [2019-09-10 06:32:39,591 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 06:32:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039749 states. [2019-09-10 06:32:56,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039749 to 657409. [2019-09-10 06:32:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657409 states. [2019-09-10 06:32:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657409 states to 657409 states and 1034170 transitions. [2019-09-10 06:32:57,419 INFO L78 Accepts]: Start accepts. Automaton has 657409 states and 1034170 transitions. Word has length 488 [2019-09-10 06:32:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:57,420 INFO L475 AbstractCegarLoop]: Abstraction has 657409 states and 1034170 transitions. [2019-09-10 06:32:57,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:32:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 657409 states and 1034170 transitions. [2019-09-10 06:33:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-09-10 06:33:06,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:06,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:06,955 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:06,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:06,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1815984692, now seen corresponding path program 1 times [2019-09-10 06:33:06,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:06,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:06,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:06,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:06,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:08,176 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 06:33:08,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:08,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:33:08,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:08,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:33:08,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:33:08,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:33:08,180 INFO L87 Difference]: Start difference. First operand 657409 states and 1034170 transitions. Second operand 13 states. [2019-09-10 06:33:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:15,364 INFO L93 Difference]: Finished difference Result 1064175 states and 1646153 transitions. [2019-09-10 06:33:15,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:33:15,365 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 488 [2019-09-10 06:33:15,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:17,442 INFO L225 Difference]: With dead ends: 1064175 [2019-09-10 06:33:17,442 INFO L226 Difference]: Without dead ends: 1064175 [2019-09-10 06:33:17,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:33:17,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064175 states. [2019-09-10 06:33:32,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064175 to 717185. [2019-09-10 06:33:32,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717185 states. [2019-09-10 06:33:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717185 states to 717185 states and 1120314 transitions. [2019-09-10 06:33:35,528 INFO L78 Accepts]: Start accepts. Automaton has 717185 states and 1120314 transitions. Word has length 488 [2019-09-10 06:33:35,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:35,529 INFO L475 AbstractCegarLoop]: Abstraction has 717185 states and 1120314 transitions. [2019-09-10 06:33:35,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:33:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 717185 states and 1120314 transitions. [2019-09-10 06:33:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-09-10 06:33:36,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:36,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:36,153 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:36,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:36,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1369629201, now seen corresponding path program 1 times [2019-09-10 06:33:36,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:36,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:36,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:36,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:36,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:38,649 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 06:33:38,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:38,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:33:38,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:38,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:33:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:33:38,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:33:38,651 INFO L87 Difference]: Start difference. First operand 717185 states and 1120314 transitions. Second operand 4 states. [2019-09-10 06:33:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:54,010 INFO L93 Difference]: Finished difference Result 1407517 states and 2189577 transitions. [2019-09-10 06:33:54,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:33:54,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 488 [2019-09-10 06:33:54,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:56,761 INFO L225 Difference]: With dead ends: 1407517 [2019-09-10 06:33:56,761 INFO L226 Difference]: Without dead ends: 1407517 [2019-09-10 06:33:56,762 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 06:33:57,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407517 states. [2019-09-10 06:34:26,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407517 to 1407487. [2019-09-10 06:34:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1407487 states. [2019-09-10 06:34:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407487 states to 1407487 states and 2189535 transitions. [2019-09-10 06:34:31,230 INFO L78 Accepts]: Start accepts. Automaton has 1407487 states and 2189535 transitions. Word has length 488 [2019-09-10 06:34:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:31,230 INFO L475 AbstractCegarLoop]: Abstraction has 1407487 states and 2189535 transitions. [2019-09-10 06:34:31,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:34:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1407487 states and 2189535 transitions. [2019-09-10 06:34:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-10 06:34:45,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:45,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:34:45,593 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:45,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:45,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1121745067, now seen corresponding path program 1 times [2019-09-10 06:34:45,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:45,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:45,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:45,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:45,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:46,684 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 06:34:46,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:46,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:34:46,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:46,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:34:46,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:34:46,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:34:46,686 INFO L87 Difference]: Start difference. First operand 1407487 states and 2189535 transitions. Second operand 3 states. [2019-09-10 06:35:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:05,385 INFO L93 Difference]: Finished difference Result 2777063 states and 4300111 transitions. [2019-09-10 06:35:05,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:35:05,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-09-10 06:35:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:10,755 INFO L225 Difference]: With dead ends: 2777063 [2019-09-10 06:35:10,755 INFO L226 Difference]: Without dead ends: 2777063 [2019-09-10 06:35:10,756 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 06:35:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777063 states.