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.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:33:41,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:33:41,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:33:41,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:33:41,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:33:41,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:33:41,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:33:41,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:33:41,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:33:41,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:33:41,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:33:41,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:33:41,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:33:41,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:33:41,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:33:41,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:33:41,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:33:41,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:33:41,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:33:41,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:33:41,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:33:41,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:33:41,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:33:41,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:33:41,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:33:41,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:33:41,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:33:41,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:33:41,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:33:41,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:33:41,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:33:41,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:33:41,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:33:41,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:33:41,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:33:41,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:33:41,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:33:41,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:33:41,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:33:41,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:33:41,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:33:41,714 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:33:41,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:33:41,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:33:41,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:33:41,745 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:33:41,746 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:33:41,746 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:33:41,747 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:33:41,747 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:33:41,747 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:33:41,747 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:33:41,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:33:41,750 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:33:41,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:33:41,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:33:41,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:33:41,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:33:41,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:33:41,751 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:33:41,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:33:41,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:33:41,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:33:41,752 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:33:41,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:33:41,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:33:41,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:33:41,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:33:41,754 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:33:41,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:33:41,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:33:41,754 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:33:41,819 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:33:41,832 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:33:41,836 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:33:41,838 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:33:41,838 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:33:41,839 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.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 06:33:41,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84300a41/e905fabcc1e24b769b56a5a567bb5b56/FLAGdb1db7fb9 [2019-09-10 06:33:42,670 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:33:42,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 06:33:42,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84300a41/e905fabcc1e24b769b56a5a567bb5b56/FLAGdb1db7fb9 [2019-09-10 06:33:42,803 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84300a41/e905fabcc1e24b769b56a5a567bb5b56 [2019-09-10 06:33:42,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:33:42,819 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:33:42,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:33:42,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:33:42,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:33:42,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:33:42" (1/1) ... [2019-09-10 06:33:42,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e6d535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:42, skipping insertion in model container [2019-09-10 06:33:42,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:33:42" (1/1) ... [2019-09-10 06:33:42,841 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:33:43,006 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:33:44,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:33:44,351 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:33:45,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:33:45,122 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:33:45,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:45 WrapperNode [2019-09-10 06:33:45,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:33:45,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:33:45,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:33:45,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:33:45,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:45" (1/1) ... [2019-09-10 06:33:45,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:45" (1/1) ... [2019-09-10 06:33:45,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:45" (1/1) ... [2019-09-10 06:33:45,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:45" (1/1) ... [2019-09-10 06:33:45,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:45" (1/1) ... [2019-09-10 06:33:45,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:45" (1/1) ... [2019-09-10 06:33:45,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:45" (1/1) ... [2019-09-10 06:33:45,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:33:45,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:33:45,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:33:45,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:33:45,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:45" (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:33:45,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:33:45,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:33:45,433 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:33:45,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:33:45,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:33:45,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:33:45,434 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:33:45,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:33:45,435 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:33:45,435 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:33:45,435 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:33:45,436 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:33:45,436 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:33:45,437 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:33:45,438 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 06:33:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:33:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:33:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:33:45,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:33:45,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:33:49,746 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:33:49,746 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:33:49,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:33:49 BoogieIcfgContainer [2019-09-10 06:33:49,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:33:49,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:33:49,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:33:49,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:33:49,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:33:42" (1/3) ... [2019-09-10 06:33:49,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf0a5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:33:49, skipping insertion in model container [2019-09-10 06:33:49,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:45" (2/3) ... [2019-09-10 06:33:49,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf0a5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:33:49, skipping insertion in model container [2019-09-10 06:33:49,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:33:49" (3/3) ... [2019-09-10 06:33:49,762 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 06:33:49,772 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:33:49,794 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:33:49,811 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:33:49,840 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:33:49,840 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:33:49,840 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:33:49,840 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:33:49,840 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:33:49,840 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:33:49,840 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:33:49,840 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:33:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states. [2019-09-10 06:33:49,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-10 06:33:49,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:49,923 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] [2019-09-10 06:33:49,925 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:49,932 INFO L82 PathProgramCache]: Analyzing trace with hash 98948253, now seen corresponding path program 1 times [2019-09-10 06:33:49,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:49,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:49,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:49,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:49,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:50,750 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:50,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:50,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:50,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:50,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:50,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:50,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:50,782 INFO L87 Difference]: Start difference. First operand 1439 states. Second operand 3 states. [2019-09-10 06:33:51,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:51,074 INFO L93 Difference]: Finished difference Result 2017 states and 3548 transitions. [2019-09-10 06:33:51,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:51,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 356 [2019-09-10 06:33:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:51,114 INFO L225 Difference]: With dead ends: 2017 [2019-09-10 06:33:51,114 INFO L226 Difference]: Without dead ends: 2009 [2019-09-10 06:33:51,118 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:33:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2019-09-10 06:33:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 2007. [2019-09-10 06:33:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-09-10 06:33:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 3354 transitions. [2019-09-10 06:33:51,278 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 3354 transitions. Word has length 356 [2019-09-10 06:33:51,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:51,285 INFO L475 AbstractCegarLoop]: Abstraction has 2007 states and 3354 transitions. [2019-09-10 06:33:51,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 3354 transitions. [2019-09-10 06:33:51,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-10 06:33:51,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:51,303 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] [2019-09-10 06:33:51,304 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:51,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1245452013, now seen corresponding path program 1 times [2019-09-10 06:33:51,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:51,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:51,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:51,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:51,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:51,760 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:51,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:51,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:51,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:51,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:51,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:51,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:51,769 INFO L87 Difference]: Start difference. First operand 2007 states and 3354 transitions. Second operand 3 states. [2019-09-10 06:33:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:51,914 INFO L93 Difference]: Finished difference Result 3001 states and 4971 transitions. [2019-09-10 06:33:51,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:51,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2019-09-10 06:33:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:51,942 INFO L225 Difference]: With dead ends: 3001 [2019-09-10 06:33:51,943 INFO L226 Difference]: Without dead ends: 3001 [2019-09-10 06:33:51,944 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:33:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2019-09-10 06:33:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2999. [2019-09-10 06:33:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-09-10 06:33:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 4970 transitions. [2019-09-10 06:33:52,068 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 4970 transitions. Word has length 358 [2019-09-10 06:33:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:52,070 INFO L475 AbstractCegarLoop]: Abstraction has 2999 states and 4970 transitions. [2019-09-10 06:33:52,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 4970 transitions. [2019-09-10 06:33:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-10 06:33:52,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:52,086 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] [2019-09-10 06:33:52,087 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:52,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:52,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1357635263, now seen corresponding path program 1 times [2019-09-10 06:33:52,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:52,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:52,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:52,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:52,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:52,655 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:52,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:52,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:52,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:52,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:52,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:52,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:52,658 INFO L87 Difference]: Start difference. First operand 2999 states and 4970 transitions. Second operand 3 states. [2019-09-10 06:33:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:52,797 INFO L93 Difference]: Finished difference Result 4672 states and 7679 transitions. [2019-09-10 06:33:52,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:52,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 360 [2019-09-10 06:33:52,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:52,829 INFO L225 Difference]: With dead ends: 4672 [2019-09-10 06:33:52,830 INFO L226 Difference]: Without dead ends: 4672 [2019-09-10 06:33:52,830 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:33:52,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4672 states. [2019-09-10 06:33:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4672 to 4670. [2019-09-10 06:33:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4670 states. [2019-09-10 06:33:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 7678 transitions. [2019-09-10 06:33:52,956 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 7678 transitions. Word has length 360 [2019-09-10 06:33:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:52,957 INFO L475 AbstractCegarLoop]: Abstraction has 4670 states and 7678 transitions. [2019-09-10 06:33:52,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:52,957 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 7678 transitions. [2019-09-10 06:33:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-09-10 06:33:52,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:52,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] [2019-09-10 06:33:52,974 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:52,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2072817011, now seen corresponding path program 1 times [2019-09-10 06:33:52,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:52,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:52,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:52,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:52,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:53,351 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:53,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:53,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:53,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:53,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:53,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:53,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:53,353 INFO L87 Difference]: Start difference. First operand 4670 states and 7678 transitions. Second operand 3 states. [2019-09-10 06:33:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:53,487 INFO L93 Difference]: Finished difference Result 7379 states and 12029 transitions. [2019-09-10 06:33:53,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:53,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-09-10 06:33:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:53,523 INFO L225 Difference]: With dead ends: 7379 [2019-09-10 06:33:53,523 INFO L226 Difference]: Without dead ends: 7379 [2019-09-10 06:33:53,524 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:33:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7379 states. [2019-09-10 06:33:53,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7379 to 7377. [2019-09-10 06:33:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7377 states. [2019-09-10 06:33:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7377 states to 7377 states and 12028 transitions. [2019-09-10 06:33:53,739 INFO L78 Accepts]: Start accepts. Automaton has 7377 states and 12028 transitions. Word has length 362 [2019-09-10 06:33:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:53,740 INFO L475 AbstractCegarLoop]: Abstraction has 7377 states and 12028 transitions. [2019-09-10 06:33:53,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 7377 states and 12028 transitions. [2019-09-10 06:33:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-10 06:33:53,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:53,755 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] [2019-09-10 06:33:53,756 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:53,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:53,756 INFO L82 PathProgramCache]: Analyzing trace with hash -396934895, now seen corresponding path program 1 times [2019-09-10 06:33:53,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:53,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:53,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:53,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:53,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:54,104 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:54,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:54,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:54,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:54,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:54,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:54,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:54,107 INFO L87 Difference]: Start difference. First operand 7377 states and 12028 transitions. Second operand 3 states. [2019-09-10 06:33:54,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:54,272 INFO L93 Difference]: Finished difference Result 11514 states and 18579 transitions. [2019-09-10 06:33:54,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:54,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364 [2019-09-10 06:33:54,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:54,352 INFO L225 Difference]: With dead ends: 11514 [2019-09-10 06:33:54,352 INFO L226 Difference]: Without dead ends: 11514 [2019-09-10 06:33:54,353 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:33:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11514 states. [2019-09-10 06:33:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11514 to 11512. [2019-09-10 06:33:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11512 states. [2019-09-10 06:33:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11512 states to 11512 states and 18578 transitions. [2019-09-10 06:33:54,816 INFO L78 Accepts]: Start accepts. Automaton has 11512 states and 18578 transitions. Word has length 364 [2019-09-10 06:33:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:54,817 INFO L475 AbstractCegarLoop]: Abstraction has 11512 states and 18578 transitions. [2019-09-10 06:33:54,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:54,817 INFO L276 IsEmpty]: Start isEmpty. Operand 11512 states and 18578 transitions. [2019-09-10 06:33:54,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-10 06:33:54,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:54,857 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] [2019-09-10 06:33:54,857 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash -621120927, now seen corresponding path program 1 times [2019-09-10 06:33:54,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:54,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:54,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:54,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:54,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:55,367 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:55,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:55,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:55,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:55,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:55,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:55,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:55,370 INFO L87 Difference]: Start difference. First operand 11512 states and 18578 transitions. Second operand 3 states. [2019-09-10 06:33:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:55,540 INFO L93 Difference]: Finished difference Result 16283 states and 26427 transitions. [2019-09-10 06:33:55,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:55,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-09-10 06:33:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:55,584 INFO L225 Difference]: With dead ends: 16283 [2019-09-10 06:33:55,584 INFO L226 Difference]: Without dead ends: 16283 [2019-09-10 06:33:55,585 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:33:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16283 states. [2019-09-10 06:33:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16283 to 16281. [2019-09-10 06:33:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16281 states. [2019-09-10 06:33:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16281 states to 16281 states and 26426 transitions. [2019-09-10 06:33:56,102 INFO L78 Accepts]: Start accepts. Automaton has 16281 states and 26426 transitions. Word has length 366 [2019-09-10 06:33:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:56,103 INFO L475 AbstractCegarLoop]: Abstraction has 16281 states and 26426 transitions. [2019-09-10 06:33:56,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 16281 states and 26426 transitions. [2019-09-10 06:33:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-10 06:33:56,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:56,137 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] [2019-09-10 06:33:56,137 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:56,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:56,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1483533551, now seen corresponding path program 1 times [2019-09-10 06:33:56,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:56,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:56,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:56,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:56,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:56,667 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:56,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:56,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:33:56,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:56,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:33:56,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:33:56,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:33:56,670 INFO L87 Difference]: Start difference. First operand 16281 states and 26426 transitions. Second operand 5 states. [2019-09-10 06:33:57,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:57,168 INFO L93 Difference]: Finished difference Result 37489 states and 61725 transitions. [2019-09-10 06:33:57,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:33:57,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 367 [2019-09-10 06:33:57,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:57,295 INFO L225 Difference]: With dead ends: 37489 [2019-09-10 06:33:57,295 INFO L226 Difference]: Without dead ends: 37489 [2019-09-10 06:33:57,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 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:33:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37489 states. [2019-09-10 06:33:58,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37489 to 29290. [2019-09-10 06:33:58,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29290 states. [2019-09-10 06:33:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29290 states to 29290 states and 48050 transitions. [2019-09-10 06:33:58,903 INFO L78 Accepts]: Start accepts. Automaton has 29290 states and 48050 transitions. Word has length 367 [2019-09-10 06:33:58,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:58,904 INFO L475 AbstractCegarLoop]: Abstraction has 29290 states and 48050 transitions. [2019-09-10 06:33:58,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:33:58,904 INFO L276 IsEmpty]: Start isEmpty. Operand 29290 states and 48050 transitions. [2019-09-10 06:33:58,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-10 06:33:58,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:58,933 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] [2019-09-10 06:33:58,933 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:58,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:58,934 INFO L82 PathProgramCache]: Analyzing trace with hash -955060068, now seen corresponding path program 1 times [2019-09-10 06:33:58,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:58,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:58,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:58,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:59,747 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:59,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:59,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:33:59,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:59,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:33:59,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:33:59,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:33:59,750 INFO L87 Difference]: Start difference. First operand 29290 states and 48050 transitions. Second operand 7 states. [2019-09-10 06:34:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:00,645 INFO L93 Difference]: Finished difference Result 49538 states and 81927 transitions. [2019-09-10 06:34:00,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:34:00,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 367 [2019-09-10 06:34:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:00,762 INFO L225 Difference]: With dead ends: 49538 [2019-09-10 06:34:00,762 INFO L226 Difference]: Without dead ends: 49538 [2019-09-10 06:34:00,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:34:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49538 states. [2019-09-10 06:34:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49538 to 32694. [2019-09-10 06:34:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32694 states. [2019-09-10 06:34:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32694 states to 32694 states and 53790 transitions. [2019-09-10 06:34:01,476 INFO L78 Accepts]: Start accepts. Automaton has 32694 states and 53790 transitions. Word has length 367 [2019-09-10 06:34:01,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:01,477 INFO L475 AbstractCegarLoop]: Abstraction has 32694 states and 53790 transitions. [2019-09-10 06:34:01,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:34:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 32694 states and 53790 transitions. [2019-09-10 06:34:01,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-09-10 06:34:01,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:01,505 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] [2019-09-10 06:34:01,505 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:01,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:01,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1290729985, now seen corresponding path program 1 times [2019-09-10 06:34:01,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:01,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:01,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:01,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:01,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:02,049 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:02,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:02,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:34:02,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:02,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:34:02,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:34:02,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:34:02,052 INFO L87 Difference]: Start difference. First operand 32694 states and 53790 transitions. Second operand 3 states. [2019-09-10 06:34:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:02,197 INFO L93 Difference]: Finished difference Result 28371 states and 46859 transitions. [2019-09-10 06:34:02,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:34:02,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 368 [2019-09-10 06:34:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:02,273 INFO L225 Difference]: With dead ends: 28371 [2019-09-10 06:34:02,273 INFO L226 Difference]: Without dead ends: 28371 [2019-09-10 06:34:02,274 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:34:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28371 states. [2019-09-10 06:34:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28371 to 28369. [2019-09-10 06:34:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28369 states. [2019-09-10 06:34:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28369 states to 28369 states and 46858 transitions. [2019-09-10 06:34:03,264 INFO L78 Accepts]: Start accepts. Automaton has 28369 states and 46858 transitions. Word has length 368 [2019-09-10 06:34:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:03,265 INFO L475 AbstractCegarLoop]: Abstraction has 28369 states and 46858 transitions. [2019-09-10 06:34:03,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:34:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 28369 states and 46858 transitions. [2019-09-10 06:34:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 06:34:03,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:03,283 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] [2019-09-10 06:34:03,283 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:03,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:03,284 INFO L82 PathProgramCache]: Analyzing trace with hash -940171741, now seen corresponding path program 1 times [2019-09-10 06:34:03,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:03,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:03,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:03,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:03,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:04,138 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:04,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:04,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:34:04,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:04,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:34:04,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:34:04,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:34:04,140 INFO L87 Difference]: Start difference. First operand 28369 states and 46858 transitions. Second operand 7 states. [2019-09-10 06:34:04,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:04,810 INFO L93 Difference]: Finished difference Result 86362 states and 143375 transitions. [2019-09-10 06:34:04,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:34:04,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2019-09-10 06:34:04,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:05,044 INFO L225 Difference]: With dead ends: 86362 [2019-09-10 06:34:05,044 INFO L226 Difference]: Without dead ends: 86362 [2019-09-10 06:34:05,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:34:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86362 states. [2019-09-10 06:34:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86362 to 35390. [2019-09-10 06:34:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35390 states. [2019-09-10 06:34:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35390 states to 35390 states and 58634 transitions. [2019-09-10 06:34:06,216 INFO L78 Accepts]: Start accepts. Automaton has 35390 states and 58634 transitions. Word has length 372 [2019-09-10 06:34:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:06,217 INFO L475 AbstractCegarLoop]: Abstraction has 35390 states and 58634 transitions. [2019-09-10 06:34:06,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:34:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 35390 states and 58634 transitions. [2019-09-10 06:34:06,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 06:34:06,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:06,233 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] [2019-09-10 06:34:06,234 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:06,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:06,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1636538100, now seen corresponding path program 1 times [2019-09-10 06:34:06,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:06,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:06,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:06,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:06,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:06,644 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:06,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:06,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:34:06,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:06,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:34:06,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:34:06,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:34:06,646 INFO L87 Difference]: Start difference. First operand 35390 states and 58634 transitions. Second operand 5 states. [2019-09-10 06:34:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:07,001 INFO L93 Difference]: Finished difference Result 102590 states and 169881 transitions. [2019-09-10 06:34:07,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:34:07,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 372 [2019-09-10 06:34:07,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:07,126 INFO L225 Difference]: With dead ends: 102590 [2019-09-10 06:34:07,126 INFO L226 Difference]: Without dead ends: 102590 [2019-09-10 06:34:07,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 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:34:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102590 states. [2019-09-10 06:34:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102590 to 75821. [2019-09-10 06:34:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75821 states. [2019-09-10 06:34:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75821 states to 75821 states and 125344 transitions. [2019-09-10 06:34:09,317 INFO L78 Accepts]: Start accepts. Automaton has 75821 states and 125344 transitions. Word has length 372 [2019-09-10 06:34:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:09,317 INFO L475 AbstractCegarLoop]: Abstraction has 75821 states and 125344 transitions. [2019-09-10 06:34:09,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:34:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 75821 states and 125344 transitions. [2019-09-10 06:34:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 06:34:09,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:09,330 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,331 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:09,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:09,331 INFO L82 PathProgramCache]: Analyzing trace with hash -176117635, now seen corresponding path program 1 times [2019-09-10 06:34:09,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:09,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:09,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:09,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:09,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:10,029 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:10,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:10,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:34:10,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:10,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:34:10,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:34:10,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:34:10,031 INFO L87 Difference]: Start difference. First operand 75821 states and 125344 transitions. Second operand 7 states. [2019-09-10 06:34:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:11,004 INFO L93 Difference]: Finished difference Result 208759 states and 345507 transitions. [2019-09-10 06:34:11,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:34:11,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2019-09-10 06:34:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:11,324 INFO L225 Difference]: With dead ends: 208759 [2019-09-10 06:34:11,324 INFO L226 Difference]: Without dead ends: 208759 [2019-09-10 06:34:11,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:34:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208759 states. [2019-09-10 06:34:14,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208759 to 79311. [2019-09-10 06:34:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79311 states. [2019-09-10 06:34:15,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79311 states to 79311 states and 131168 transitions. [2019-09-10 06:34:15,007 INFO L78 Accepts]: Start accepts. Automaton has 79311 states and 131168 transitions. Word has length 372 [2019-09-10 06:34:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:15,008 INFO L475 AbstractCegarLoop]: Abstraction has 79311 states and 131168 transitions. [2019-09-10 06:34:15,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:34:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 79311 states and 131168 transitions. [2019-09-10 06:34:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 06:34:15,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:15,021 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] [2019-09-10 06:34:15,021 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:15,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:15,022 INFO L82 PathProgramCache]: Analyzing trace with hash -843485712, now seen corresponding path program 1 times [2019-09-10 06:34:15,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:15,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:15,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:15,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:15,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:15,685 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:15,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:15,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:34:15,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:15,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:34:15,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:34:15,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:34:15,688 INFO L87 Difference]: Start difference. First operand 79311 states and 131168 transitions. Second operand 7 states. [2019-09-10 06:34:16,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:16,865 INFO L93 Difference]: Finished difference Result 212525 states and 351799 transitions. [2019-09-10 06:34:16,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:34:16,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2019-09-10 06:34:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:17,139 INFO L225 Difference]: With dead ends: 212525 [2019-09-10 06:34:17,139 INFO L226 Difference]: Without dead ends: 212525 [2019-09-10 06:34:17,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:34:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212525 states. [2019-09-10 06:34:21,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212525 to 82801. [2019-09-10 06:34:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82801 states. [2019-09-10 06:34:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82801 states to 82801 states and 136992 transitions. [2019-09-10 06:34:21,518 INFO L78 Accepts]: Start accepts. Automaton has 82801 states and 136992 transitions. Word has length 372 [2019-09-10 06:34:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:21,519 INFO L475 AbstractCegarLoop]: Abstraction has 82801 states and 136992 transitions. [2019-09-10 06:34:21,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:34:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 82801 states and 136992 transitions. [2019-09-10 06:34:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 06:34:21,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:21,527 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] [2019-09-10 06:34:21,528 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash -359798506, now seen corresponding path program 1 times [2019-09-10 06:34:21,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:21,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:21,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:21,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:21,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:22,079 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:22,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:22,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:34:22,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:22,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:34:22,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:34:22,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:34:22,081 INFO L87 Difference]: Start difference. First operand 82801 states and 136992 transitions. Second operand 7 states. [2019-09-10 06:34:23,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:23,061 INFO L93 Difference]: Finished difference Result 238769 states and 395359 transitions. [2019-09-10 06:34:23,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:34:23,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2019-09-10 06:34:23,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:23,460 INFO L225 Difference]: With dead ends: 238769 [2019-09-10 06:34:23,460 INFO L226 Difference]: Without dead ends: 238769 [2019-09-10 06:34:23,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:34:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238769 states. [2019-09-10 06:34:25,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238769 to 89595. [2019-09-10 06:34:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89595 states. [2019-09-10 06:34:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89595 states to 89595 states and 148256 transitions. [2019-09-10 06:34:25,703 INFO L78 Accepts]: Start accepts. Automaton has 89595 states and 148256 transitions. Word has length 372 [2019-09-10 06:34:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:25,703 INFO L475 AbstractCegarLoop]: Abstraction has 89595 states and 148256 transitions. [2019-09-10 06:34:25,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:34:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 89595 states and 148256 transitions. [2019-09-10 06:34:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-10 06:34:25,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:25,713 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] [2019-09-10 06:34:25,714 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:25,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:25,714 INFO L82 PathProgramCache]: Analyzing trace with hash 79488306, now seen corresponding path program 1 times [2019-09-10 06:34:25,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:25,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:25,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:25,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:25,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:26,077 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:26,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:26,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:34:26,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:26,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:34:26,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:34:26,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:34:26,079 INFO L87 Difference]: Start difference. First operand 89595 states and 148256 transitions. Second operand 5 states. [2019-09-10 06:34:27,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:27,237 INFO L93 Difference]: Finished difference Result 282505 states and 466823 transitions. [2019-09-10 06:34:27,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:34:27,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 373 [2019-09-10 06:34:27,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:27,806 INFO L225 Difference]: With dead ends: 282505 [2019-09-10 06:34:27,807 INFO L226 Difference]: Without dead ends: 282505 [2019-09-10 06:34:27,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 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:34:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282505 states. [2019-09-10 06:34:30,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282505 to 202478. [2019-09-10 06:34:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202478 states. [2019-09-10 06:34:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202478 states to 202478 states and 334260 transitions. [2019-09-10 06:34:31,033 INFO L78 Accepts]: Start accepts. Automaton has 202478 states and 334260 transitions. Word has length 373 [2019-09-10 06:34:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:31,034 INFO L475 AbstractCegarLoop]: Abstraction has 202478 states and 334260 transitions. [2019-09-10 06:34:31,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:34:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 202478 states and 334260 transitions. [2019-09-10 06:34:31,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-10 06:34:31,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:31,047 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] [2019-09-10 06:34:31,047 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:31,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:31,048 INFO L82 PathProgramCache]: Analyzing trace with hash 994594010, now seen corresponding path program 1 times [2019-09-10 06:34:31,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:31,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:31,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:31,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:31,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:34,897 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:34,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:34,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:34:34,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:34,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:34:34,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:34:34,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:34:34,903 INFO L87 Difference]: Start difference. First operand 202478 states and 334260 transitions. Second operand 7 states. [2019-09-10 06:34:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:37,152 INFO L93 Difference]: Finished difference Result 644553 states and 1063121 transitions. [2019-09-10 06:34:37,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:34:37,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 373 [2019-09-10 06:34:37,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:38,248 INFO L225 Difference]: With dead ends: 644553 [2019-09-10 06:34:38,248 INFO L226 Difference]: Without dead ends: 644553 [2019-09-10 06:34:38,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:34:38,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644553 states. [2019-09-10 06:34:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644553 to 642042. [2019-09-10 06:34:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642042 states. [2019-09-10 06:35:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642042 states to 642042 states and 1058650 transitions. [2019-09-10 06:35:01,763 INFO L78 Accepts]: Start accepts. Automaton has 642042 states and 1058650 transitions. Word has length 373 [2019-09-10 06:35:01,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:01,764 INFO L475 AbstractCegarLoop]: Abstraction has 642042 states and 1058650 transitions. [2019-09-10 06:35:01,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:35:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 642042 states and 1058650 transitions. [2019-09-10 06:35:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-10 06:35:01,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:01,782 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] [2019-09-10 06:35:01,782 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:01,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:01,783 INFO L82 PathProgramCache]: Analyzing trace with hash -963672142, now seen corresponding path program 1 times [2019-09-10 06:35:01,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:01,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:01,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:01,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:01,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:03,053 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:35:03,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:03,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:35:03,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:03,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:35:03,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:35:03,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:35:03,055 INFO L87 Difference]: Start difference. First operand 642042 states and 1058650 transitions. Second operand 8 states. [2019-09-10 06:35:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:45,628 INFO L93 Difference]: Finished difference Result 4019555 states and 6590748 transitions. [2019-09-10 06:35:45,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:35:45,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 373 [2019-09-10 06:35:45,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:10,236 INFO L225 Difference]: With dead ends: 4019555 [2019-09-10 06:36:10,236 INFO L226 Difference]: Without dead ends: 4019555 [2019-09-10 06:36:10,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:36:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019555 states.