java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:07:41,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:07:41,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:07:41,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:07:41,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:07:41,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:07:41,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:07:41,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:07:41,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:07:41,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:07:41,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:07:41,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:07:41,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:07:41,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:07:41,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:07:41,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:07:41,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:07:41,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:07:41,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:07:41,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:07:41,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:07:41,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:07:41,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:07:41,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:07:41,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:07:41,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:07:41,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:07:41,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:07:41,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:07:41,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:07:41,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:07:41,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:07:41,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:07:41,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:07:41,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:07:41,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:07:41,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:07:41,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:07:41,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:07:41,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:07:41,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:07:41,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 09:07:41,119 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:07:41,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:07:41,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:07:41,120 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:07:41,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:07:41,121 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:07:41,121 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:07:41,121 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:07:41,122 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:07:41,122 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:07:41,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:07:41,123 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:07:41,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:07:41,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:07:41,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:07:41,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:07:41,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:07:41,124 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:07:41,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:07:41,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:07:41,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:07:41,125 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:07:41,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:07:41,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:07:41,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:07:41,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:07:41,126 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:07:41,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:07:41,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:07:41,126 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:07:41,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:07:41,169 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:07:41,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:07:41,174 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:07:41,175 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:07:41,175 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 09:07:41,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a21dd6b/13fa071c727d43daa94147d81578c9b7/FLAG94b0aa924 [2019-09-10 09:07:42,144 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:07:42,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 09:07:42,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a21dd6b/13fa071c727d43daa94147d81578c9b7/FLAG94b0aa924 [2019-09-10 09:07:42,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a21dd6b/13fa071c727d43daa94147d81578c9b7 [2019-09-10 09:07:42,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:07:42,578 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:07:42,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:07:42,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:07:42,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:07:42,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:07:42" (1/1) ... [2019-09-10 09:07:42,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f93532c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:42, skipping insertion in model container [2019-09-10 09:07:42,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:07:42" (1/1) ... [2019-09-10 09:07:42,594 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:07:43,130 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:07:47,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:07:47,283 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:07:50,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:07:50,631 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:07:50,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:50 WrapperNode [2019-09-10 09:07:50,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:07:50,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:07:50,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:07:50,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:07:50,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:50" (1/1) ... [2019-09-10 09:07:50,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:50" (1/1) ... [2019-09-10 09:07:50,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:50" (1/1) ... [2019-09-10 09:07:50,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:50" (1/1) ... [2019-09-10 09:07:50,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:50" (1/1) ... [2019-09-10 09:07:50,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:50" (1/1) ... [2019-09-10 09:07:51,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:50" (1/1) ... [2019-09-10 09:07:51,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:07:51,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:07:51,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:07:51,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:07:51,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:07:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:07:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:07:51,351 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:07:51,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:07:51,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:07:51,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:07:51,351 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:07:51,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:07:51,352 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:07:51,352 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:07:51,352 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:07:51,353 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:07:51,353 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:07:51,353 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:07:51,353 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:07:51,354 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:07:51,354 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:07:51,354 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:07:51,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:07:51,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:08:06,951 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:08:06,952 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:08:06,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:08:06 BoogieIcfgContainer [2019-09-10 09:08:06,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:08:06,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:08:06,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:08:06,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:08:06,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:07:42" (1/3) ... [2019-09-10 09:08:06,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef392c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:08:06, skipping insertion in model container [2019-09-10 09:08:06,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:50" (2/3) ... [2019-09-10 09:08:06,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef392c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:08:06, skipping insertion in model container [2019-09-10 09:08:06,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:08:06" (3/3) ... [2019-09-10 09:08:06,965 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 09:08:06,979 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:08:07,004 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:08:07,022 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:08:07,050 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:08:07,050 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:08:07,050 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:08:07,050 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:08:07,051 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:08:07,051 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:08:07,051 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:08:07,051 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:08:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 6869 states. [2019-09-10 09:08:07,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-10 09:08:07,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:07,222 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:08:07,224 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:07,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash 803345190, now seen corresponding path program 1 times [2019-09-10 09:08:07,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:07,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:07,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:07,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:07,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:08,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:08,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:08,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:08,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:08,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:08,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:08,396 INFO L87 Difference]: Start difference. First operand 6869 states. Second operand 3 states. [2019-09-10 09:08:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:08,937 INFO L93 Difference]: Finished difference Result 8216 states and 14241 transitions. [2019-09-10 09:08:08,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:08,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-09-10 09:08:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:09,000 INFO L225 Difference]: With dead ends: 8216 [2019-09-10 09:08:09,000 INFO L226 Difference]: Without dead ends: 8208 [2019-09-10 09:08:09,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8208 states. [2019-09-10 09:08:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8208 to 8206. [2019-09-10 09:08:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8206 states. [2019-09-10 09:08:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8206 states to 8206 states and 13731 transitions. [2019-09-10 09:08:09,268 INFO L78 Accepts]: Start accepts. Automaton has 8206 states and 13731 transitions. Word has length 387 [2019-09-10 09:08:09,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:09,270 INFO L475 AbstractCegarLoop]: Abstraction has 8206 states and 13731 transitions. [2019-09-10 09:08:09,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 8206 states and 13731 transitions. [2019-09-10 09:08:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-10 09:08:09,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:09,296 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:08:09,296 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:09,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:09,297 INFO L82 PathProgramCache]: Analyzing trace with hash 349013669, now seen corresponding path program 1 times [2019-09-10 09:08:09,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:09,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:09,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:09,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:09,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:09,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:09,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:09,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:09,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:09,713 INFO L87 Difference]: Start difference. First operand 8206 states and 13731 transitions. Second operand 3 states. [2019-09-10 09:08:10,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:10,758 INFO L93 Difference]: Finished difference Result 10895 states and 18209 transitions. [2019-09-10 09:08:10,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:10,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-09-10 09:08:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:10,821 INFO L225 Difference]: With dead ends: 10895 [2019-09-10 09:08:10,821 INFO L226 Difference]: Without dead ends: 10895 [2019-09-10 09:08:10,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10895 states. [2019-09-10 09:08:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10895 to 10893. [2019-09-10 09:08:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-09-10 09:08:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 18208 transitions. [2019-09-10 09:08:11,161 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 18208 transitions. Word has length 387 [2019-09-10 09:08:11,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:11,163 INFO L475 AbstractCegarLoop]: Abstraction has 10893 states and 18208 transitions. [2019-09-10 09:08:11,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 18208 transitions. [2019-09-10 09:08:11,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-10 09:08:11,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:11,197 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:08:11,198 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:11,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2128351759, now seen corresponding path program 1 times [2019-09-10 09:08:11,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:11,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:11,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:11,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:11,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:11,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:11,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:11,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:11,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:11,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:11,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:11,933 INFO L87 Difference]: Start difference. First operand 10893 states and 18208 transitions. Second operand 3 states. [2019-09-10 09:08:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:12,535 INFO L93 Difference]: Finished difference Result 16230 states and 27051 transitions. [2019-09-10 09:08:12,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:12,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-09-10 09:08:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:12,626 INFO L225 Difference]: With dead ends: 16230 [2019-09-10 09:08:12,627 INFO L226 Difference]: Without dead ends: 16230 [2019-09-10 09:08:12,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16230 states. [2019-09-10 09:08:12,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16230 to 16228. [2019-09-10 09:08:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16228 states. [2019-09-10 09:08:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16228 states to 16228 states and 27050 transitions. [2019-09-10 09:08:13,033 INFO L78 Accepts]: Start accepts. Automaton has 16228 states and 27050 transitions. Word has length 387 [2019-09-10 09:08:13,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:13,034 INFO L475 AbstractCegarLoop]: Abstraction has 16228 states and 27050 transitions. [2019-09-10 09:08:13,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 16228 states and 27050 transitions. [2019-09-10 09:08:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-10 09:08:13,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:13,080 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:08:13,081 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:13,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:13,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2011744305, now seen corresponding path program 1 times [2019-09-10 09:08:13,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:13,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:13,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:13,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:13,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:13,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:13,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:13,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:13,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:13,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:13,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:13,569 INFO L87 Difference]: Start difference. First operand 16228 states and 27050 transitions. Second operand 3 states. [2019-09-10 09:08:14,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:14,472 INFO L93 Difference]: Finished difference Result 26042 states and 43423 transitions. [2019-09-10 09:08:14,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:14,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-09-10 09:08:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:14,528 INFO L225 Difference]: With dead ends: 26042 [2019-09-10 09:08:14,528 INFO L226 Difference]: Without dead ends: 26042 [2019-09-10 09:08:14,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26042 states. [2019-09-10 09:08:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26042 to 26040. [2019-09-10 09:08:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26040 states. [2019-09-10 09:08:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26040 states to 26040 states and 43422 transitions. [2019-09-10 09:08:15,050 INFO L78 Accepts]: Start accepts. Automaton has 26040 states and 43422 transitions. Word has length 387 [2019-09-10 09:08:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:15,051 INFO L475 AbstractCegarLoop]: Abstraction has 26040 states and 43422 transitions. [2019-09-10 09:08:15,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 26040 states and 43422 transitions. [2019-09-10 09:08:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-10 09:08:15,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:15,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:08:15,108 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:15,108 INFO L82 PathProgramCache]: Analyzing trace with hash 450483599, now seen corresponding path program 1 times [2019-09-10 09:08:15,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:15,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:15,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:15,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:15,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:15,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:15,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:15,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:15,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:15,567 INFO L87 Difference]: Start difference. First operand 26040 states and 43422 transitions. Second operand 3 states. [2019-09-10 09:08:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:17,509 INFO L93 Difference]: Finished difference Result 45704 states and 75983 transitions. [2019-09-10 09:08:17,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:17,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-09-10 09:08:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:17,630 INFO L225 Difference]: With dead ends: 45704 [2019-09-10 09:08:17,631 INFO L226 Difference]: Without dead ends: 45704 [2019-09-10 09:08:17,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45704 states. [2019-09-10 09:08:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45704 to 45702. [2019-09-10 09:08:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45702 states. [2019-09-10 09:08:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45702 states to 45702 states and 75982 transitions. [2019-09-10 09:08:19,652 INFO L78 Accepts]: Start accepts. Automaton has 45702 states and 75982 transitions. Word has length 387 [2019-09-10 09:08:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:19,652 INFO L475 AbstractCegarLoop]: Abstraction has 45702 states and 75982 transitions. [2019-09-10 09:08:19,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 45702 states and 75982 transitions. [2019-09-10 09:08:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-10 09:08:19,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:19,713 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:08:19,713 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:19,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:19,714 INFO L82 PathProgramCache]: Analyzing trace with hash 719491791, now seen corresponding path program 1 times [2019-09-10 09:08:19,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:19,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:19,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:19,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:19,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:20,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:20,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:20,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:20,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:20,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:20,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:20,033 INFO L87 Difference]: Start difference. First operand 45702 states and 75982 transitions. Second operand 3 states. [2019-09-10 09:08:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:20,816 INFO L93 Difference]: Finished difference Result 48688 states and 80771 transitions. [2019-09-10 09:08:20,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:20,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-09-10 09:08:20,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:20,882 INFO L225 Difference]: With dead ends: 48688 [2019-09-10 09:08:20,883 INFO L226 Difference]: Without dead ends: 48688 [2019-09-10 09:08:20,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48688 states. [2019-09-10 09:08:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48688 to 48470. [2019-09-10 09:08:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48470 states. [2019-09-10 09:08:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48470 states to 48470 states and 80554 transitions. [2019-09-10 09:08:23,142 INFO L78 Accepts]: Start accepts. Automaton has 48470 states and 80554 transitions. Word has length 387 [2019-09-10 09:08:23,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:23,142 INFO L475 AbstractCegarLoop]: Abstraction has 48470 states and 80554 transitions. [2019-09-10 09:08:23,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 48470 states and 80554 transitions. [2019-09-10 09:08:23,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-10 09:08:23,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:23,198 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:08:23,199 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:23,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1837003022, now seen corresponding path program 1 times [2019-09-10 09:08:23,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:23,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:23,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:23,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:23,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:24,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:24,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:08:24,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:24,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:08:24,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:08:24,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:08:24,080 INFO L87 Difference]: Start difference. First operand 48470 states and 80554 transitions. Second operand 4 states. [2019-09-10 09:08:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:25,908 INFO L93 Difference]: Finished difference Result 78746 states and 131104 transitions. [2019-09-10 09:08:25,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:08:25,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 387 [2019-09-10 09:08:25,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:26,030 INFO L225 Difference]: With dead ends: 78746 [2019-09-10 09:08:26,030 INFO L226 Difference]: Without dead ends: 78746 [2019-09-10 09:08:26,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:08:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78746 states. [2019-09-10 09:08:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78746 to 75646. [2019-09-10 09:08:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75646 states. [2019-09-10 09:08:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75646 states to 75646 states and 125946 transitions. [2019-09-10 09:08:27,186 INFO L78 Accepts]: Start accepts. Automaton has 75646 states and 125946 transitions. Word has length 387 [2019-09-10 09:08:27,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:27,187 INFO L475 AbstractCegarLoop]: Abstraction has 75646 states and 125946 transitions. [2019-09-10 09:08:27,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:08:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 75646 states and 125946 transitions. [2019-09-10 09:08:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-10 09:08:27,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:27,260 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:08:27,261 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:27,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:27,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1129307814, now seen corresponding path program 1 times [2019-09-10 09:08:27,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:27,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:27,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:27,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:27,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:27,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:27,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:27,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:27,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:27,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:27,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:27,881 INFO L87 Difference]: Start difference. First operand 75646 states and 125946 transitions. Second operand 3 states. [2019-09-10 09:08:28,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:28,620 INFO L93 Difference]: Finished difference Result 132866 states and 219685 transitions. [2019-09-10 09:08:28,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:28,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-09-10 09:08:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:28,838 INFO L225 Difference]: With dead ends: 132866 [2019-09-10 09:08:28,839 INFO L226 Difference]: Without dead ends: 132866 [2019-09-10 09:08:28,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132866 states. [2019-09-10 09:08:32,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132866 to 118564. [2019-09-10 09:08:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118564 states. [2019-09-10 09:08:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118564 states to 118564 states and 196504 transitions. [2019-09-10 09:08:32,375 INFO L78 Accepts]: Start accepts. Automaton has 118564 states and 196504 transitions. Word has length 391 [2019-09-10 09:08:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:32,376 INFO L475 AbstractCegarLoop]: Abstraction has 118564 states and 196504 transitions. [2019-09-10 09:08:32,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 118564 states and 196504 transitions. [2019-09-10 09:08:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-10 09:08:32,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:32,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:08:32,477 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:32,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:32,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1737388368, now seen corresponding path program 1 times [2019-09-10 09:08:32,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:32,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:32,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:32,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:32,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:34,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:34,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 09:08:34,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:34,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 09:08:34,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 09:08:34,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:08:34,434 INFO L87 Difference]: Start difference. First operand 118564 states and 196504 transitions. Second operand 8 states. [2019-09-10 09:08:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:36,676 INFO L93 Difference]: Finished difference Result 266796 states and 442798 transitions. [2019-09-10 09:08:36,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 09:08:36,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 391 [2019-09-10 09:08:36,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:37,033 INFO L225 Difference]: With dead ends: 266796 [2019-09-10 09:08:37,034 INFO L226 Difference]: Without dead ends: 266796 [2019-09-10 09:08:37,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-09-10 09:08:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266796 states. [2019-09-10 09:08:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266796 to 232248. [2019-09-10 09:08:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232248 states. [2019-09-10 09:08:43,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232248 states to 232248 states and 384784 transitions. [2019-09-10 09:08:43,392 INFO L78 Accepts]: Start accepts. Automaton has 232248 states and 384784 transitions. Word has length 391 [2019-09-10 09:08:43,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:43,392 INFO L475 AbstractCegarLoop]: Abstraction has 232248 states and 384784 transitions. [2019-09-10 09:08:43,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 09:08:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 232248 states and 384784 transitions. [2019-09-10 09:08:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-10 09:08:43,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:43,562 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:08:43,562 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:43,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1871394503, now seen corresponding path program 1 times [2019-09-10 09:08:43,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:43,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:43,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:43,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:43,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:43,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:43,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:43,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:43,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:43,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:43,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:43,922 INFO L87 Difference]: Start difference. First operand 232248 states and 384784 transitions. Second operand 3 states. [2019-09-10 09:08:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:44,315 INFO L93 Difference]: Finished difference Result 90918 states and 151489 transitions. [2019-09-10 09:08:44,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:44,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-09-10 09:08:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:44,404 INFO L225 Difference]: With dead ends: 90918 [2019-09-10 09:08:44,404 INFO L226 Difference]: Without dead ends: 90918 [2019-09-10 09:08:44,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:44,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90918 states. [2019-09-10 09:08:46,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90918 to 77932. [2019-09-10 09:08:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77932 states. [2019-09-10 09:08:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77932 states to 77932 states and 129702 transitions. [2019-09-10 09:08:46,143 INFO L78 Accepts]: Start accepts. Automaton has 77932 states and 129702 transitions. Word has length 391 [2019-09-10 09:08:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:46,144 INFO L475 AbstractCegarLoop]: Abstraction has 77932 states and 129702 transitions. [2019-09-10 09:08:46,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand 77932 states and 129702 transitions. [2019-09-10 09:08:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-10 09:08:46,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:46,190 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:08:46,190 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:46,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:46,190 INFO L82 PathProgramCache]: Analyzing trace with hash -621424257, now seen corresponding path program 1 times [2019-09-10 09:08:46,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:46,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:46,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:46,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:46,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:46,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:46,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:08:46,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:46,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:08:46,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:08:46,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:08:46,773 INFO L87 Difference]: Start difference. First operand 77932 states and 129702 transitions. Second operand 6 states. [2019-09-10 09:08:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:47,792 INFO L93 Difference]: Finished difference Result 165094 states and 275053 transitions. [2019-09-10 09:08:47,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:08:47,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 391 [2019-09-10 09:08:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:48,010 INFO L225 Difference]: With dead ends: 165094 [2019-09-10 09:08:48,011 INFO L226 Difference]: Without dead ends: 165094 [2019-09-10 09:08:48,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:08:48,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165094 states. [2019-09-10 09:08:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165094 to 164740. [2019-09-10 09:08:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164740 states. [2019-09-10 09:08:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164740 states to 164740 states and 274702 transitions. [2019-09-10 09:08:52,371 INFO L78 Accepts]: Start accepts. Automaton has 164740 states and 274702 transitions. Word has length 391 [2019-09-10 09:08:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:52,371 INFO L475 AbstractCegarLoop]: Abstraction has 164740 states and 274702 transitions. [2019-09-10 09:08:52,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:08:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 164740 states and 274702 transitions. [2019-09-10 09:08:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-10 09:08:52,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:52,418 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:08:52,418 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:52,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:52,418 INFO L82 PathProgramCache]: Analyzing trace with hash 374912513, now seen corresponding path program 1 times [2019-09-10 09:08:52,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:52,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:52,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:52,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:52,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:53,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:53,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:08:53,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:53,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:08:53,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:08:53,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:08:53,038 INFO L87 Difference]: Start difference. First operand 164740 states and 274702 transitions. Second operand 4 states. [2019-09-10 09:08:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:54,812 INFO L93 Difference]: Finished difference Result 427138 states and 703328 transitions. [2019-09-10 09:08:54,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:08:54,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 391 [2019-09-10 09:08:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:55,330 INFO L225 Difference]: With dead ends: 427138 [2019-09-10 09:08:55,330 INFO L226 Difference]: Without dead ends: 427138 [2019-09-10 09:08:55,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:08:55,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427138 states. [2019-09-10 09:09:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427138 to 427134. [2019-09-10 09:09:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427134 states. [2019-09-10 09:09:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427134 states to 427134 states and 703326 transitions. [2019-09-10 09:09:04,452 INFO L78 Accepts]: Start accepts. Automaton has 427134 states and 703326 transitions. Word has length 391 [2019-09-10 09:09:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:09:04,453 INFO L475 AbstractCegarLoop]: Abstraction has 427134 states and 703326 transitions. [2019-09-10 09:09:04,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:09:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 427134 states and 703326 transitions. [2019-09-10 09:09:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-10 09:09:04,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:09:04,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:09:04,538 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:09:04,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:09:04,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1371290731, now seen corresponding path program 1 times [2019-09-10 09:09:04,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:09:04,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:04,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:09:04,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:04,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:09:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:09:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:09:05,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:09:05,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:09:05,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:09:05,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:09:05,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:09:05,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:09:05,179 INFO L87 Difference]: Start difference. First operand 427134 states and 703326 transitions. Second operand 7 states. [2019-09-10 09:09:14,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:09:14,200 INFO L93 Difference]: Finished difference Result 1066178 states and 1761285 transitions. [2019-09-10 09:09:14,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 09:09:14,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 391 [2019-09-10 09:09:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:09:15,689 INFO L225 Difference]: With dead ends: 1066178 [2019-09-10 09:09:15,689 INFO L226 Difference]: Without dead ends: 1066178 [2019-09-10 09:09:15,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 09:09:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066178 states. [2019-09-10 09:09:33,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066178 to 578538. [2019-09-10 09:09:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578538 states. [2019-09-10 09:09:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578538 states to 578538 states and 953282 transitions. [2019-09-10 09:09:35,700 INFO L78 Accepts]: Start accepts. Automaton has 578538 states and 953282 transitions. Word has length 391 [2019-09-10 09:09:35,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:09:35,701 INFO L475 AbstractCegarLoop]: Abstraction has 578538 states and 953282 transitions. [2019-09-10 09:09:35,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:09:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 578538 states and 953282 transitions. [2019-09-10 09:09:35,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:09:35,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:09:35,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:09:35,807 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:09:35,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:09:35,807 INFO L82 PathProgramCache]: Analyzing trace with hash -985054710, now seen corresponding path program 1 times [2019-09-10 09:09:35,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:09:35,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:35,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:09:35,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:35,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:09:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:09:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:09:36,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:09:36,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:09:36,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:09:36,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:09:36,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:09:36,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:09:36,219 INFO L87 Difference]: Start difference. First operand 578538 states and 953282 transitions. Second operand 5 states. [2019-09-10 09:09:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:09:46,170 INFO L93 Difference]: Finished difference Result 969532 states and 1602149 transitions. [2019-09-10 09:09:46,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:09:46,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 392 [2019-09-10 09:09:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:09:48,360 INFO L225 Difference]: With dead ends: 969532 [2019-09-10 09:09:48,360 INFO L226 Difference]: Without dead ends: 969532 [2019-09-10 09:09:48,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:09:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969532 states. [2019-09-10 09:10:05,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969532 to 800490. [2019-09-10 09:10:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800490 states. [2019-09-10 09:10:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800490 states to 800490 states and 1319418 transitions. [2019-09-10 09:10:18,287 INFO L78 Accepts]: Start accepts. Automaton has 800490 states and 1319418 transitions. Word has length 392 [2019-09-10 09:10:18,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:10:18,288 INFO L475 AbstractCegarLoop]: Abstraction has 800490 states and 1319418 transitions. [2019-09-10 09:10:18,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:10:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 800490 states and 1319418 transitions. [2019-09-10 09:10:18,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:10:18,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:10:18,381 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:10:18,381 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:10:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:10:18,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1725796766, now seen corresponding path program 1 times [2019-09-10 09:10:18,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:10:18,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:10:18,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:10:18,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:10:18,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:10:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:10:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:10:18,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:10:18,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:10:18,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:10:18,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:10:18,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:10:18,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:10:18,886 INFO L87 Difference]: Start difference. First operand 800490 states and 1319418 transitions. Second operand 7 states. [2019-09-10 09:10:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:10:30,311 INFO L93 Difference]: Finished difference Result 1493504 states and 2459371 transitions. [2019-09-10 09:10:30,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 09:10:30,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 392 [2019-09-10 09:10:30,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:10:41,879 INFO L225 Difference]: With dead ends: 1493504 [2019-09-10 09:10:41,880 INFO L226 Difference]: Without dead ends: 1493504 [2019-09-10 09:10:41,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 09:10:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493504 states. [2019-09-10 09:10:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493504 to 1027606. [2019-09-10 09:10:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1027606 states. [2019-09-10 09:11:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027606 states to 1027606 states and 1692762 transitions. [2019-09-10 09:11:11,400 INFO L78 Accepts]: Start accepts. Automaton has 1027606 states and 1692762 transitions. Word has length 392 [2019-09-10 09:11:11,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:11,401 INFO L475 AbstractCegarLoop]: Abstraction has 1027606 states and 1692762 transitions. [2019-09-10 09:11:11,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:11:11,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1027606 states and 1692762 transitions. [2019-09-10 09:11:11,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:11:11,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:11,499 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:11:11,499 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:11,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:11,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1563714286, now seen corresponding path program 1 times [2019-09-10 09:11:11,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:11,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:11,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:11,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:11,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:11:14,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:14,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:11:14,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:14,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:11:14,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:11:14,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:11:14,445 INFO L87 Difference]: Start difference. First operand 1027606 states and 1692762 transitions. Second operand 6 states. [2019-09-10 09:11:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:28,570 INFO L93 Difference]: Finished difference Result 1419719 states and 2330848 transitions. [2019-09-10 09:11:28,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:11:28,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 392 [2019-09-10 09:11:28,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:30,780 INFO L225 Difference]: With dead ends: 1419719 [2019-09-10 09:11:30,780 INFO L226 Difference]: Without dead ends: 1419719 [2019-09-10 09:11:30,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:11:31,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419719 states. [2019-09-10 09:12:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419719 to 1419713. [2019-09-10 09:12:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419713 states.