java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:06:49,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:06:49,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:06:49,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:06:49,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:06:49,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:06:49,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:06:49,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:06:49,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:06:49,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:06:49,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:06:49,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:06:49,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:06:49,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:06:49,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:06:49,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:06:49,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:06:49,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:06:49,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:06:49,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:06:49,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:06:49,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:06:49,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:06:49,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:06:49,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:06:49,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:06:49,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:06:49,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:06:49,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:06:49,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:06:49,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:06:49,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:06:49,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:06:49,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:06:49,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:06:49,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:06:49,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:06:49,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:06:49,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:06:49,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:06:49,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:06:49,088 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 09:06:49,116 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:06:49,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:06:49,117 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:06:49,119 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:06:49,120 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:06:49,120 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:06:49,120 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:06:49,120 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:06:49,121 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:06:49,121 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:06:49,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:06:49,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:06:49,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:06:49,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:06:49,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:06:49,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:06:49,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:06:49,124 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:06:49,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:06:49,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:06:49,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:06:49,126 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:06:49,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:06:49,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:06:49,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:06:49,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:06:49,127 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:06:49,127 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:06:49,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:06:49,128 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:06:49,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:06:49,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:06:49,196 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:06:49,198 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:06:49,198 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:06:49,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 09:06:49,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb2281fc/5db3c58cc84f4767afcaa9724ebaab2d/FLAGdb2d8f9da [2019-09-10 09:06:49,967 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:06:49,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 09:06:49,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb2281fc/5db3c58cc84f4767afcaa9724ebaab2d/FLAGdb2d8f9da [2019-09-10 09:06:50,146 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb2281fc/5db3c58cc84f4767afcaa9724ebaab2d [2019-09-10 09:06:50,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:06:50,158 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:06:50,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:06:50,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:06:50,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:06:50,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:06:50" (1/1) ... [2019-09-10 09:06:50,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f15d144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:50, skipping insertion in model container [2019-09-10 09:06:50,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:06:50" (1/1) ... [2019-09-10 09:06:50,175 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:06:50,282 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:06:51,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:06:51,287 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:06:51,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:06:51,709 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:06:51,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:51 WrapperNode [2019-09-10 09:06:51,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:06:51,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:06:51,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:06:51,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:06:51,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:51" (1/1) ... [2019-09-10 09:06:51,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:51" (1/1) ... [2019-09-10 09:06:51,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:51" (1/1) ... [2019-09-10 09:06:51,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:51" (1/1) ... [2019-09-10 09:06:51,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:51" (1/1) ... [2019-09-10 09:06:51,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:51" (1/1) ... [2019-09-10 09:06:51,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:51" (1/1) ... [2019-09-10 09:06:51,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:06:51,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:06:51,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:06:51,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:06:51,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:51" (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 09:06:51,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:06:51,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:06:51,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:06:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:06:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:06:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:06:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:06:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:06:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:06:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:06:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:06:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:06:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:06:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:06:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:06:51,996 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:06:51,996 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:06:51,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:06:51,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:06:51,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:06:54,695 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:06:54,696 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:06:54,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:06:54 BoogieIcfgContainer [2019-09-10 09:06:54,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:06:54,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:06:54,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:06:54,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:06:54,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:06:50" (1/3) ... [2019-09-10 09:06:54,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83c4f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:06:54, skipping insertion in model container [2019-09-10 09:06:54,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:51" (2/3) ... [2019-09-10 09:06:54,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83c4f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:06:54, skipping insertion in model container [2019-09-10 09:06:54,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:06:54" (3/3) ... [2019-09-10 09:06:54,709 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 09:06:54,720 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:06:54,742 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:06:54,759 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:06:54,785 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:06:54,786 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:06:54,786 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:06:54,786 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:06:54,786 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:06:54,786 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:06:54,787 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:06:54,787 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:06:54,827 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2019-09-10 09:06:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 09:06:54,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:54,861 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] [2019-09-10 09:06:54,863 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:54,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1832108402, now seen corresponding path program 1 times [2019-09-10 09:06:54,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:54,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:54,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:54,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:54,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:55,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:55,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:55,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:55,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:55,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:55,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:55,735 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2019-09-10 09:06:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:55,901 INFO L93 Difference]: Finished difference Result 984 states and 1761 transitions. [2019-09-10 09:06:55,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:55,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-10 09:06:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:55,954 INFO L225 Difference]: With dead ends: 984 [2019-09-10 09:06:55,954 INFO L226 Difference]: Without dead ends: 976 [2019-09-10 09:06:55,959 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 09:06:56,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-10 09:06:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 974. [2019-09-10 09:06:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-10 09:06:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1686 transitions. [2019-09-10 09:06:56,172 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1686 transitions. Word has length 217 [2019-09-10 09:06:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:56,173 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1686 transitions. [2019-09-10 09:06:56,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1686 transitions. [2019-09-10 09:06:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-10 09:06:56,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:56,181 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:56,182 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:56,183 INFO L82 PathProgramCache]: Analyzing trace with hash 475136375, now seen corresponding path program 1 times [2019-09-10 09:06:56,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:56,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:56,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:56,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:56,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:56,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:56,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:56,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:56,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:56,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:56,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:56,531 INFO L87 Difference]: Start difference. First operand 974 states and 1686 transitions. Second operand 3 states. [2019-09-10 09:06:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:56,596 INFO L93 Difference]: Finished difference Result 1372 states and 2354 transitions. [2019-09-10 09:06:56,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:56,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-09-10 09:06:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:56,620 INFO L225 Difference]: With dead ends: 1372 [2019-09-10 09:06:56,620 INFO L226 Difference]: Without dead ends: 1372 [2019-09-10 09:06:56,622 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 09:06:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-09-10 09:06:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1370. [2019-09-10 09:06:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2019-09-10 09:06:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2353 transitions. [2019-09-10 09:06:56,723 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2353 transitions. Word has length 221 [2019-09-10 09:06:56,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:56,726 INFO L475 AbstractCegarLoop]: Abstraction has 1370 states and 2353 transitions. [2019-09-10 09:06:56,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2353 transitions. [2019-09-10 09:06:56,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 09:06:56,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:56,741 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:56,742 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:56,744 INFO L82 PathProgramCache]: Analyzing trace with hash 172719100, now seen corresponding path program 1 times [2019-09-10 09:06:56,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:56,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:56,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:56,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:56,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:57,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:57,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:57,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:57,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:57,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:57,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:57,153 INFO L87 Difference]: Start difference. First operand 1370 states and 2353 transitions. Second operand 3 states. [2019-09-10 09:06:57,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:57,237 INFO L93 Difference]: Finished difference Result 2140 states and 3642 transitions. [2019-09-10 09:06:57,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:57,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-10 09:06:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:57,267 INFO L225 Difference]: With dead ends: 2140 [2019-09-10 09:06:57,268 INFO L226 Difference]: Without dead ends: 2140 [2019-09-10 09:06:57,268 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 09:06:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-09-10 09:06:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2138. [2019-09-10 09:06:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-09-10 09:06:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3641 transitions. [2019-09-10 09:06:57,418 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3641 transitions. Word has length 225 [2019-09-10 09:06:57,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:57,419 INFO L475 AbstractCegarLoop]: Abstraction has 2138 states and 3641 transitions. [2019-09-10 09:06:57,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3641 transitions. [2019-09-10 09:06:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 09:06:57,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:57,427 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] [2019-09-10 09:06:57,427 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:57,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:57,428 INFO L82 PathProgramCache]: Analyzing trace with hash 300878849, now seen corresponding path program 1 times [2019-09-10 09:06:57,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:57,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:57,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:57,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:57,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:57,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:57,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:57,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:57,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:57,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:57,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:57,660 INFO L87 Difference]: Start difference. First operand 2138 states and 3641 transitions. Second operand 3 states. [2019-09-10 09:06:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:57,725 INFO L93 Difference]: Finished difference Result 3628 states and 6126 transitions. [2019-09-10 09:06:57,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:57,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-10 09:06:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:57,745 INFO L225 Difference]: With dead ends: 3628 [2019-09-10 09:06:57,745 INFO L226 Difference]: Without dead ends: 3628 [2019-09-10 09:06:57,746 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 09:06:57,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2019-09-10 09:06:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 3626. [2019-09-10 09:06:57,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3626 states. [2019-09-10 09:06:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 6125 transitions. [2019-09-10 09:06:57,851 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 6125 transitions. Word has length 229 [2019-09-10 09:06:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:57,851 INFO L475 AbstractCegarLoop]: Abstraction has 3626 states and 6125 transitions. [2019-09-10 09:06:57,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 6125 transitions. [2019-09-10 09:06:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-10 09:06:57,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:57,859 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] [2019-09-10 09:06:57,859 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:57,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:57,860 INFO L82 PathProgramCache]: Analyzing trace with hash 7408774, now seen corresponding path program 1 times [2019-09-10 09:06:57,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:57,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:57,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:57,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:57,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:58,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:58,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:58,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:58,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:58,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:58,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:58,143 INFO L87 Difference]: Start difference. First operand 3626 states and 6125 transitions. Second operand 3 states. [2019-09-10 09:06:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:58,232 INFO L93 Difference]: Finished difference Result 6508 states and 10910 transitions. [2019-09-10 09:06:58,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:58,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-10 09:06:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:58,264 INFO L225 Difference]: With dead ends: 6508 [2019-09-10 09:06:58,265 INFO L226 Difference]: Without dead ends: 6508 [2019-09-10 09:06:58,265 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 09:06:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2019-09-10 09:06:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6506. [2019-09-10 09:06:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2019-09-10 09:06:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 10909 transitions. [2019-09-10 09:06:58,417 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 10909 transitions. Word has length 233 [2019-09-10 09:06:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:58,417 INFO L475 AbstractCegarLoop]: Abstraction has 6506 states and 10909 transitions. [2019-09-10 09:06:58,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 10909 transitions. [2019-09-10 09:06:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 09:06:58,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:58,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:58,426 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:58,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:58,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1561634677, now seen corresponding path program 1 times [2019-09-10 09:06:58,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:58,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:58,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:58,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:58,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:58,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:58,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:06:58,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:58,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:06:58,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:06:58,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:06:58,978 INFO L87 Difference]: Start difference. First operand 6506 states and 10909 transitions. Second operand 7 states. [2019-09-10 09:07:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:00,133 INFO L93 Difference]: Finished difference Result 33759 states and 56628 transitions. [2019-09-10 09:07:00,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 09:07:00,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 237 [2019-09-10 09:07:00,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:00,238 INFO L225 Difference]: With dead ends: 33759 [2019-09-10 09:07:00,238 INFO L226 Difference]: Without dead ends: 33759 [2019-09-10 09:07:00,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-10 09:07:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33759 states. [2019-09-10 09:07:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33759 to 12303. [2019-09-10 09:07:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12303 states. [2019-09-10 09:07:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12303 states to 12303 states and 20548 transitions. [2019-09-10 09:07:00,630 INFO L78 Accepts]: Start accepts. Automaton has 12303 states and 20548 transitions. Word has length 237 [2019-09-10 09:07:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:00,631 INFO L475 AbstractCegarLoop]: Abstraction has 12303 states and 20548 transitions. [2019-09-10 09:07:00,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:07:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 12303 states and 20548 transitions. [2019-09-10 09:07:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 09:07:00,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:00,642 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:00,642 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:00,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1236760728, now seen corresponding path program 1 times [2019-09-10 09:07:00,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:00,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:00,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:00,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:00,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:00,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:00,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:07:00,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:00,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:07:00,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:07:00,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:07:00,917 INFO L87 Difference]: Start difference. First operand 12303 states and 20548 transitions. Second operand 4 states. [2019-09-10 09:07:01,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:01,104 INFO L93 Difference]: Finished difference Result 21233 states and 35544 transitions. [2019-09-10 09:07:01,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:07:01,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-10 09:07:01,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:01,151 INFO L225 Difference]: With dead ends: 21233 [2019-09-10 09:07:01,152 INFO L226 Difference]: Without dead ends: 21233 [2019-09-10 09:07:01,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:07:01,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21233 states. [2019-09-10 09:07:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21233 to 18279. [2019-09-10 09:07:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18279 states. [2019-09-10 09:07:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18279 states to 18279 states and 30544 transitions. [2019-09-10 09:07:01,456 INFO L78 Accepts]: Start accepts. Automaton has 18279 states and 30544 transitions. Word has length 238 [2019-09-10 09:07:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:01,457 INFO L475 AbstractCegarLoop]: Abstraction has 18279 states and 30544 transitions. [2019-09-10 09:07:01,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:07:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 18279 states and 30544 transitions. [2019-09-10 09:07:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:07:01,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:01,470 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:01,471 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1598097195, now seen corresponding path program 1 times [2019-09-10 09:07:01,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:01,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:01,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:01,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:01,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:01,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:01,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:01,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:01,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:01,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:01,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:01,679 INFO L87 Difference]: Start difference. First operand 18279 states and 30544 transitions. Second operand 3 states. [2019-09-10 09:07:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:01,802 INFO L93 Difference]: Finished difference Result 28072 states and 46878 transitions. [2019-09-10 09:07:01,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:01,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:07:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:01,866 INFO L225 Difference]: With dead ends: 28072 [2019-09-10 09:07:01,866 INFO L226 Difference]: Without dead ends: 28072 [2019-09-10 09:07:01,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28072 states. [2019-09-10 09:07:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28072 to 28070. [2019-09-10 09:07:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28070 states. [2019-09-10 09:07:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28070 states to 28070 states and 46877 transitions. [2019-09-10 09:07:02,914 INFO L78 Accepts]: Start accepts. Automaton has 28070 states and 46877 transitions. Word has length 239 [2019-09-10 09:07:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:02,915 INFO L475 AbstractCegarLoop]: Abstraction has 28070 states and 46877 transitions. [2019-09-10 09:07:02,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 28070 states and 46877 transitions. [2019-09-10 09:07:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:07:02,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:02,922 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:02,922 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:02,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:02,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1621339669, now seen corresponding path program 1 times [2019-09-10 09:07:02,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:02,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:02,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:02,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:02,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:03,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:03,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:03,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:03,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:03,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:03,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:03,104 INFO L87 Difference]: Start difference. First operand 28070 states and 46877 transitions. Second operand 3 states. [2019-09-10 09:07:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:03,252 INFO L93 Difference]: Finished difference Result 39524 states and 65882 transitions. [2019-09-10 09:07:03,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:03,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:07:03,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:03,338 INFO L225 Difference]: With dead ends: 39524 [2019-09-10 09:07:03,339 INFO L226 Difference]: Without dead ends: 39524 [2019-09-10 09:07:03,339 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 09:07:03,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39524 states. [2019-09-10 09:07:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39524 to 39522. [2019-09-10 09:07:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39522 states. [2019-09-10 09:07:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39522 states to 39522 states and 65881 transitions. [2019-09-10 09:07:04,040 INFO L78 Accepts]: Start accepts. Automaton has 39522 states and 65881 transitions. Word has length 239 [2019-09-10 09:07:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:04,041 INFO L475 AbstractCegarLoop]: Abstraction has 39522 states and 65881 transitions. [2019-09-10 09:07:04,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 39522 states and 65881 transitions. [2019-09-10 09:07:04,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:07:04,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:04,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] [2019-09-10 09:07:04,047 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:04,048 INFO L82 PathProgramCache]: Analyzing trace with hash -839265151, now seen corresponding path program 1 times [2019-09-10 09:07:04,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:04,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:04,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:04,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:04,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:04,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:04,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:04,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:04,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:04,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:04,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:04,241 INFO L87 Difference]: Start difference. First operand 39522 states and 65881 transitions. Second operand 3 states. [2019-09-10 09:07:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:04,465 INFO L93 Difference]: Finished difference Result 55408 states and 92186 transitions. [2019-09-10 09:07:04,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:04,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:07:04,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:04,557 INFO L225 Difference]: With dead ends: 55408 [2019-09-10 09:07:04,557 INFO L226 Difference]: Without dead ends: 55408 [2019-09-10 09:07:04,558 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 09:07:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55408 states. [2019-09-10 09:07:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55408 to 55406. [2019-09-10 09:07:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55406 states. [2019-09-10 09:07:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55406 states to 55406 states and 92185 transitions. [2019-09-10 09:07:06,721 INFO L78 Accepts]: Start accepts. Automaton has 55406 states and 92185 transitions. Word has length 239 [2019-09-10 09:07:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:06,722 INFO L475 AbstractCegarLoop]: Abstraction has 55406 states and 92185 transitions. [2019-09-10 09:07:06,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 55406 states and 92185 transitions. [2019-09-10 09:07:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:07:06,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:06,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:06,728 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:06,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:06,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1472495767, now seen corresponding path program 1 times [2019-09-10 09:07:06,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:06,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:06,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:06,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:06,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:06,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:06,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:06,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:06,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:06,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:06,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:06,911 INFO L87 Difference]: Start difference. First operand 55406 states and 92185 transitions. Second operand 3 states. [2019-09-10 09:07:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:07,150 INFO L93 Difference]: Finished difference Result 77300 states and 128350 transitions. [2019-09-10 09:07:07,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:07,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:07:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:07,260 INFO L225 Difference]: With dead ends: 77300 [2019-09-10 09:07:07,260 INFO L226 Difference]: Without dead ends: 77300 [2019-09-10 09:07:07,261 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 09:07:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77300 states. [2019-09-10 09:07:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77300 to 77298. [2019-09-10 09:07:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77298 states. [2019-09-10 09:07:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77298 states to 77298 states and 128349 transitions. [2019-09-10 09:07:08,195 INFO L78 Accepts]: Start accepts. Automaton has 77298 states and 128349 transitions. Word has length 239 [2019-09-10 09:07:08,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:08,195 INFO L475 AbstractCegarLoop]: Abstraction has 77298 states and 128349 transitions. [2019-09-10 09:07:08,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 77298 states and 128349 transitions. [2019-09-10 09:07:08,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:07:08,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:08,198 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:08,198 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:08,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:08,199 INFO L82 PathProgramCache]: Analyzing trace with hash 141121069, now seen corresponding path program 1 times [2019-09-10 09:07:08,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:08,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:08,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:08,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:08,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:08,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:08,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:08,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:08,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:08,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:08,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:08,390 INFO L87 Difference]: Start difference. First operand 77298 states and 128349 transitions. Second operand 3 states. [2019-09-10 09:07:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:08,778 INFO L93 Difference]: Finished difference Result 107244 states and 177669 transitions. [2019-09-10 09:07:08,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:08,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:07:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:08,939 INFO L225 Difference]: With dead ends: 107244 [2019-09-10 09:07:08,939 INFO L226 Difference]: Without dead ends: 107244 [2019-09-10 09:07:08,939 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 09:07:09,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107244 states. [2019-09-10 09:07:11,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107244 to 107242. [2019-09-10 09:07:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107242 states. [2019-09-10 09:07:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107242 states to 107242 states and 177668 transitions. [2019-09-10 09:07:11,685 INFO L78 Accepts]: Start accepts. Automaton has 107242 states and 177668 transitions. Word has length 239 [2019-09-10 09:07:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:11,686 INFO L475 AbstractCegarLoop]: Abstraction has 107242 states and 177668 transitions. [2019-09-10 09:07:11,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:11,686 INFO L276 IsEmpty]: Start isEmpty. Operand 107242 states and 177668 transitions. [2019-09-10 09:07:11,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:07:11,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:11,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:11,688 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:11,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:11,688 INFO L82 PathProgramCache]: Analyzing trace with hash 248955122, now seen corresponding path program 1 times [2019-09-10 09:07:11,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:11,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:11,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:11,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:11,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:11,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 09:07:11,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:11,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:07:11,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:11,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:07:11,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:07:11,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:07:11,899 INFO L87 Difference]: Start difference. First operand 107242 states and 177668 transitions. Second operand 4 states. [2019-09-10 09:07:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:12,470 INFO L93 Difference]: Finished difference Result 210652 states and 348835 transitions. [2019-09-10 09:07:12,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:07:12,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-10 09:07:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:15,373 INFO L225 Difference]: With dead ends: 210652 [2019-09-10 09:07:15,374 INFO L226 Difference]: Without dead ends: 210652 [2019-09-10 09:07:15,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:07:15,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210652 states. [2019-09-10 09:07:16,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210652 to 176201. [2019-09-10 09:07:16,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176201 states. [2019-09-10 09:07:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176201 states to 176201 states and 291287 transitions. [2019-09-10 09:07:17,163 INFO L78 Accepts]: Start accepts. Automaton has 176201 states and 291287 transitions. Word has length 239 [2019-09-10 09:07:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:17,164 INFO L475 AbstractCegarLoop]: Abstraction has 176201 states and 291287 transitions. [2019-09-10 09:07:17,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:07:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 176201 states and 291287 transitions. [2019-09-10 09:07:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 09:07:17,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:17,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:17,166 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:17,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:17,167 INFO L82 PathProgramCache]: Analyzing trace with hash -933935761, now seen corresponding path program 1 times [2019-09-10 09:07:17,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:17,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:17,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:17,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:17,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:17,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:17,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:17,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:07:17,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:17,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:07:17,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:07:17,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:07:17,472 INFO L87 Difference]: Start difference. First operand 176201 states and 291287 transitions. Second operand 4 states. [2019-09-10 09:07:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:18,305 INFO L93 Difference]: Finished difference Result 347397 states and 574048 transitions. [2019-09-10 09:07:18,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:07:18,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 09:07:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:22,742 INFO L225 Difference]: With dead ends: 347397 [2019-09-10 09:07:22,743 INFO L226 Difference]: Without dead ends: 347397 [2019-09-10 09:07:22,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:07:22,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347397 states. [2019-09-10 09:07:25,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347397 to 289052. [2019-09-10 09:07:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289052 states. [2019-09-10 09:07:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289052 states to 289052 states and 476834 transitions. [2019-09-10 09:07:26,479 INFO L78 Accepts]: Start accepts. Automaton has 289052 states and 476834 transitions. Word has length 240 [2019-09-10 09:07:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:26,480 INFO L475 AbstractCegarLoop]: Abstraction has 289052 states and 476834 transitions. [2019-09-10 09:07:26,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:07:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 289052 states and 476834 transitions. [2019-09-10 09:07:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 09:07:26,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:26,483 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] [2019-09-10 09:07:26,483 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:26,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:26,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1055710553, now seen corresponding path program 1 times [2019-09-10 09:07:26,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:26,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:26,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:26,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:26,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:26,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:26,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:07:26,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:26,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:07:26,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:07:26,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:07:26,684 INFO L87 Difference]: Start difference. First operand 289052 states and 476834 transitions. Second operand 4 states. [2019-09-10 09:07:33,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:33,779 INFO L93 Difference]: Finished difference Result 561498 states and 926029 transitions. [2019-09-10 09:07:33,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:07:33,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-09-10 09:07:33,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:34,594 INFO L225 Difference]: With dead ends: 561498 [2019-09-10 09:07:34,594 INFO L226 Difference]: Without dead ends: 561498 [2019-09-10 09:07:34,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:07:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561498 states. [2019-09-10 09:07:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561498 to 472375. [2019-09-10 09:07:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472375 states. [2019-09-10 09:07:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472375 states to 472375 states and 777625 transitions. [2019-09-10 09:07:46,478 INFO L78 Accepts]: Start accepts. Automaton has 472375 states and 777625 transitions. Word has length 241 [2019-09-10 09:07:46,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:46,478 INFO L475 AbstractCegarLoop]: Abstraction has 472375 states and 777625 transitions. [2019-09-10 09:07:46,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:07:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 472375 states and 777625 transitions. [2019-09-10 09:07:46,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 09:07:46,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:46,480 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:46,481 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:46,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:46,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1685205130, now seen corresponding path program 1 times [2019-09-10 09:07:46,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:46,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:46,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:46,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:46,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:46,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:46,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:46,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 09:07:46,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:46,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 09:07:46,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 09:07:46,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:07:46,853 INFO L87 Difference]: Start difference. First operand 472375 states and 777625 transitions. Second operand 8 states. [2019-09-10 09:08:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:05,557 INFO L93 Difference]: Finished difference Result 2141251 states and 3523685 transitions. [2019-09-10 09:08:05,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 09:08:05,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-09-10 09:08:05,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:09,744 INFO L225 Difference]: With dead ends: 2141251 [2019-09-10 09:08:09,744 INFO L226 Difference]: Without dead ends: 2141251 [2019-09-10 09:08:09,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-10 09:08:10,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141251 states. [2019-09-10 09:08:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141251 to 1298082. [2019-09-10 09:08:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298082 states. [2019-09-10 09:09:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298082 states to 1298082 states and 2128136 transitions. [2019-09-10 09:09:06,009 INFO L78 Accepts]: Start accepts. Automaton has 1298082 states and 2128136 transitions. Word has length 242 [2019-09-10 09:09:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:09:06,010 INFO L475 AbstractCegarLoop]: Abstraction has 1298082 states and 2128136 transitions. [2019-09-10 09:09:06,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 09:09:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1298082 states and 2128136 transitions. [2019-09-10 09:09:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-10 09:09:06,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:09:06,012 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] [2019-09-10 09:09:06,012 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:09:06,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:09:06,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1769078554, now seen corresponding path program 1 times [2019-09-10 09:09:06,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:09:06,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:06,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:09:06,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:06,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:09:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:09:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:09:06,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:09:06,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:09:06,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:09:06,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:09:06,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:09:06,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:09:06,599 INFO L87 Difference]: Start difference. First operand 1298082 states and 2128136 transitions. Second operand 7 states. [2019-09-10 09:09:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:09:32,290 INFO L93 Difference]: Finished difference Result 1842686 states and 3023033 transitions. [2019-09-10 09:09:32,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 09:09:32,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 244 [2019-09-10 09:09:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:09:35,275 INFO L225 Difference]: With dead ends: 1842686 [2019-09-10 09:09:35,275 INFO L226 Difference]: Without dead ends: 1842686 [2019-09-10 09:09:35,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:09:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842686 states. [2019-09-10 09:10:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842686 to 1298082. [2019-09-10 09:10:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298082 states.