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.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:05:33,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:05:33,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:05:33,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:05:33,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:05:33,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:05:33,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:05:33,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:05:33,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:05:33,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:05:33,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:05:33,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:05:33,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:05:33,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:05:33,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:05:33,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:05:33,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:05:33,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:05:33,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:05:33,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:05:33,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:05:33,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:05:33,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:05:33,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:05:33,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:05:33,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:05:33,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:05:33,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:05:33,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:05:33,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:05:33,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:05:33,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:05:33,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:05:33,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:05:33,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:05:33,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:05:33,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:05:33,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:05:33,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:05:33,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:05:33,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:05:33,263 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:05:33,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:05:33,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:05:33,278 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:05:33,279 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:05:33,279 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:05:33,280 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:05:33,280 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:05:33,280 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:05:33,280 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:05:33,280 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:05:33,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:05:33,281 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:05:33,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:05:33,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:05:33,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:05:33,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:05:33,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:05:33,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:05:33,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:05:33,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:05:33,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:05:33,283 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:05:33,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:05:33,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:05:33,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:05:33,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:05:33,284 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:05:33,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:05:33,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:05:33,285 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:05:33,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:05:33,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:05:33,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:05:33,333 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:05:33,333 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:05:33,334 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.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 09:05:33,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb2e650d/689cd0a43a2c4f11916357ffdbb4deea/FLAG20b09d2c5 [2019-09-10 09:05:34,133 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:05:34,134 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 09:05:34,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb2e650d/689cd0a43a2c4f11916357ffdbb4deea/FLAG20b09d2c5 [2019-09-10 09:05:34,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb2e650d/689cd0a43a2c4f11916357ffdbb4deea [2019-09-10 09:05:34,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:05:34,296 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:05:34,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:05:34,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:05:34,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:05:34,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:05:34" (1/1) ... [2019-09-10 09:05:34,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@315d73c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:05:34, skipping insertion in model container [2019-09-10 09:05:34,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:05:34" (1/1) ... [2019-09-10 09:05:34,320 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:05:34,512 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:05:36,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:05:36,146 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:05:37,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:05:37,393 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:05:37,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:05:37 WrapperNode [2019-09-10 09:05:37,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:05:37,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:05:37,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:05:37,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:05:37,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:05:37" (1/1) ... [2019-09-10 09:05:37,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:05:37" (1/1) ... [2019-09-10 09:05:37,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:05:37" (1/1) ... [2019-09-10 09:05:37,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:05:37" (1/1) ... [2019-09-10 09:05:37,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:05:37" (1/1) ... [2019-09-10 09:05:37,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:05:37" (1/1) ... [2019-09-10 09:05:37,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:05:37" (1/1) ... [2019-09-10 09:05:37,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:05:37,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:05:37,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:05:37,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:05:37,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:05:37" (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:05:37,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:05:37,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:05:37,674 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:05:37,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:05:37,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:05:37,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 09:05:37,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:05:37,677 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:05:37,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:05:37,677 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:05:37,678 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:05:37,678 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:05:37,678 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:05:37,679 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:05:37,680 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:05:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:05:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:05:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:05:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:05:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:05:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:05:42,352 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:05:42,353 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:05:42,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:05:42 BoogieIcfgContainer [2019-09-10 09:05:42,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:05:42,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:05:42,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:05:42,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:05:42,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:05:34" (1/3) ... [2019-09-10 09:05:42,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63aeeb17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:05:42, skipping insertion in model container [2019-09-10 09:05:42,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:05:37" (2/3) ... [2019-09-10 09:05:42,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63aeeb17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:05:42, skipping insertion in model container [2019-09-10 09:05:42,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:05:42" (3/3) ... [2019-09-10 09:05:42,374 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 09:05:42,390 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:05:42,418 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 09:05:42,447 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 09:05:42,501 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:05:42,502 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:05:42,502 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:05:42,502 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:05:42,502 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:05:42,503 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:05:42,503 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:05:42,503 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:05:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states. [2019-09-10 09:05:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-10 09:05:42,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:42,674 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:05:42,677 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:42,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:42,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1721455487, now seen corresponding path program 1 times [2019-09-10 09:05:42,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:42,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:42,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:42,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:42,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:45,455 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:05:45,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:45,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:05:45,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:45,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:05:45,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:05:45,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:05:45,480 INFO L87 Difference]: Start difference. First operand 1506 states. Second operand 4 states. [2019-09-10 09:05:46,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:46,031 INFO L93 Difference]: Finished difference Result 2971 states and 5339 transitions. [2019-09-10 09:05:46,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:05:46,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 493 [2019-09-10 09:05:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:46,078 INFO L225 Difference]: With dead ends: 2971 [2019-09-10 09:05:46,079 INFO L226 Difference]: Without dead ends: 2963 [2019-09-10 09:05:46,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:05:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2019-09-10 09:05:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2906. [2019-09-10 09:05:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2906 states. [2019-09-10 09:05:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 4772 transitions. [2019-09-10 09:05:46,293 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 4772 transitions. Word has length 493 [2019-09-10 09:05:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:46,298 INFO L475 AbstractCegarLoop]: Abstraction has 2906 states and 4772 transitions. [2019-09-10 09:05:46,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:05:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 4772 transitions. [2019-09-10 09:05:46,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-09-10 09:05:46,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:46,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:05:46,320 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:46,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:46,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1748288376, now seen corresponding path program 1 times [2019-09-10 09:05:46,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:46,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:46,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:46,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:46,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:47,208 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:05:47,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:47,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:47,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:47,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:47,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:47,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:47,213 INFO L87 Difference]: Start difference. First operand 2906 states and 4772 transitions. Second operand 3 states. [2019-09-10 09:05:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:47,488 INFO L93 Difference]: Finished difference Result 5747 states and 9405 transitions. [2019-09-10 09:05:47,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:47,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 495 [2019-09-10 09:05:47,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:47,525 INFO L225 Difference]: With dead ends: 5747 [2019-09-10 09:05:47,525 INFO L226 Difference]: Without dead ends: 5747 [2019-09-10 09:05:47,526 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:05:47,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5747 states. [2019-09-10 09:05:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5747 to 5692. [2019-09-10 09:05:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5692 states. [2019-09-10 09:05:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5692 states to 5692 states and 9324 transitions. [2019-09-10 09:05:47,712 INFO L78 Accepts]: Start accepts. Automaton has 5692 states and 9324 transitions. Word has length 495 [2019-09-10 09:05:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:47,715 INFO L475 AbstractCegarLoop]: Abstraction has 5692 states and 9324 transitions. [2019-09-10 09:05:47,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:47,716 INFO L276 IsEmpty]: Start isEmpty. Operand 5692 states and 9324 transitions. [2019-09-10 09:05:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-10 09:05:47,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:47,745 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:05:47,746 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:47,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:47,747 INFO L82 PathProgramCache]: Analyzing trace with hash -457766112, now seen corresponding path program 1 times [2019-09-10 09:05:47,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:47,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:47,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:47,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:47,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:48,113 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:05:48,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:48,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:48,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:48,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:48,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:48,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:48,116 INFO L87 Difference]: Start difference. First operand 5692 states and 9324 transitions. Second operand 3 states. [2019-09-10 09:05:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:48,259 INFO L93 Difference]: Finished difference Result 11339 states and 18560 transitions. [2019-09-10 09:05:48,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:48,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-09-10 09:05:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:48,314 INFO L225 Difference]: With dead ends: 11339 [2019-09-10 09:05:48,315 INFO L226 Difference]: Without dead ends: 11339 [2019-09-10 09:05:48,315 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:05:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11339 states. [2019-09-10 09:05:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11339 to 5739. [2019-09-10 09:05:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5739 states. [2019-09-10 09:05:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5739 states to 5739 states and 9398 transitions. [2019-09-10 09:05:48,572 INFO L78 Accepts]: Start accepts. Automaton has 5739 states and 9398 transitions. Word has length 496 [2019-09-10 09:05:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:48,573 INFO L475 AbstractCegarLoop]: Abstraction has 5739 states and 9398 transitions. [2019-09-10 09:05:48,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 5739 states and 9398 transitions. [2019-09-10 09:05:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-09-10 09:05:48,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:48,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:05:48,609 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:48,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:48,610 INFO L82 PathProgramCache]: Analyzing trace with hash 920522733, now seen corresponding path program 1 times [2019-09-10 09:05:48,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:48,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:48,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:48,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:48,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:49,379 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:05:49,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:49,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:49,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:49,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:49,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:49,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:49,382 INFO L87 Difference]: Start difference. First operand 5739 states and 9398 transitions. Second operand 3 states. [2019-09-10 09:05:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:49,602 INFO L93 Difference]: Finished difference Result 11201 states and 18249 transitions. [2019-09-10 09:05:49,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:49,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 497 [2019-09-10 09:05:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:49,652 INFO L225 Difference]: With dead ends: 11201 [2019-09-10 09:05:49,653 INFO L226 Difference]: Without dead ends: 11201 [2019-09-10 09:05:49,656 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:05:49,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11201 states. [2019-09-10 09:05:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11201 to 11148. [2019-09-10 09:05:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11148 states. [2019-09-10 09:05:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11148 states to 11148 states and 18172 transitions. [2019-09-10 09:05:50,004 INFO L78 Accepts]: Start accepts. Automaton has 11148 states and 18172 transitions. Word has length 497 [2019-09-10 09:05:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:50,005 INFO L475 AbstractCegarLoop]: Abstraction has 11148 states and 18172 transitions. [2019-09-10 09:05:50,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 11148 states and 18172 transitions. [2019-09-10 09:05:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-09-10 09:05:50,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:50,060 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:05:50,061 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:50,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:50,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1290800648, now seen corresponding path program 1 times [2019-09-10 09:05:50,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:50,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:50,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:50,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:50,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:50,878 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:05:50,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:50,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:50,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:50,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:50,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:50,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:50,881 INFO L87 Difference]: Start difference. First operand 11148 states and 18172 transitions. Second operand 3 states. [2019-09-10 09:05:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:51,039 INFO L93 Difference]: Finished difference Result 22184 states and 36134 transitions. [2019-09-10 09:05:51,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:51,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 497 [2019-09-10 09:05:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:51,093 INFO L225 Difference]: With dead ends: 22184 [2019-09-10 09:05:51,093 INFO L226 Difference]: Without dead ends: 22184 [2019-09-10 09:05:51,094 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:05:51,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22184 states. [2019-09-10 09:05:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22184 to 11246. [2019-09-10 09:05:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11246 states. [2019-09-10 09:05:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11246 states to 11246 states and 18323 transitions. [2019-09-10 09:05:51,404 INFO L78 Accepts]: Start accepts. Automaton has 11246 states and 18323 transitions. Word has length 497 [2019-09-10 09:05:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:51,404 INFO L475 AbstractCegarLoop]: Abstraction has 11246 states and 18323 transitions. [2019-09-10 09:05:51,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 11246 states and 18323 transitions. [2019-09-10 09:05:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2019-09-10 09:05:51,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:51,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:05:51,443 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:51,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:51,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2135163825, now seen corresponding path program 1 times [2019-09-10 09:05:51,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:51,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:51,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:51,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:51,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:51,720 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:05:51,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:51,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:51,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:51,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:51,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:51,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:51,723 INFO L87 Difference]: Start difference. First operand 11246 states and 18323 transitions. Second operand 3 states. [2019-09-10 09:05:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:51,889 INFO L93 Difference]: Finished difference Result 22301 states and 36280 transitions. [2019-09-10 09:05:51,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:51,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 498 [2019-09-10 09:05:51,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:51,950 INFO L225 Difference]: With dead ends: 22301 [2019-09-10 09:05:51,950 INFO L226 Difference]: Without dead ends: 22301 [2019-09-10 09:05:51,951 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:05:51,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22301 states. [2019-09-10 09:05:52,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22301 to 11363. [2019-09-10 09:05:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11363 states. [2019-09-10 09:05:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11363 states to 11363 states and 18469 transitions. [2019-09-10 09:05:52,396 INFO L78 Accepts]: Start accepts. Automaton has 11363 states and 18469 transitions. Word has length 498 [2019-09-10 09:05:52,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:52,397 INFO L475 AbstractCegarLoop]: Abstraction has 11363 states and 18469 transitions. [2019-09-10 09:05:52,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 11363 states and 18469 transitions. [2019-09-10 09:05:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-10 09:05:52,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:52,427 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:52,428 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:52,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:52,428 INFO L82 PathProgramCache]: Analyzing trace with hash 434343195, now seen corresponding path program 1 times [2019-09-10 09:05:52,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:52,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:52,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:52,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:52,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:52,744 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:05:52,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:52,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:52,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:52,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:52,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:52,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:52,746 INFO L87 Difference]: Start difference. First operand 11363 states and 18469 transitions. Second operand 3 states. [2019-09-10 09:05:52,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:52,898 INFO L93 Difference]: Finished difference Result 15101 states and 24414 transitions. [2019-09-10 09:05:52,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:52,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-09-10 09:05:52,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:52,934 INFO L225 Difference]: With dead ends: 15101 [2019-09-10 09:05:52,935 INFO L226 Difference]: Without dead ends: 15101 [2019-09-10 09:05:52,935 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:05:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15101 states. [2019-09-10 09:05:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15101 to 12963. [2019-09-10 09:05:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12963 states. [2019-09-10 09:05:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12963 states to 12963 states and 21117 transitions. [2019-09-10 09:05:53,158 INFO L78 Accepts]: Start accepts. Automaton has 12963 states and 21117 transitions. Word has length 499 [2019-09-10 09:05:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:53,159 INFO L475 AbstractCegarLoop]: Abstraction has 12963 states and 21117 transitions. [2019-09-10 09:05:53,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 12963 states and 21117 transitions. [2019-09-10 09:05:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-10 09:05:53,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:53,192 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:05:53,192 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1580825355, now seen corresponding path program 1 times [2019-09-10 09:05:53,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:53,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:53,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:53,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:53,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:54,199 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:05:54,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:54,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:05:54,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:54,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:05:54,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:05:54,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:05:54,202 INFO L87 Difference]: Start difference. First operand 12963 states and 21117 transitions. Second operand 4 states. [2019-09-10 09:05:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:54,383 INFO L93 Difference]: Finished difference Result 25284 states and 41101 transitions. [2019-09-10 09:05:54,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:05:54,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 499 [2019-09-10 09:05:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:54,448 INFO L225 Difference]: With dead ends: 25284 [2019-09-10 09:05:54,449 INFO L226 Difference]: Without dead ends: 25284 [2019-09-10 09:05:54,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:05:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25284 states. [2019-09-10 09:05:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25284 to 13898. [2019-09-10 09:05:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13898 states. [2019-09-10 09:05:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13898 states to 13898 states and 22765 transitions. [2019-09-10 09:05:54,748 INFO L78 Accepts]: Start accepts. Automaton has 13898 states and 22765 transitions. Word has length 499 [2019-09-10 09:05:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:54,748 INFO L475 AbstractCegarLoop]: Abstraction has 13898 states and 22765 transitions. [2019-09-10 09:05:54,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:05:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 13898 states and 22765 transitions. [2019-09-10 09:05:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-10 09:05:54,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:54,786 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:05:54,786 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:54,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:54,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1152436018, now seen corresponding path program 1 times [2019-09-10 09:05:54,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:54,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:54,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:54,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:54,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:55,890 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:05:55,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:55,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:55,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:55,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:55,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:55,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:55,892 INFO L87 Difference]: Start difference. First operand 13898 states and 22765 transitions. Second operand 3 states. [2019-09-10 09:05:56,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:56,121 INFO L93 Difference]: Finished difference Result 26424 states and 43038 transitions. [2019-09-10 09:05:56,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:56,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-09-10 09:05:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:56,192 INFO L225 Difference]: With dead ends: 26424 [2019-09-10 09:05:56,193 INFO L226 Difference]: Without dead ends: 26424 [2019-09-10 09:05:56,194 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:05:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26424 states. [2019-09-10 09:05:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26424 to 26373. [2019-09-10 09:05:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26373 states. [2019-09-10 09:05:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26373 states to 26373 states and 42965 transitions. [2019-09-10 09:05:56,664 INFO L78 Accepts]: Start accepts. Automaton has 26373 states and 42965 transitions. Word has length 499 [2019-09-10 09:05:56,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:56,665 INFO L475 AbstractCegarLoop]: Abstraction has 26373 states and 42965 transitions. [2019-09-10 09:05:56,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 26373 states and 42965 transitions. [2019-09-10 09:05:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-09-10 09:05:56,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:56,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:05:56,736 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:56,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:56,737 INFO L82 PathProgramCache]: Analyzing trace with hash 493143023, now seen corresponding path program 1 times [2019-09-10 09:05:56,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:56,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:56,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:56,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:56,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:57,118 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:05:57,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:57,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:57,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:57,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:57,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:57,125 INFO L87 Difference]: Start difference. First operand 26373 states and 42965 transitions. Second operand 3 states. [2019-09-10 09:05:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:57,319 INFO L93 Difference]: Finished difference Result 35617 states and 57814 transitions. [2019-09-10 09:05:57,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:57,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 501 [2019-09-10 09:05:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:57,375 INFO L225 Difference]: With dead ends: 35617 [2019-09-10 09:05:57,376 INFO L226 Difference]: Without dead ends: 35617 [2019-09-10 09:05:57,376 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:05:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35617 states. [2019-09-10 09:05:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35617 to 32085. [2019-09-10 09:05:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32085 states. [2019-09-10 09:05:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32085 states to 32085 states and 52405 transitions. [2019-09-10 09:05:58,008 INFO L78 Accepts]: Start accepts. Automaton has 32085 states and 52405 transitions. Word has length 501 [2019-09-10 09:05:58,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:58,008 INFO L475 AbstractCegarLoop]: Abstraction has 32085 states and 52405 transitions. [2019-09-10 09:05:58,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 32085 states and 52405 transitions. [2019-09-10 09:05:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-09-10 09:05:58,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:58,038 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:58,038 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1370211641, now seen corresponding path program 1 times [2019-09-10 09:05:58,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:58,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:58,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:58,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:58,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:59,645 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:05:59,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:59,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:05:59,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:59,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:05:59,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:05:59,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:05:59,648 INFO L87 Difference]: Start difference. First operand 32085 states and 52405 transitions. Second operand 4 states. [2019-09-10 09:06:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:00,145 INFO L93 Difference]: Finished difference Result 62585 states and 101837 transitions. [2019-09-10 09:06:00,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:06:00,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 502 [2019-09-10 09:06:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:00,253 INFO L225 Difference]: With dead ends: 62585 [2019-09-10 09:06:00,253 INFO L226 Difference]: Without dead ends: 62585 [2019-09-10 09:06:00,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:06:00,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62585 states. [2019-09-10 09:06:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62585 to 62540. [2019-09-10 09:06:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62540 states. [2019-09-10 09:06:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62540 states to 62540 states and 101772 transitions. [2019-09-10 09:06:02,191 INFO L78 Accepts]: Start accepts. Automaton has 62540 states and 101772 transitions. Word has length 502 [2019-09-10 09:06:02,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:02,192 INFO L475 AbstractCegarLoop]: Abstraction has 62540 states and 101772 transitions. [2019-09-10 09:06:02,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:06:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 62540 states and 101772 transitions. [2019-09-10 09:06:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2019-09-10 09:06:02,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:02,242 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:02,243 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:02,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:02,243 INFO L82 PathProgramCache]: Analyzing trace with hash 68937512, now seen corresponding path program 1 times [2019-09-10 09:06:02,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:02,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:02,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:02,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:02,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:02,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:02,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:02,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:02,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:02,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:02,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:02,775 INFO L87 Difference]: Start difference. First operand 62540 states and 101772 transitions. Second operand 3 states. [2019-09-10 09:06:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:03,147 INFO L93 Difference]: Finished difference Result 122103 states and 197796 transitions. [2019-09-10 09:06:03,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:03,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 504 [2019-09-10 09:06:03,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:03,291 INFO L225 Difference]: With dead ends: 122103 [2019-09-10 09:06:03,291 INFO L226 Difference]: Without dead ends: 122103 [2019-09-10 09:06:03,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122103 states. [2019-09-10 09:06:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122103 to 122060. [2019-09-10 09:06:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122060 states. [2019-09-10 09:06:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122060 states to 122060 states and 197735 transitions. [2019-09-10 09:06:06,216 INFO L78 Accepts]: Start accepts. Automaton has 122060 states and 197735 transitions. Word has length 504 [2019-09-10 09:06:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:06,217 INFO L475 AbstractCegarLoop]: Abstraction has 122060 states and 197735 transitions. [2019-09-10 09:06:06,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 122060 states and 197735 transitions. [2019-09-10 09:06:06,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2019-09-10 09:06:06,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:06,298 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:06,299 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:06,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:06,300 INFO L82 PathProgramCache]: Analyzing trace with hash -252481168, now seen corresponding path program 1 times [2019-09-10 09:06:06,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:06,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:06,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:06,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:06,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:06,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:06,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:06,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:06,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:06,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:06,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:06,589 INFO L87 Difference]: Start difference. First operand 122060 states and 197735 transitions. Second operand 3 states. [2019-09-10 09:06:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:09,487 INFO L93 Difference]: Finished difference Result 233926 states and 376977 transitions. [2019-09-10 09:06:09,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:09,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 504 [2019-09-10 09:06:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:09,733 INFO L225 Difference]: With dead ends: 233926 [2019-09-10 09:06:09,733 INFO L226 Difference]: Without dead ends: 233926 [2019-09-10 09:06:09,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:09,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233926 states. [2019-09-10 09:06:11,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233926 to 123822. [2019-09-10 09:06:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123822 states. [2019-09-10 09:06:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123822 states to 123822 states and 200393 transitions. [2019-09-10 09:06:11,391 INFO L78 Accepts]: Start accepts. Automaton has 123822 states and 200393 transitions. Word has length 504 [2019-09-10 09:06:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:11,391 INFO L475 AbstractCegarLoop]: Abstraction has 123822 states and 200393 transitions. [2019-09-10 09:06:11,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 123822 states and 200393 transitions. [2019-09-10 09:06:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-09-10 09:06:11,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:11,996 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:11,996 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:11,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:11,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1705109268, now seen corresponding path program 1 times [2019-09-10 09:06:11,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:11,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:11,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:11,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:11,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:12,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:12,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:12,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:12,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:12,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:12,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:12,333 INFO L87 Difference]: Start difference. First operand 123822 states and 200393 transitions. Second operand 3 states. [2019-09-10 09:06:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:12,959 INFO L93 Difference]: Finished difference Result 177870 states and 287954 transitions. [2019-09-10 09:06:12,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:12,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 505 [2019-09-10 09:06:12,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:13,205 INFO L225 Difference]: With dead ends: 177870 [2019-09-10 09:06:13,206 INFO L226 Difference]: Without dead ends: 177870 [2019-09-10 09:06:13,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177870 states. [2019-09-10 09:06:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177870 to 164078. [2019-09-10 09:06:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164078 states. [2019-09-10 09:06:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164078 states to 164078 states and 266537 transitions. [2019-09-10 09:06:17,525 INFO L78 Accepts]: Start accepts. Automaton has 164078 states and 266537 transitions. Word has length 505 [2019-09-10 09:06:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:17,526 INFO L475 AbstractCegarLoop]: Abstraction has 164078 states and 266537 transitions. [2019-09-10 09:06:17,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 164078 states and 266537 transitions. [2019-09-10 09:06:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-09-10 09:06:17,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:17,597 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:17,597 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:17,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1657302847, now seen corresponding path program 1 times [2019-09-10 09:06:17,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:17,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:17,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:17,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:17,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:17,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:17,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:17,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:17,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:17,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:17,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:17,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:17,892 INFO L87 Difference]: Start difference. First operand 164078 states and 266537 transitions. Second operand 3 states. [2019-09-10 09:06:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:18,647 INFO L93 Difference]: Finished difference Result 316860 states and 512678 transitions. [2019-09-10 09:06:18,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:18,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 505 [2019-09-10 09:06:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:19,088 INFO L225 Difference]: With dead ends: 316860 [2019-09-10 09:06:19,089 INFO L226 Difference]: Without dead ends: 316860 [2019-09-10 09:06:19,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316860 states. [2019-09-10 09:06:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316860 to 166628. [2019-09-10 09:06:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166628 states. [2019-09-10 09:06:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166628 states to 166628 states and 270206 transitions. [2019-09-10 09:06:22,434 INFO L78 Accepts]: Start accepts. Automaton has 166628 states and 270206 transitions. Word has length 505 [2019-09-10 09:06:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:22,434 INFO L475 AbstractCegarLoop]: Abstraction has 166628 states and 270206 transitions. [2019-09-10 09:06:22,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 166628 states and 270206 transitions. [2019-09-10 09:06:22,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2019-09-10 09:06:22,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:22,499 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:22,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:22,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1317208899, now seen corresponding path program 1 times [2019-09-10 09:06:22,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:22,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:22,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:22,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:22,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:26,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:26,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:26,883 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:26,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:26,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:26,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:26,885 INFO L87 Difference]: Start difference. First operand 166628 states and 270206 transitions. Second operand 3 states. [2019-09-10 09:06:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:27,789 INFO L93 Difference]: Finished difference Result 328759 states and 531307 transitions. [2019-09-10 09:06:27,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:27,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 506 [2019-09-10 09:06:27,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:28,252 INFO L225 Difference]: With dead ends: 328759 [2019-09-10 09:06:28,252 INFO L226 Difference]: Without dead ends: 328759 [2019-09-10 09:06:28,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:28,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328759 states. [2019-09-10 09:06:31,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328759 to 328718. [2019-09-10 09:06:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328718 states. [2019-09-10 09:06:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328718 states to 328718 states and 531250 transitions. [2019-09-10 09:06:38,382 INFO L78 Accepts]: Start accepts. Automaton has 328718 states and 531250 transitions. Word has length 506 [2019-09-10 09:06:38,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:38,382 INFO L475 AbstractCegarLoop]: Abstraction has 328718 states and 531250 transitions. [2019-09-10 09:06:38,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:38,383 INFO L276 IsEmpty]: Start isEmpty. Operand 328718 states and 531250 transitions. [2019-09-10 09:06:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-10 09:06:38,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:38,506 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:38,506 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:38,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:38,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1780361346, now seen corresponding path program 1 times [2019-09-10 09:06:38,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:38,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:38,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:38,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:38,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:38,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:38,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:38,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:38,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:38,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:38,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:38,917 INFO L87 Difference]: Start difference. First operand 328718 states and 531250 transitions. Second operand 3 states. [2019-09-10 09:06:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:40,322 INFO L93 Difference]: Finished difference Result 645502 states and 1039078 transitions. [2019-09-10 09:06:40,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:40,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 508 [2019-09-10 09:06:40,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:41,179 INFO L225 Difference]: With dead ends: 645502 [2019-09-10 09:06:41,179 INFO L226 Difference]: Without dead ends: 645502 [2019-09-10 09:06:41,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645502 states. [2019-09-10 09:06:59,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645502 to 645463. [2019-09-10 09:06:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645463 states. [2019-09-10 09:07:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645463 states to 645463 states and 1039025 transitions. [2019-09-10 09:07:01,325 INFO L78 Accepts]: Start accepts. Automaton has 645463 states and 1039025 transitions. Word has length 508 [2019-09-10 09:07:01,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:01,326 INFO L475 AbstractCegarLoop]: Abstraction has 645463 states and 1039025 transitions. [2019-09-10 09:07:01,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:01,326 INFO L276 IsEmpty]: Start isEmpty. Operand 645463 states and 1039025 transitions. [2019-09-10 09:07:01,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-10 09:07:01,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:01,686 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:01,686 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:01,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:01,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1512920997, now seen corresponding path program 1 times [2019-09-10 09:07:01,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:01,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:01,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:01,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:01,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:02,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:02,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:07:02,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:02,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:07:02,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:07:02,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:07:02,385 INFO L87 Difference]: Start difference. First operand 645463 states and 1039025 transitions. Second operand 4 states. [2019-09-10 09:07:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:11,708 INFO L93 Difference]: Finished difference Result 1209821 states and 1943423 transitions. [2019-09-10 09:07:11,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:07:11,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 508 [2019-09-10 09:07:11,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:13,431 INFO L225 Difference]: With dead ends: 1209821 [2019-09-10 09:07:13,431 INFO L226 Difference]: Without dead ends: 1209821 [2019-09-10 09:07:13,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:07:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209821 states. [2019-09-10 09:07:33,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209821 to 660161. [2019-09-10 09:07:33,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660161 states. [2019-09-10 09:07:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660161 states to 660161 states and 1065026 transitions. [2019-09-10 09:07:34,965 INFO L78 Accepts]: Start accepts. Automaton has 660161 states and 1065026 transitions. Word has length 508 [2019-09-10 09:07:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:34,965 INFO L475 AbstractCegarLoop]: Abstraction has 660161 states and 1065026 transitions. [2019-09-10 09:07:34,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:07:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 660161 states and 1065026 transitions. [2019-09-10 09:07:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-09-10 09:07:44,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:44,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:44,363 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:44,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1373317365, now seen corresponding path program 1 times [2019-09-10 09:07:44,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:44,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:44,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:44,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:44,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:44,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:44,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:44,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:44,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:44,705 INFO L87 Difference]: Start difference. First operand 660161 states and 1065026 transitions. Second operand 3 states. [2019-09-10 09:07:47,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:47,966 INFO L93 Difference]: Finished difference Result 1023907 states and 1651843 transitions. [2019-09-10 09:07:47,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:47,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 510 [2019-09-10 09:07:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:50,688 INFO L225 Difference]: With dead ends: 1023907 [2019-09-10 09:07:50,688 INFO L226 Difference]: Without dead ends: 1023907 [2019-09-10 09:07:50,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023907 states. [2019-09-10 09:08:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023907 to 945601. [2019-09-10 09:08:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945601 states. [2019-09-10 09:08:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945601 states to 945601 states and 1534658 transitions. [2019-09-10 09:08:24,163 INFO L78 Accepts]: Start accepts. Automaton has 945601 states and 1534658 transitions. Word has length 510 [2019-09-10 09:08:24,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:24,164 INFO L475 AbstractCegarLoop]: Abstraction has 945601 states and 1534658 transitions. [2019-09-10 09:08:24,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 945601 states and 1534658 transitions. [2019-09-10 09:08:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-09-10 09:08:26,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:26,543 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,544 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:26,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:26,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1277584190, now seen corresponding path program 1 times [2019-09-10 09:08:26,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:26,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:26,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:26,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:26,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:27,124 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,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:27,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 09:08:27,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:27,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 09:08:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 09:08:27,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:08:27,127 INFO L87 Difference]: Start difference. First operand 945601 states and 1534658 transitions. Second operand 9 states.