java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:23:16,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:23:16,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:23:17,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:23:17,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:23:17,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:23:17,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:23:17,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:23:17,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:23:17,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:23:17,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:23:17,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:23:17,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:23:17,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:23:17,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:23:17,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:23:17,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:23:17,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:23:17,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:23:17,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:23:17,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:23:17,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:23:17,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:23:17,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:23:17,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:23:17,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:23:17,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:23:17,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:23:17,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:23:17,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:23:17,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:23:17,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:23:17,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:23:17,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:23:17,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:23:17,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:23:17,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:23:17,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:23:17,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:23:17,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:23:17,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:23:17,066 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:23:17,084 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:23:17,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:23:17,085 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:23:17,085 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:23:17,085 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:23:17,086 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:23:17,086 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:23:17,086 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:23:17,086 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:23:17,086 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:23:17,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:23:17,087 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:23:17,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:23:17,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:23:17,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:23:17,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:23:17,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:23:17,088 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:23:17,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:23:17,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:23:17,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:23:17,089 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:23:17,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:23:17,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:23:17,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:23:17,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:23:17,090 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:23:17,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:23:17,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:23:17,091 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:23:17,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:23:17,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:23:17,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:23:17,163 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:23:17,163 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:23:17,164 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:23:17,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b4296b3/3b525db3b86f4dc19573ca458541f6c3/FLAG291ed42aa [2019-09-10 06:23:17,830 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:23:17,831 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:23:17,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b4296b3/3b525db3b86f4dc19573ca458541f6c3/FLAG291ed42aa [2019-09-10 06:23:18,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b4296b3/3b525db3b86f4dc19573ca458541f6c3 [2019-09-10 06:23:18,052 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:23:18,054 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:23:18,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:23:18,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:23:18,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:23:18,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:23:18" (1/1) ... [2019-09-10 06:23:18,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697a5658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:18, skipping insertion in model container [2019-09-10 06:23:18,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:23:18" (1/1) ... [2019-09-10 06:23:18,073 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:23:18,185 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:23:19,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:23:19,226 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:23:19,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:23:19,658 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:23:19,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:19 WrapperNode [2019-09-10 06:23:19,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:23:19,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:23:19,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:23:19,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:23:19,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:19" (1/1) ... [2019-09-10 06:23:19,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:19" (1/1) ... [2019-09-10 06:23:19,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:19" (1/1) ... [2019-09-10 06:23:19,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:19" (1/1) ... [2019-09-10 06:23:19,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:19" (1/1) ... [2019-09-10 06:23:19,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:19" (1/1) ... [2019-09-10 06:23:19,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:19" (1/1) ... [2019-09-10 06:23:19,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:23:19,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:23:19,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:23:19,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:23:19,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:23:19,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:23:19,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:23:19,918 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:23:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:23:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:23:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:23:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:23:19,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:23:19,921 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:23:19,921 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:23:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:23:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:23:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:23:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:23:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:23:19,925 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:23:19,925 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:23:19,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:23:19,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:23:22,767 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:23:22,767 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:23:22,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:23:22 BoogieIcfgContainer [2019-09-10 06:23:22,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:23:22,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:23:22,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:23:22,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:23:22,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:23:18" (1/3) ... [2019-09-10 06:23:22,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29912f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:23:22, skipping insertion in model container [2019-09-10 06:23:22,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:19" (2/3) ... [2019-09-10 06:23:22,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29912f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:23:22, skipping insertion in model container [2019-09-10 06:23:22,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:23:22" (3/3) ... [2019-09-10 06:23:22,778 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:23:22,788 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:23:22,798 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:23:22,815 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:23:22,845 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:23:22,846 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:23:22,846 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:23:22,846 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:23:22,846 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:23:22,846 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:23:22,846 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:23:22,846 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:23:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states. [2019-09-10 06:23:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:23:22,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:22,921 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:22,923 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:22,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:22,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1669548829, now seen corresponding path program 1 times [2019-09-10 06:23:22,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:22,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:22,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:22,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:22,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:24,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:24,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:24,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:24,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:24,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:24,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:24,541 INFO L87 Difference]: Start difference. First operand 708 states. Second operand 4 states. [2019-09-10 06:23:24,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:24,920 INFO L93 Difference]: Finished difference Result 1387 states and 2463 transitions. [2019-09-10 06:23:24,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:23:24,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-09-10 06:23:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:24,948 INFO L225 Difference]: With dead ends: 1387 [2019-09-10 06:23:24,949 INFO L226 Difference]: Without dead ends: 1379 [2019-09-10 06:23:24,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:23:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-09-10 06:23:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1377. [2019-09-10 06:23:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2019-09-10 06:23:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2128 transitions. [2019-09-10 06:23:25,120 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2128 transitions. Word has length 304 [2019-09-10 06:23:25,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:25,123 INFO L475 AbstractCegarLoop]: Abstraction has 1377 states and 2128 transitions. [2019-09-10 06:23:25,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2128 transitions. [2019-09-10 06:23:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:23:25,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:25,137 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:25,137 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:25,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:25,139 INFO L82 PathProgramCache]: Analyzing trace with hash 909274118, now seen corresponding path program 1 times [2019-09-10 06:23:25,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:25,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:25,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:25,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:25,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:25,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:25,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:25,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:25,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:25,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:25,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:25,521 INFO L87 Difference]: Start difference. First operand 1377 states and 2128 transitions. Second operand 3 states. [2019-09-10 06:23:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:25,656 INFO L93 Difference]: Finished difference Result 2700 states and 4150 transitions. [2019-09-10 06:23:25,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:25,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-10 06:23:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:25,673 INFO L225 Difference]: With dead ends: 2700 [2019-09-10 06:23:25,674 INFO L226 Difference]: Without dead ends: 2700 [2019-09-10 06:23:25,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2019-09-10 06:23:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2698. [2019-09-10 06:23:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2019-09-10 06:23:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 4149 transitions. [2019-09-10 06:23:25,862 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 4149 transitions. Word has length 306 [2019-09-10 06:23:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:25,864 INFO L475 AbstractCegarLoop]: Abstraction has 2698 states and 4149 transitions. [2019-09-10 06:23:25,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:25,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4149 transitions. [2019-09-10 06:23:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:23:25,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:25,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:25,876 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:25,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:25,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1745611787, now seen corresponding path program 1 times [2019-09-10 06:23:25,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:25,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:25,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:25,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:25,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:26,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:26,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:26,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:26,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:26,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:26,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:26,041 INFO L87 Difference]: Start difference. First operand 2698 states and 4149 transitions. Second operand 3 states. [2019-09-10 06:23:26,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:26,156 INFO L93 Difference]: Finished difference Result 5363 states and 8238 transitions. [2019-09-10 06:23:26,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:26,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-10 06:23:26,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:26,203 INFO L225 Difference]: With dead ends: 5363 [2019-09-10 06:23:26,204 INFO L226 Difference]: Without dead ends: 5363 [2019-09-10 06:23:26,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2019-09-10 06:23:26,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 2717. [2019-09-10 06:23:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2717 states. [2019-09-10 06:23:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 4177 transitions. [2019-09-10 06:23:26,379 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 4177 transitions. Word has length 306 [2019-09-10 06:23:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:26,380 INFO L475 AbstractCegarLoop]: Abstraction has 2717 states and 4177 transitions. [2019-09-10 06:23:26,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 4177 transitions. [2019-09-10 06:23:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-10 06:23:26,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:26,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:26,391 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:26,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:26,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1586269519, now seen corresponding path program 1 times [2019-09-10 06:23:26,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:26,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:26,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:26,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:26,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:26,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:26,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:26,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:26,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:26,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:26,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:26,683 INFO L87 Difference]: Start difference. First operand 2717 states and 4177 transitions. Second operand 3 states. [2019-09-10 06:23:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:26,780 INFO L93 Difference]: Finished difference Result 5381 states and 8259 transitions. [2019-09-10 06:23:26,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:26,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-09-10 06:23:26,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:26,809 INFO L225 Difference]: With dead ends: 5381 [2019-09-10 06:23:26,809 INFO L226 Difference]: Without dead ends: 5381 [2019-09-10 06:23:26,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-09-10 06:23:26,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 2735. [2019-09-10 06:23:26,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2735 states. [2019-09-10 06:23:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 4198 transitions. [2019-09-10 06:23:26,935 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 4198 transitions. Word has length 307 [2019-09-10 06:23:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:26,935 INFO L475 AbstractCegarLoop]: Abstraction has 2735 states and 4198 transitions. [2019-09-10 06:23:26,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 4198 transitions. [2019-09-10 06:23:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:23:26,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:26,946 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:26,946 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:26,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:26,947 INFO L82 PathProgramCache]: Analyzing trace with hash -748890111, now seen corresponding path program 1 times [2019-09-10 06:23:26,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:26,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:26,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:26,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:26,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:27,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:27,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:27,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:27,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:27,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:27,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:27,281 INFO L87 Difference]: Start difference. First operand 2735 states and 4198 transitions. Second operand 3 states. [2019-09-10 06:23:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:27,437 INFO L93 Difference]: Finished difference Result 5272 states and 8029 transitions. [2019-09-10 06:23:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:27,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 06:23:27,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:27,464 INFO L225 Difference]: With dead ends: 5272 [2019-09-10 06:23:27,465 INFO L226 Difference]: Without dead ends: 5272 [2019-09-10 06:23:27,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:27,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5272 states. [2019-09-10 06:23:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5272 to 5270. [2019-09-10 06:23:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5270 states. [2019-09-10 06:23:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5270 states to 5270 states and 8028 transitions. [2019-09-10 06:23:27,625 INFO L78 Accepts]: Start accepts. Automaton has 5270 states and 8028 transitions. Word has length 308 [2019-09-10 06:23:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:27,626 INFO L475 AbstractCegarLoop]: Abstraction has 5270 states and 8028 transitions. [2019-09-10 06:23:27,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:27,627 INFO L276 IsEmpty]: Start isEmpty. Operand 5270 states and 8028 transitions. [2019-09-10 06:23:27,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:23:27,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:27,641 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:27,641 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:27,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:27,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1385769122, now seen corresponding path program 1 times [2019-09-10 06:23:27,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:27,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:27,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:27,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:27,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:27,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:27,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:27,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:27,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:27,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:27,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:27,998 INFO L87 Difference]: Start difference. First operand 5270 states and 8028 transitions. Second operand 4 states. [2019-09-10 06:23:28,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:28,110 INFO L93 Difference]: Finished difference Result 9602 states and 14528 transitions. [2019-09-10 06:23:28,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:28,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-10 06:23:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:28,168 INFO L225 Difference]: With dead ends: 9602 [2019-09-10 06:23:28,169 INFO L226 Difference]: Without dead ends: 9602 [2019-09-10 06:23:28,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:23:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9602 states. [2019-09-10 06:23:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9602 to 5505. [2019-09-10 06:23:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5505 states. [2019-09-10 06:23:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5505 states to 5505 states and 8416 transitions. [2019-09-10 06:23:28,373 INFO L78 Accepts]: Start accepts. Automaton has 5505 states and 8416 transitions. Word has length 308 [2019-09-10 06:23:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:28,374 INFO L475 AbstractCegarLoop]: Abstraction has 5505 states and 8416 transitions. [2019-09-10 06:23:28,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 5505 states and 8416 transitions. [2019-09-10 06:23:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:23:28,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:28,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:28,455 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:28,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:28,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1826813858, now seen corresponding path program 1 times [2019-09-10 06:23:28,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:28,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:28,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:28,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:28,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:28,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:28,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:28,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:28,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:28,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:28,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:28,635 INFO L87 Difference]: Start difference. First operand 5505 states and 8416 transitions. Second operand 3 states. [2019-09-10 06:23:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:28,706 INFO L93 Difference]: Finished difference Result 10243 states and 15476 transitions. [2019-09-10 06:23:28,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:28,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:23:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:28,733 INFO L225 Difference]: With dead ends: 10243 [2019-09-10 06:23:28,733 INFO L226 Difference]: Without dead ends: 10243 [2019-09-10 06:23:28,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10243 states. [2019-09-10 06:23:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10243 to 5609. [2019-09-10 06:23:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5609 states. [2019-09-10 06:23:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5609 states to 5609 states and 8559 transitions. [2019-09-10 06:23:28,885 INFO L78 Accepts]: Start accepts. Automaton has 5609 states and 8559 transitions. Word has length 310 [2019-09-10 06:23:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:28,886 INFO L475 AbstractCegarLoop]: Abstraction has 5609 states and 8559 transitions. [2019-09-10 06:23:28,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 5609 states and 8559 transitions. [2019-09-10 06:23:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-10 06:23:28,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:28,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:28,907 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:28,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:28,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1672338688, now seen corresponding path program 1 times [2019-09-10 06:23:28,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:28,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:28,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:28,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:28,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:29,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:29,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:29,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:29,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:29,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:29,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:29,080 INFO L87 Difference]: Start difference. First operand 5609 states and 8559 transitions. Second operand 3 states. [2019-09-10 06:23:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:29,179 INFO L93 Difference]: Finished difference Result 10368 states and 15622 transitions. [2019-09-10 06:23:29,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:29,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-10 06:23:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:29,203 INFO L225 Difference]: With dead ends: 10368 [2019-09-10 06:23:29,203 INFO L226 Difference]: Without dead ends: 10368 [2019-09-10 06:23:29,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10368 states. [2019-09-10 06:23:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10368 to 5734. [2019-09-10 06:23:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5734 states. [2019-09-10 06:23:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 8705 transitions. [2019-09-10 06:23:29,341 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 8705 transitions. Word has length 311 [2019-09-10 06:23:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:29,341 INFO L475 AbstractCegarLoop]: Abstraction has 5734 states and 8705 transitions. [2019-09-10 06:23:29,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 8705 transitions. [2019-09-10 06:23:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:23:29,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:29,357 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:29,357 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:29,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:29,358 INFO L82 PathProgramCache]: Analyzing trace with hash -651694283, now seen corresponding path program 1 times [2019-09-10 06:23:29,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:29,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:29,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:29,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:29,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:29,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:29,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:29,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:29,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:29,731 INFO L87 Difference]: Start difference. First operand 5734 states and 8705 transitions. Second operand 4 states. [2019-09-10 06:23:29,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:29,791 INFO L93 Difference]: Finished difference Result 5842 states and 8916 transitions. [2019-09-10 06:23:29,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:29,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-10 06:23:29,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:29,803 INFO L225 Difference]: With dead ends: 5842 [2019-09-10 06:23:29,803 INFO L226 Difference]: Without dead ends: 5045 [2019-09-10 06:23:29,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:23:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2019-09-10 06:23:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 5025. [2019-09-10 06:23:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5025 states. [2019-09-10 06:23:29,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 7649 transitions. [2019-09-10 06:23:29,903 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 7649 transitions. Word has length 312 [2019-09-10 06:23:29,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:29,904 INFO L475 AbstractCegarLoop]: Abstraction has 5025 states and 7649 transitions. [2019-09-10 06:23:29,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 7649 transitions. [2019-09-10 06:23:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-10 06:23:29,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:29,919 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:29,919 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:29,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:29,919 INFO L82 PathProgramCache]: Analyzing trace with hash 175091509, now seen corresponding path program 1 times [2019-09-10 06:23:29,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:29,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:29,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:29,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:29,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:30,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:30,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:23:30,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:30,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:23:30,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:23:30,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:23:30,374 INFO L87 Difference]: Start difference. First operand 5025 states and 7649 transitions. Second operand 5 states. [2019-09-10 06:23:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:31,172 INFO L93 Difference]: Finished difference Result 7835 states and 11857 transitions. [2019-09-10 06:23:31,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:23:31,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 313 [2019-09-10 06:23:31,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:31,199 INFO L225 Difference]: With dead ends: 7835 [2019-09-10 06:23:31,200 INFO L226 Difference]: Without dead ends: 7835 [2019-09-10 06:23:31,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:23:31,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7835 states. [2019-09-10 06:23:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7835 to 7833. [2019-09-10 06:23:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7833 states. [2019-09-10 06:23:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7833 states to 7833 states and 11856 transitions. [2019-09-10 06:23:31,350 INFO L78 Accepts]: Start accepts. Automaton has 7833 states and 11856 transitions. Word has length 313 [2019-09-10 06:23:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:31,351 INFO L475 AbstractCegarLoop]: Abstraction has 7833 states and 11856 transitions. [2019-09-10 06:23:31,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:23:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 11856 transitions. [2019-09-10 06:23:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-10 06:23:31,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:31,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:31,383 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:31,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:31,384 INFO L82 PathProgramCache]: Analyzing trace with hash 34938943, now seen corresponding path program 1 times [2019-09-10 06:23:31,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:31,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:31,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:31,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:31,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:31,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:31,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:23:31,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:31,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:23:31,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:23:31,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:23:31,837 INFO L87 Difference]: Start difference. First operand 7833 states and 11856 transitions. Second operand 8 states. [2019-09-10 06:23:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:33,243 INFO L93 Difference]: Finished difference Result 12983 states and 20040 transitions. [2019-09-10 06:23:33,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:23:33,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 313 [2019-09-10 06:23:33,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:33,274 INFO L225 Difference]: With dead ends: 12983 [2019-09-10 06:23:33,275 INFO L226 Difference]: Without dead ends: 12983 [2019-09-10 06:23:33,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:23:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12983 states. [2019-09-10 06:23:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12983 to 8877. [2019-09-10 06:23:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8877 states. [2019-09-10 06:23:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8877 states to 8877 states and 13385 transitions. [2019-09-10 06:23:33,458 INFO L78 Accepts]: Start accepts. Automaton has 8877 states and 13385 transitions. Word has length 313 [2019-09-10 06:23:33,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:33,459 INFO L475 AbstractCegarLoop]: Abstraction has 8877 states and 13385 transitions. [2019-09-10 06:23:33,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:23:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 8877 states and 13385 transitions. [2019-09-10 06:23:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-10 06:23:33,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:33,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:33,476 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:33,476 INFO L82 PathProgramCache]: Analyzing trace with hash 498317091, now seen corresponding path program 1 times [2019-09-10 06:23:33,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:33,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:33,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:33,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:33,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:34,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:34,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:34,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:34,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:34,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:34,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:34,156 INFO L87 Difference]: Start difference. First operand 8877 states and 13385 transitions. Second operand 4 states. [2019-09-10 06:23:34,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:34,302 INFO L93 Difference]: Finished difference Result 17208 states and 25740 transitions. [2019-09-10 06:23:34,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:34,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2019-09-10 06:23:34,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:34,347 INFO L225 Difference]: With dead ends: 17208 [2019-09-10 06:23:34,347 INFO L226 Difference]: Without dead ends: 17208 [2019-09-10 06:23:34,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:23:34,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17208 states. [2019-09-10 06:23:34,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17208 to 17206. [2019-09-10 06:23:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17206 states. [2019-09-10 06:23:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17206 states to 17206 states and 25739 transitions. [2019-09-10 06:23:34,857 INFO L78 Accepts]: Start accepts. Automaton has 17206 states and 25739 transitions. Word has length 313 [2019-09-10 06:23:34,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:34,857 INFO L475 AbstractCegarLoop]: Abstraction has 17206 states and 25739 transitions. [2019-09-10 06:23:34,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 17206 states and 25739 transitions. [2019-09-10 06:23:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-10 06:23:34,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:34,887 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:34,887 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:34,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:34,887 INFO L82 PathProgramCache]: Analyzing trace with hash 421614595, now seen corresponding path program 1 times [2019-09-10 06:23:34,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:34,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:34,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:34,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:34,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:35,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:35,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:35,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:35,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:35,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:35,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:35,159 INFO L87 Difference]: Start difference. First operand 17206 states and 25739 transitions. Second operand 3 states. [2019-09-10 06:23:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:35,310 INFO L93 Difference]: Finished difference Result 33257 states and 49377 transitions. [2019-09-10 06:23:35,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:35,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-10 06:23:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:35,380 INFO L225 Difference]: With dead ends: 33257 [2019-09-10 06:23:35,380 INFO L226 Difference]: Without dead ends: 33257 [2019-09-10 06:23:35,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33257 states. [2019-09-10 06:23:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33257 to 33255. [2019-09-10 06:23:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33255 states. [2019-09-10 06:23:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33255 states to 33255 states and 49376 transitions. [2019-09-10 06:23:35,981 INFO L78 Accepts]: Start accepts. Automaton has 33255 states and 49376 transitions. Word has length 315 [2019-09-10 06:23:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:35,981 INFO L475 AbstractCegarLoop]: Abstraction has 33255 states and 49376 transitions. [2019-09-10 06:23:35,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 33255 states and 49376 transitions. [2019-09-10 06:23:36,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-10 06:23:36,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:36,038 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:36,039 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:36,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:36,039 INFO L82 PathProgramCache]: Analyzing trace with hash -225211608, now seen corresponding path program 1 times [2019-09-10 06:23:36,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:36,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:36,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:37,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:37,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:37,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:37,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:37,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:37,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:37,175 INFO L87 Difference]: Start difference. First operand 33255 states and 49376 transitions. Second operand 3 states. [2019-09-10 06:23:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:37,437 INFO L93 Difference]: Finished difference Result 64940 states and 95640 transitions. [2019-09-10 06:23:37,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:37,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-09-10 06:23:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:37,587 INFO L225 Difference]: With dead ends: 64940 [2019-09-10 06:23:37,588 INFO L226 Difference]: Without dead ends: 64940 [2019-09-10 06:23:37,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64940 states. [2019-09-10 06:23:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64940 to 64938. [2019-09-10 06:23:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64938 states. [2019-09-10 06:23:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64938 states to 64938 states and 95639 transitions. [2019-09-10 06:23:38,607 INFO L78 Accepts]: Start accepts. Automaton has 64938 states and 95639 transitions. Word has length 317 [2019-09-10 06:23:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:38,607 INFO L475 AbstractCegarLoop]: Abstraction has 64938 states and 95639 transitions. [2019-09-10 06:23:38,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 64938 states and 95639 transitions. [2019-09-10 06:23:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-10 06:23:38,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:38,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:38,669 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:38,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:38,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1961490731, now seen corresponding path program 1 times [2019-09-10 06:23:38,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:38,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:38,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:38,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:38,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:39,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:39,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:39,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:39,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:39,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:39,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:39,229 INFO L87 Difference]: Start difference. First operand 64938 states and 95639 transitions. Second operand 4 states. [2019-09-10 06:23:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:39,587 INFO L93 Difference]: Finished difference Result 109445 states and 160685 transitions. [2019-09-10 06:23:39,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:39,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2019-09-10 06:23:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:39,733 INFO L225 Difference]: With dead ends: 109445 [2019-09-10 06:23:39,734 INFO L226 Difference]: Without dead ends: 109445 [2019-09-10 06:23:39,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:23:39,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109445 states. [2019-09-10 06:23:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109445 to 63581. [2019-09-10 06:23:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63581 states. [2019-09-10 06:23:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63581 states to 63581 states and 93709 transitions. [2019-09-10 06:23:42,406 INFO L78 Accepts]: Start accepts. Automaton has 63581 states and 93709 transitions. Word has length 317 [2019-09-10 06:23:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:42,406 INFO L475 AbstractCegarLoop]: Abstraction has 63581 states and 93709 transitions. [2019-09-10 06:23:42,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 63581 states and 93709 transitions. [2019-09-10 06:23:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:23:42,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:42,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:42,445 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:42,445 INFO L82 PathProgramCache]: Analyzing trace with hash 283149039, now seen corresponding path program 1 times [2019-09-10 06:23:42,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:42,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:42,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:42,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:42,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:42,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 06:23:42,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:42,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:42,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:42,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:42,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:42,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:42,599 INFO L87 Difference]: Start difference. First operand 63581 states and 93709 transitions. Second operand 3 states. [2019-09-10 06:23:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:42,938 INFO L93 Difference]: Finished difference Result 110530 states and 162111 transitions. [2019-09-10 06:23:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:42,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 06:23:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:43,108 INFO L225 Difference]: With dead ends: 110530 [2019-09-10 06:23:43,108 INFO L226 Difference]: Without dead ends: 110530 [2019-09-10 06:23:43,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:43,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110530 states. [2019-09-10 06:23:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110530 to 64062. [2019-09-10 06:23:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64062 states. [2019-09-10 06:23:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64062 states to 64062 states and 94307 transitions. [2019-09-10 06:23:45,801 INFO L78 Accepts]: Start accepts. Automaton has 64062 states and 94307 transitions. Word has length 320 [2019-09-10 06:23:45,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:45,802 INFO L475 AbstractCegarLoop]: Abstraction has 64062 states and 94307 transitions. [2019-09-10 06:23:45,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 64062 states and 94307 transitions. [2019-09-10 06:23:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 06:23:45,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:45,841 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:45,841 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1767642583, now seen corresponding path program 1 times [2019-09-10 06:23:45,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:45,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:45,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:45,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:45,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:46,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:46,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:46,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:46,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:46,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:46,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:46,160 INFO L87 Difference]: Start difference. First operand 64062 states and 94307 transitions. Second operand 4 states. [2019-09-10 06:23:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:46,352 INFO L93 Difference]: Finished difference Result 61565 states and 90794 transitions. [2019-09-10 06:23:46,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:46,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2019-09-10 06:23:46,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:46,431 INFO L225 Difference]: With dead ends: 61565 [2019-09-10 06:23:46,431 INFO L226 Difference]: Without dead ends: 57397 [2019-09-10 06:23:46,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:23:46,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57397 states. [2019-09-10 06:23:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57397 to 57070. [2019-09-10 06:23:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57070 states. [2019-09-10 06:23:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57070 states to 57070 states and 83929 transitions. [2019-09-10 06:23:47,444 INFO L78 Accepts]: Start accepts. Automaton has 57070 states and 83929 transitions. Word has length 321 [2019-09-10 06:23:47,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:47,444 INFO L475 AbstractCegarLoop]: Abstraction has 57070 states and 83929 transitions. [2019-09-10 06:23:47,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 57070 states and 83929 transitions. [2019-09-10 06:23:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 06:23:47,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:47,480 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:47,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:47,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1761143674, now seen corresponding path program 1 times [2019-09-10 06:23:47,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:47,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:47,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:47,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:47,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:47,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:47,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:23:47,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:47,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:23:47,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:23:47,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:23:47,988 INFO L87 Difference]: Start difference. First operand 57070 states and 83929 transitions. Second operand 9 states. [2019-09-10 06:23:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:50,305 INFO L93 Difference]: Finished difference Result 158630 states and 235908 transitions. [2019-09-10 06:23:50,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:23:50,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 322 [2019-09-10 06:23:50,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:50,513 INFO L225 Difference]: With dead ends: 158630 [2019-09-10 06:23:50,513 INFO L226 Difference]: Without dead ends: 158630 [2019-09-10 06:23:50,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:23:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158630 states. [2019-09-10 06:23:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158630 to 119256. [2019-09-10 06:23:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119256 states. [2019-09-10 06:23:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119256 states to 119256 states and 176012 transitions. [2019-09-10 06:23:54,572 INFO L78 Accepts]: Start accepts. Automaton has 119256 states and 176012 transitions. Word has length 322 [2019-09-10 06:23:54,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:54,573 INFO L475 AbstractCegarLoop]: Abstraction has 119256 states and 176012 transitions. [2019-09-10 06:23:54,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:23:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 119256 states and 176012 transitions. [2019-09-10 06:23:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 06:23:54,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:54,626 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:54,627 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:54,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:54,627 INFO L82 PathProgramCache]: Analyzing trace with hash -245477294, now seen corresponding path program 1 times [2019-09-10 06:23:54,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:54,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:54,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:54,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:54,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:54,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:54,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:54,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:54,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:54,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:54,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:54,994 INFO L87 Difference]: Start difference. First operand 119256 states and 176012 transitions. Second operand 4 states. [2019-09-10 06:23:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:55,442 INFO L93 Difference]: Finished difference Result 139302 states and 207233 transitions. [2019-09-10 06:23:55,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:55,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-10 06:23:55,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:55,624 INFO L225 Difference]: With dead ends: 139302 [2019-09-10 06:23:55,624 INFO L226 Difference]: Without dead ends: 139302 [2019-09-10 06:23:55,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 06:23:55,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139302 states. [2019-09-10 06:23:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139302 to 139300. [2019-09-10 06:23:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139300 states. [2019-09-10 06:23:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139300 states to 139300 states and 207232 transitions. [2019-09-10 06:23:57,902 INFO L78 Accepts]: Start accepts. Automaton has 139300 states and 207232 transitions. Word has length 322 [2019-09-10 06:23:57,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:57,903 INFO L475 AbstractCegarLoop]: Abstraction has 139300 states and 207232 transitions. [2019-09-10 06:23:57,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:57,903 INFO L276 IsEmpty]: Start isEmpty. Operand 139300 states and 207232 transitions. [2019-09-10 06:23:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 06:23:57,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:57,960 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:57,961 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:57,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:57,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1093279294, now seen corresponding path program 1 times [2019-09-10 06:23:57,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:57,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:57,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:58,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:58,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:58,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:58,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:58,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:58,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:58,634 INFO L87 Difference]: Start difference. First operand 139300 states and 207232 transitions. Second operand 4 states. [2019-09-10 06:23:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:59,386 INFO L93 Difference]: Finished difference Result 264014 states and 390001 transitions. [2019-09-10 06:23:59,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:59,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-10 06:23:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:59,715 INFO L225 Difference]: With dead ends: 264014 [2019-09-10 06:23:59,716 INFO L226 Difference]: Without dead ends: 264014 [2019-09-10 06:23:59,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:23:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264014 states. [2019-09-10 06:24:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264014 to 264012. [2019-09-10 06:24:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264012 states. [2019-09-10 06:24:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264012 states to 264012 states and 390000 transitions. [2019-09-10 06:24:07,484 INFO L78 Accepts]: Start accepts. Automaton has 264012 states and 390000 transitions. Word has length 322 [2019-09-10 06:24:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:07,485 INFO L475 AbstractCegarLoop]: Abstraction has 264012 states and 390000 transitions. [2019-09-10 06:24:07,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:24:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 264012 states and 390000 transitions. [2019-09-10 06:24:07,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 06:24:07,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:07,584 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:07,584 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:07,584 INFO L82 PathProgramCache]: Analyzing trace with hash 376563355, now seen corresponding path program 1 times [2019-09-10 06:24:07,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:07,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:07,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:07,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:07,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:07,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:07,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:07,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:07,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:07,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:07,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:07,811 INFO L87 Difference]: Start difference. First operand 264012 states and 390000 transitions. Second operand 3 states. [2019-09-10 06:24:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:09,033 INFO L93 Difference]: Finished difference Result 515733 states and 757076 transitions. [2019-09-10 06:24:09,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:09,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 06:24:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:09,800 INFO L225 Difference]: With dead ends: 515733 [2019-09-10 06:24:09,800 INFO L226 Difference]: Without dead ends: 515733 [2019-09-10 06:24:09,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:10,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515733 states. [2019-09-10 06:24:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515733 to 515479. [2019-09-10 06:24:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515479 states. [2019-09-10 06:24:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515479 states to 515479 states and 756760 transitions. [2019-09-10 06:24:23,934 INFO L78 Accepts]: Start accepts. Automaton has 515479 states and 756760 transitions. Word has length 324 [2019-09-10 06:24:23,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:23,934 INFO L475 AbstractCegarLoop]: Abstraction has 515479 states and 756760 transitions. [2019-09-10 06:24:23,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 515479 states and 756760 transitions. [2019-09-10 06:24:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 06:24:24,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:24,141 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:24,141 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:24,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:24,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1317458006, now seen corresponding path program 1 times [2019-09-10 06:24:24,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:24,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:24,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:24,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:24,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:24,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:24,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:24,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:24,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:24,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:24,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:24,403 INFO L87 Difference]: Start difference. First operand 515479 states and 756760 transitions. Second operand 3 states. [2019-09-10 06:24:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:33,366 INFO L93 Difference]: Finished difference Result 1009913 states and 1473458 transitions. [2019-09-10 06:24:33,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:33,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 06:24:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:34,814 INFO L225 Difference]: With dead ends: 1009913 [2019-09-10 06:24:34,814 INFO L226 Difference]: Without dead ends: 1009913 [2019-09-10 06:24:34,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009913 states. [2019-09-10 06:25:07,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009913 to 1009911. [2019-09-10 06:25:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009911 states. [2019-09-10 06:25:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009911 states to 1009911 states and 1473457 transitions. [2019-09-10 06:25:09,247 INFO L78 Accepts]: Start accepts. Automaton has 1009911 states and 1473457 transitions. Word has length 326 [2019-09-10 06:25:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:09,248 INFO L475 AbstractCegarLoop]: Abstraction has 1009911 states and 1473457 transitions. [2019-09-10 06:25:09,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1009911 states and 1473457 transitions. [2019-09-10 06:25:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 06:25:12,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:12,521 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:12,521 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:12,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:12,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1738790669, now seen corresponding path program 1 times [2019-09-10 06:25:12,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:12,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:12,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:12,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:12,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:12,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:12,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:12,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:12,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:12,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:12,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:12,797 INFO L87 Difference]: Start difference. First operand 1009911 states and 1473457 transitions. Second operand 4 states. [2019-09-10 06:25:27,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:27,174 INFO L93 Difference]: Finished difference Result 1535049 states and 2234214 transitions. [2019-09-10 06:25:27,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:25:27,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-10 06:25:27,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:29,140 INFO L225 Difference]: With dead ends: 1535049 [2019-09-10 06:25:29,141 INFO L226 Difference]: Without dead ends: 1533033 [2019-09-10 06:25:29,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:25:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533033 states. [2019-09-10 06:26:03,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533033 to 942703. [2019-09-10 06:26:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942703 states. [2019-09-10 06:26:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942703 states to 942703 states and 1374547 transitions. [2019-09-10 06:26:19,804 INFO L78 Accepts]: Start accepts. Automaton has 942703 states and 1374547 transitions. Word has length 326 [2019-09-10 06:26:19,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:19,804 INFO L475 AbstractCegarLoop]: Abstraction has 942703 states and 1374547 transitions. [2019-09-10 06:26:19,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:26:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 942703 states and 1374547 transitions. [2019-09-10 06:26:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-10 06:26:20,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:20,173 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:20,173 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:20,174 INFO L82 PathProgramCache]: Analyzing trace with hash -353380125, now seen corresponding path program 1 times [2019-09-10 06:26:20,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:20,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:20,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:20,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:20,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:26:20,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:20,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:26:20,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:20,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:26:20,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:26:20,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:20,302 INFO L87 Difference]: Start difference. First operand 942703 states and 1374547 transitions. Second operand 3 states. [2019-09-10 06:26:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:31,918 INFO L93 Difference]: Finished difference Result 1634069 states and 2378514 transitions. [2019-09-10 06:26:31,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:31,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-10 06:26:31,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:44,902 INFO L225 Difference]: With dead ends: 1634069 [2019-09-10 06:26:44,903 INFO L226 Difference]: Without dead ends: 1634069 [2019-09-10 06:26:44,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634069 states. [2019-09-10 06:27:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634069 to 942163. [2019-09-10 06:27:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942163 states. [2019-09-10 06:27:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942163 states to 942163 states and 1372949 transitions. [2019-09-10 06:27:23,430 INFO L78 Accepts]: Start accepts. Automaton has 942163 states and 1372949 transitions. Word has length 329 [2019-09-10 06:27:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:23,431 INFO L475 AbstractCegarLoop]: Abstraction has 942163 states and 1372949 transitions. [2019-09-10 06:27:23,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 942163 states and 1372949 transitions. [2019-09-10 06:27:26,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 06:27:26,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:26,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:26,521 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:26,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:26,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1033037564, now seen corresponding path program 1 times [2019-09-10 06:27:26,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:26,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:26,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:26,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:26,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:26,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:27:26,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:26,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:27:26,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:26,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:27:26,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:27:26,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:27:26,854 INFO L87 Difference]: Start difference. First operand 942163 states and 1372949 transitions. Second operand 4 states. [2019-09-10 06:27:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:30,615 INFO L93 Difference]: Finished difference Result 879955 states and 1280816 transitions. [2019-09-10 06:27:30,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:30,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2019-09-10 06:27:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:32,009 INFO L225 Difference]: With dead ends: 879955 [2019-09-10 06:27:32,009 INFO L226 Difference]: Without dead ends: 858157 [2019-09-10 06:27:32,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:27:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858157 states. [2019-09-10 06:28:03,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858157 to 854879. [2019-09-10 06:28:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854879 states. [2019-09-10 06:28:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854879 states to 854879 states and 1243521 transitions. [2019-09-10 06:28:17,636 INFO L78 Accepts]: Start accepts. Automaton has 854879 states and 1243521 transitions. Word has length 330 [2019-09-10 06:28:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:17,636 INFO L475 AbstractCegarLoop]: Abstraction has 854879 states and 1243521 transitions. [2019-09-10 06:28:17,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:28:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 854879 states and 1243521 transitions. [2019-09-10 06:28:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-10 06:28:17,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:17,942 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:17,942 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:17,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:17,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1868565026, now seen corresponding path program 1 times [2019-09-10 06:28:17,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:17,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:17,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:17,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:17,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:19,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:19,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:28:19,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:19,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:28:19,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:28:19,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:28:19,790 INFO L87 Difference]: Start difference. First operand 854879 states and 1243521 transitions. Second operand 9 states. [2019-09-10 06:28:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:42,644 INFO L93 Difference]: Finished difference Result 2851743 states and 4167293 transitions. [2019-09-10 06:28:42,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:28:42,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 331 [2019-09-10 06:28:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:47,469 INFO L225 Difference]: With dead ends: 2851743 [2019-09-10 06:28:47,470 INFO L226 Difference]: Without dead ends: 2851743 [2019-09-10 06:28:47,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:28:50,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851743 states.