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+nlh-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,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:05:33,226 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,229 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,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:05:33,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:05:33,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:05:33,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:05:33,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:05:33,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:05:33,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:05:33,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:05:33,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:05:33,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:05:33,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:05:33,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:05:33,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:05:33,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:05:33,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:05:33,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:05:33,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:05:33,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:05:33,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:05:33,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:05:33,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:05:33,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:05:33,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:05:33,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:05:33,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:05:33,259 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,274 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:05:33,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:05:33,274 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:05:33,274 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:05:33,275 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:05:33,275 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:05:33,275 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:05:33,276 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:05:33,276 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:05:33,276 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:05:33,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:05:33,277 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:05:33,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:05:33,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:05:33,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:05:33,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:05:33,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:05:33,278 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:05:33,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:05:33,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:05:33,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:05:33,279 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:05:33,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:05:33,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:05:33,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:05:33,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:05:33,280 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:05:33,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:05:33,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:05:33,281 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:05:33,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:05:33,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:05:33,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:05:33,348 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:05:33,349 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:05:33,350 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+nlh-reducer.c [2019-09-10 09:05:33,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94310163/e3e37fc12581476cb2438c1e269410f8/FLAG30217a6b8 [2019-09-10 09:05:34,135 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:05:34,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 09:05:34,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94310163/e3e37fc12581476cb2438c1e269410f8/FLAG30217a6b8 [2019-09-10 09:05:34,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94310163/e3e37fc12581476cb2438c1e269410f8 [2019-09-10 09:05:34,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:05:34,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:05:34,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:05:34,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:05:34,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:05:34,296 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,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4967aa79 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,301 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,309 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:05:34,510 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:05:36,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:05:36,098 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:05:37,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:05:37,664 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:05:37,664 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,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:05:37,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:05:37,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:05:37,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:05:37,689 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,689 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,727 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,728 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,844 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,913 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,945 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,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:05:37,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:05:37,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:05:37,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:05:37,979 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:38,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:05:38,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:05:38,062 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:05:38,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:05:38,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:05:38,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 09:05:38,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:05:38,063 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:05:38,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:05:38,064 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:05:38,064 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:05:38,065 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:05:38,065 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:05:38,066 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:05:38,066 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:05:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:05:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:05:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:05:38,068 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:05:38,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:05:38,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:05:42,655 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:05:42,656 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:05:42,658 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,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:05:42,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:05:42,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:05:42,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:05:42,664 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,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a5f35 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,665 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,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a5f35 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,666 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,668 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 09:05:42,679 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:05:42,690 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:05:42,711 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:05:42,744 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:05:42,744 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:05:42,744 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:05:42,744 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:05:42,745 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:05:42,745 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:05:42,745 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:05:42,745 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:05:42,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states. [2019-09-10 09:05:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-10 09:05:42,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:42,833 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:42,836 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:42,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:42,843 INFO L82 PathProgramCache]: Analyzing trace with hash -710660715, now seen corresponding path program 1 times [2019-09-10 09:05:42,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:42,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:42,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:42,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:42,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:44,310 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:44,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:44,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:44,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:44,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:44,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:44,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:44,338 INFO L87 Difference]: Start difference. First operand 1449 states. Second operand 3 states. [2019-09-10 09:05:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:44,747 INFO L93 Difference]: Finished difference Result 2194 states and 3911 transitions. [2019-09-10 09:05:44,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:44,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-09-10 09:05:44,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:44,789 INFO L225 Difference]: With dead ends: 2194 [2019-09-10 09:05:44,789 INFO L226 Difference]: Without dead ends: 2186 [2019-09-10 09:05:44,793 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:44,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2019-09-10 09:05:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2184. [2019-09-10 09:05:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2184 states. [2019-09-10 09:05:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3563 transitions. [2019-09-10 09:05:44,976 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3563 transitions. Word has length 496 [2019-09-10 09:05:44,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:44,982 INFO L475 AbstractCegarLoop]: Abstraction has 2184 states and 3563 transitions. [2019-09-10 09:05:44,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3563 transitions. [2019-09-10 09:05:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-10 09:05:44,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:45,000 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:45,000 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:45,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:45,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1749636116, now seen corresponding path program 1 times [2019-09-10 09:05:45,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:45,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:45,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:45,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:45,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:46,917 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:46,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:46,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:05:46,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:46,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:05:46,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:05:46,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:05:46,921 INFO L87 Difference]: Start difference. First operand 2184 states and 3563 transitions. Second operand 4 states. [2019-09-10 09:05:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:47,225 INFO L93 Difference]: Finished difference Result 4309 states and 7001 transitions. [2019-09-10 09:05:47,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:05:47,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 496 [2019-09-10 09:05:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:47,255 INFO L225 Difference]: With dead ends: 4309 [2019-09-10 09:05:47,255 INFO L226 Difference]: Without dead ends: 4309 [2019-09-10 09:05:47,256 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:47,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2019-09-10 09:05:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 4307. [2019-09-10 09:05:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4307 states. [2019-09-10 09:05:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4307 states to 4307 states and 7000 transitions. [2019-09-10 09:05:47,411 INFO L78 Accepts]: Start accepts. Automaton has 4307 states and 7000 transitions. Word has length 496 [2019-09-10 09:05:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:47,411 INFO L475 AbstractCegarLoop]: Abstraction has 4307 states and 7000 transitions. [2019-09-10 09:05:47,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:05:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4307 states and 7000 transitions. [2019-09-10 09:05:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2019-09-10 09:05:47,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:47,432 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:47,432 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:47,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:47,433 INFO L82 PathProgramCache]: Analyzing trace with hash 471797169, now seen corresponding path program 1 times [2019-09-10 09:05:47,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:47,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:47,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:47,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:47,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:48,082 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,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:48,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:48,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:48,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:48,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:48,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:48,085 INFO L87 Difference]: Start difference. First operand 4307 states and 7000 transitions. Second operand 3 states. [2019-09-10 09:05:48,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:48,287 INFO L93 Difference]: Finished difference Result 8512 states and 13786 transitions. [2019-09-10 09:05:48,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:48,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 498 [2019-09-10 09:05:48,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:48,347 INFO L225 Difference]: With dead ends: 8512 [2019-09-10 09:05:48,348 INFO L226 Difference]: Without dead ends: 8512 [2019-09-10 09:05:48,349 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,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8512 states. [2019-09-10 09:05:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8512 to 8510. [2019-09-10 09:05:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8510 states. [2019-09-10 09:05:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8510 states to 8510 states and 13785 transitions. [2019-09-10 09:05:48,588 INFO L78 Accepts]: Start accepts. Automaton has 8510 states and 13785 transitions. Word has length 498 [2019-09-10 09:05:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:48,589 INFO L475 AbstractCegarLoop]: Abstraction has 8510 states and 13785 transitions. [2019-09-10 09:05:48,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 8510 states and 13785 transitions. [2019-09-10 09:05:48,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-10 09:05:48,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:48,617 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:48,617 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:48,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:48,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1263260306, now seen corresponding path program 1 times [2019-09-10 09:05:48,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:48,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:48,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:48,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:48,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:49,088 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,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:49,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:49,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:49,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:49,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:49,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:49,092 INFO L87 Difference]: Start difference. First operand 8510 states and 13785 transitions. Second operand 3 states. [2019-09-10 09:05:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:49,268 INFO L93 Difference]: Finished difference Result 16975 states and 27482 transitions. [2019-09-10 09:05:49,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:49,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-09-10 09:05:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:49,363 INFO L225 Difference]: With dead ends: 16975 [2019-09-10 09:05:49,364 INFO L226 Difference]: Without dead ends: 16975 [2019-09-10 09:05:49,364 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,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16975 states. [2019-09-10 09:05:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16975 to 8557. [2019-09-10 09:05:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8557 states. [2019-09-10 09:05:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8557 states to 8557 states and 13859 transitions. [2019-09-10 09:05:49,664 INFO L78 Accepts]: Start accepts. Automaton has 8557 states and 13859 transitions. Word has length 499 [2019-09-10 09:05:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:49,664 INFO L475 AbstractCegarLoop]: Abstraction has 8557 states and 13859 transitions. [2019-09-10 09:05:49,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 8557 states and 13859 transitions. [2019-09-10 09:05:49,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-10 09:05:49,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:49,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,688 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:49,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:49,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1263344305, now seen corresponding path program 1 times [2019-09-10 09:05:49,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:49,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:49,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:49,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:49,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:05:49,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:49,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:49,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:49,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:49,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:49,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:49,997 INFO L87 Difference]: Start difference. First operand 8557 states and 13859 transitions. Second operand 3 states. [2019-09-10 09:05:50,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:50,094 INFO L93 Difference]: Finished difference Result 17038 states and 27575 transitions. [2019-09-10 09:05:50,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:50,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 500 [2019-09-10 09:05:50,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:50,130 INFO L225 Difference]: With dead ends: 17038 [2019-09-10 09:05:50,130 INFO L226 Difference]: Without dead ends: 17038 [2019-09-10 09:05:50,131 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:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17038 states. [2019-09-10 09:05:50,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17038 to 8628. [2019-09-10 09:05:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8628 states. [2019-09-10 09:05:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8628 states to 8628 states and 13968 transitions. [2019-09-10 09:05:50,411 INFO L78 Accepts]: Start accepts. Automaton has 8628 states and 13968 transitions. Word has length 500 [2019-09-10 09:05:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:50,411 INFO L475 AbstractCegarLoop]: Abstraction has 8628 states and 13968 transitions. [2019-09-10 09:05:50,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:50,411 INFO L276 IsEmpty]: Start isEmpty. Operand 8628 states and 13968 transitions. [2019-09-10 09:05:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-10 09:05:50,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:50,433 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] [2019-09-10 09:05:50,434 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:50,434 INFO L82 PathProgramCache]: Analyzing trace with hash -210005332, now seen corresponding path program 1 times [2019-09-10 09:05:50,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:50,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:50,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:50,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:50,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:51,151 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,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:51,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:51,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:51,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:51,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:51,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:51,154 INFO L87 Difference]: Start difference. First operand 8628 states and 13968 transitions. Second operand 3 states. [2019-09-10 09:05:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:51,342 INFO L93 Difference]: Finished difference Result 16860 states and 27169 transitions. [2019-09-10 09:05:51,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:51,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 500 [2019-09-10 09:05:51,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:51,377 INFO L225 Difference]: With dead ends: 16860 [2019-09-10 09:05:51,377 INFO L226 Difference]: Without dead ends: 16860 [2019-09-10 09:05:51,378 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,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16860 states. [2019-09-10 09:05:51,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16860 to 16858. [2019-09-10 09:05:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16858 states. [2019-09-10 09:05:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16858 states to 16858 states and 27168 transitions. [2019-09-10 09:05:51,648 INFO L78 Accepts]: Start accepts. Automaton has 16858 states and 27168 transitions. Word has length 500 [2019-09-10 09:05:51,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:51,649 INFO L475 AbstractCegarLoop]: Abstraction has 16858 states and 27168 transitions. [2019-09-10 09:05:51,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 16858 states and 27168 transitions. [2019-09-10 09:05:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-09-10 09:05:51,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:51,690 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:51,693 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:51,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1043556226, now seen corresponding path program 1 times [2019-09-10 09:05:51,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:51,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:51,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:51,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:51,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:52,536 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,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:52,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:52,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:52,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:52,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:52,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:52,539 INFO L87 Difference]: Start difference. First operand 16858 states and 27168 transitions. Second operand 3 states. [2019-09-10 09:05:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:52,680 INFO L93 Difference]: Finished difference Result 33525 states and 53970 transitions. [2019-09-10 09:05:52,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:52,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 501 [2019-09-10 09:05:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:52,762 INFO L225 Difference]: With dead ends: 33525 [2019-09-10 09:05:52,762 INFO L226 Difference]: Without dead ends: 33525 [2019-09-10 09:05:52,763 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,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33525 states. [2019-09-10 09:05:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33525 to 16975. [2019-09-10 09:05:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16975 states. [2019-09-10 09:05:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16975 states to 16975 states and 27314 transitions. [2019-09-10 09:05:53,200 INFO L78 Accepts]: Start accepts. Automaton has 16975 states and 27314 transitions. Word has length 501 [2019-09-10 09:05:53,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:53,200 INFO L475 AbstractCegarLoop]: Abstraction has 16975 states and 27314 transitions. [2019-09-10 09:05:53,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 16975 states and 27314 transitions. [2019-09-10 09:05:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-09-10 09:05:53,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:53,245 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:53,246 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:53,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:53,247 INFO L82 PathProgramCache]: Analyzing trace with hash 317954470, now seen corresponding path program 1 times [2019-09-10 09:05:53,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:53,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:53,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:53,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:53,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:53,672 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:53,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:53,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:53,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:53,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:53,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:53,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:53,676 INFO L87 Difference]: Start difference. First operand 16975 states and 27314 transitions. Second operand 3 states. [2019-09-10 09:05:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:53,876 INFO L93 Difference]: Finished difference Result 24449 states and 39231 transitions. [2019-09-10 09:05:53,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:53,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 502 [2019-09-10 09:05:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:53,945 INFO L225 Difference]: With dead ends: 24449 [2019-09-10 09:05:53,946 INFO L226 Difference]: Without dead ends: 24449 [2019-09-10 09:05:53,946 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:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24449 states. [2019-09-10 09:05:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24449 to 20175. [2019-09-10 09:05:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20175 states. [2019-09-10 09:05:54,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20175 states to 20175 states and 32638 transitions. [2019-09-10 09:05:54,419 INFO L78 Accepts]: Start accepts. Automaton has 20175 states and 32638 transitions. Word has length 502 [2019-09-10 09:05:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:54,419 INFO L475 AbstractCegarLoop]: Abstraction has 20175 states and 32638 transitions. [2019-09-10 09:05:54,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 20175 states and 32638 transitions. [2019-09-10 09:05:54,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-09-10 09:05:54,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:54,450 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:54,451 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:54,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:54,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1257605063, now seen corresponding path program 1 times [2019-09-10 09:05:54,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:54,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:54,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:54,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:54,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:55,228 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,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:55,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:55,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:55,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:55,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:55,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:55,231 INFO L87 Difference]: Start difference. First operand 20175 states and 32638 transitions. Second operand 3 states. [2019-09-10 09:05:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:55,487 INFO L93 Difference]: Finished difference Result 39356 states and 63396 transitions. [2019-09-10 09:05:55,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:55,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 502 [2019-09-10 09:05:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:55,584 INFO L225 Difference]: With dead ends: 39356 [2019-09-10 09:05:55,584 INFO L226 Difference]: Without dead ends: 39356 [2019-09-10 09:05:55,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39356 states. [2019-09-10 09:05:56,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39356 to 39354. [2019-09-10 09:05:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39354 states. [2019-09-10 09:05:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39354 states to 39354 states and 63395 transitions. [2019-09-10 09:05:56,467 INFO L78 Accepts]: Start accepts. Automaton has 39354 states and 63395 transitions. Word has length 502 [2019-09-10 09:05:56,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:56,468 INFO L475 AbstractCegarLoop]: Abstraction has 39354 states and 63395 transitions. [2019-09-10 09:05:56,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 39354 states and 63395 transitions. [2019-09-10 09:05:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-09-10 09:05:56,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:56,523 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:56,524 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:56,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:56,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1341960412, now seen corresponding path program 1 times [2019-09-10 09:05:56,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:56,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:56,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:56,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:56,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:57,253 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,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:57,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:05:57,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:57,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:05:57,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:05:57,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:05:57,256 INFO L87 Difference]: Start difference. First operand 39354 states and 63395 transitions. Second operand 4 states. [2019-09-10 09:05:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:57,568 INFO L93 Difference]: Finished difference Result 75214 states and 120919 transitions. [2019-09-10 09:05:57,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:05:57,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 502 [2019-09-10 09:05:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:57,836 INFO L225 Difference]: With dead ends: 75214 [2019-09-10 09:05:57,836 INFO L226 Difference]: Without dead ends: 75214 [2019-09-10 09:05:57,837 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:57,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75214 states. [2019-09-10 09:05:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75214 to 40647. [2019-09-10 09:05:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40647 states. [2019-09-10 09:05:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40647 states to 40647 states and 65674 transitions. [2019-09-10 09:05:59,944 INFO L78 Accepts]: Start accepts. Automaton has 40647 states and 65674 transitions. Word has length 502 [2019-09-10 09:05:59,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:59,945 INFO L475 AbstractCegarLoop]: Abstraction has 40647 states and 65674 transitions. [2019-09-10 09:05:59,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:05:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 40647 states and 65674 transitions. [2019-09-10 09:05:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2019-09-10 09:05:59,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:59,979 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:05:59,979 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:59,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:59,980 INFO L82 PathProgramCache]: Analyzing trace with hash 231276154, now seen corresponding path program 1 times [2019-09-10 09:05:59,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:59,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:59,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:59,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:59,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:00,339 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:00,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:00,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:00,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:00,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:00,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:00,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:00,342 INFO L87 Difference]: Start difference. First operand 40647 states and 65674 transitions. Second operand 3 states. [2019-09-10 09:06:00,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:00,834 INFO L93 Difference]: Finished difference Result 58985 states and 95171 transitions. [2019-09-10 09:06:00,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:00,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 504 [2019-09-10 09:06:00,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:00,910 INFO L225 Difference]: With dead ends: 58985 [2019-09-10 09:06:00,910 INFO L226 Difference]: Without dead ends: 58985 [2019-09-10 09:06:00,910 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:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58985 states. [2019-09-10 09:06:01,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58985 to 52071. [2019-09-10 09:06:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52071 states. [2019-09-10 09:06:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52071 states to 52071 states and 84594 transitions. [2019-09-10 09:06:01,533 INFO L78 Accepts]: Start accepts. Automaton has 52071 states and 84594 transitions. Word has length 504 [2019-09-10 09:06:01,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:01,534 INFO L475 AbstractCegarLoop]: Abstraction has 52071 states and 84594 transitions. [2019-09-10 09:06:01,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:01,534 INFO L276 IsEmpty]: Start isEmpty. Operand 52071 states and 84594 transitions. [2019-09-10 09:06:01,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-09-10 09:06:01,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:01,568 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:01,568 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:01,569 INFO L82 PathProgramCache]: Analyzing trace with hash 863061750, now seen corresponding path program 1 times [2019-09-10 09:06:01,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:01,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:01,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:01,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:01,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:02,783 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,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:02,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 09:06:02,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:02,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 09:06:02,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 09:06:02,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:06:02,787 INFO L87 Difference]: Start difference. First operand 52071 states and 84594 transitions. Second operand 9 states. [2019-09-10 09:06:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:05,601 INFO L93 Difference]: Finished difference Result 113881 states and 182753 transitions. [2019-09-10 09:06:05,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 09:06:05,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 505 [2019-09-10 09:06:05,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:05,738 INFO L225 Difference]: With dead ends: 113881 [2019-09-10 09:06:05,738 INFO L226 Difference]: Without dead ends: 113881 [2019-09-10 09:06:05,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-10 09:06:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113881 states. [2019-09-10 09:06:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113881 to 64663. [2019-09-10 09:06:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64663 states. [2019-09-10 09:06:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64663 states to 64663 states and 103282 transitions. [2019-09-10 09:06:08,268 INFO L78 Accepts]: Start accepts. Automaton has 64663 states and 103282 transitions. Word has length 505 [2019-09-10 09:06:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:08,269 INFO L475 AbstractCegarLoop]: Abstraction has 64663 states and 103282 transitions. [2019-09-10 09:06:08,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 09:06:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 64663 states and 103282 transitions. [2019-09-10 09:06:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-09-10 09:06:08,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:08,305 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:08,306 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:08,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1740791442, now seen corresponding path program 1 times [2019-09-10 09:06:08,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:08,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:08,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:08,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:08,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:09,629 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:09,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:09,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:06:09,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:09,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:06:09,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:06:09,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:06:09,631 INFO L87 Difference]: Start difference. First operand 64663 states and 103282 transitions. Second operand 4 states. [2019-09-10 09:06:09,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:09,987 INFO L93 Difference]: Finished difference Result 126702 states and 201754 transitions. [2019-09-10 09:06:09,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:06:09,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2019-09-10 09:06:09,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:10,118 INFO L225 Difference]: With dead ends: 126702 [2019-09-10 09:06:10,118 INFO L226 Difference]: Without dead ends: 126702 [2019-09-10 09:06:10,118 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:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126702 states. [2019-09-10 09:06:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126702 to 126700. [2019-09-10 09:06:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126700 states. [2019-09-10 09:06:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126700 states to 126700 states and 201753 transitions. [2019-09-10 09:06:11,700 INFO L78 Accepts]: Start accepts. Automaton has 126700 states and 201753 transitions. Word has length 505 [2019-09-10 09:06:11,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:11,701 INFO L475 AbstractCegarLoop]: Abstraction has 126700 states and 201753 transitions. [2019-09-10 09:06:11,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:06:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 126700 states and 201753 transitions. [2019-09-10 09:06:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-09-10 09:06:11,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:11,757 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] [2019-09-10 09:06:11,758 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:11,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:11,758 INFO L82 PathProgramCache]: Analyzing trace with hash -282622487, now seen corresponding path program 1 times [2019-09-10 09:06:11,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:11,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:11,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:11,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:11,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:12,305 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,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:12,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:12,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:12,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:12,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:12,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:12,308 INFO L87 Difference]: Start difference. First operand 126700 states and 201753 transitions. Second operand 3 states. [2019-09-10 09:06:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:12,986 INFO L93 Difference]: Finished difference Result 248632 states and 394849 transitions. [2019-09-10 09:06:12,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:12,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 507 [2019-09-10 09:06:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:16,357 INFO L225 Difference]: With dead ends: 248632 [2019-09-10 09:06:16,357 INFO L226 Difference]: Without dead ends: 248632 [2019-09-10 09:06:16,358 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:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248632 states. [2019-09-10 09:06:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248632 to 248630. [2019-09-10 09:06:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248630 states. [2019-09-10 09:06:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248630 states to 248630 states and 394848 transitions. [2019-09-10 09:06:18,999 INFO L78 Accepts]: Start accepts. Automaton has 248630 states and 394848 transitions. Word has length 507 [2019-09-10 09:06:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:18,999 INFO L475 AbstractCegarLoop]: Abstraction has 248630 states and 394848 transitions. [2019-09-10 09:06:18,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 248630 states and 394848 transitions. [2019-09-10 09:06:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-09-10 09:06:19,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:19,121 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] [2019-09-10 09:06:19,121 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:19,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:19,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1383274173, now seen corresponding path program 1 times [2019-09-10 09:06:19,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:19,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:19,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:19,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:19,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:19,394 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:19,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:19,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:19,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:19,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:19,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:19,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:19,396 INFO L87 Difference]: Start difference. First operand 248630 states and 394848 transitions. Second operand 3 states. [2019-09-10 09:06:25,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:25,691 INFO L93 Difference]: Finished difference Result 487066 states and 771203 transitions. [2019-09-10 09:06:25,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:25,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 507 [2019-09-10 09:06:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:26,253 INFO L225 Difference]: With dead ends: 487066 [2019-09-10 09:06:26,254 INFO L226 Difference]: Without dead ends: 487066 [2019-09-10 09:06:26,254 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:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487066 states. [2019-09-10 09:06:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487066 to 250392. [2019-09-10 09:06:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250392 states. [2019-09-10 09:06:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250392 states to 250392 states and 397506 transitions. [2019-09-10 09:06:31,368 INFO L78 Accepts]: Start accepts. Automaton has 250392 states and 397506 transitions. Word has length 507 [2019-09-10 09:06:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:31,369 INFO L475 AbstractCegarLoop]: Abstraction has 250392 states and 397506 transitions. [2019-09-10 09:06:31,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 250392 states and 397506 transitions. [2019-09-10 09:06:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-10 09:06:31,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:31,473 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:31,473 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:31,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1187686741, now seen corresponding path program 1 times [2019-09-10 09:06:31,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:31,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:31,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:31,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:31,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:31,810 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:31,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:31,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:31,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:31,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:31,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:31,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:31,814 INFO L87 Difference]: Start difference. First operand 250392 states and 397506 transitions. Second operand 3 states. [2019-09-10 09:06:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:32,752 INFO L93 Difference]: Finished difference Result 393178 states and 624547 transitions. [2019-09-10 09:06:32,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:32,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 508 [2019-09-10 09:06:32,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:33,276 INFO L225 Difference]: With dead ends: 393178 [2019-09-10 09:06:33,277 INFO L226 Difference]: Without dead ends: 393178 [2019-09-10 09:06:33,279 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:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393178 states. [2019-09-10 09:06:41,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393178 to 357656. [2019-09-10 09:06:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357656 states. [2019-09-10 09:06:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357656 states to 357656 states and 570114 transitions. [2019-09-10 09:06:43,704 INFO L78 Accepts]: Start accepts. Automaton has 357656 states and 570114 transitions. Word has length 508 [2019-09-10 09:06:43,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:43,704 INFO L475 AbstractCegarLoop]: Abstraction has 357656 states and 570114 transitions. [2019-09-10 09:06:43,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand 357656 states and 570114 transitions. [2019-09-10 09:06:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-10 09:06:43,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:43,825 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:43,825 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:43,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:43,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1188042342, now seen corresponding path program 1 times [2019-09-10 09:06:43,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:43,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:43,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:43,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:43,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:44,125 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:44,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:44,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:44,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:44,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:44,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:44,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:44,127 INFO L87 Difference]: Start difference. First operand 357656 states and 570114 transitions. Second operand 3 states. [2019-09-10 09:06:45,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:45,783 INFO L93 Difference]: Finished difference Result 704016 states and 1119832 transitions. [2019-09-10 09:06:45,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:45,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 508 [2019-09-10 09:06:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:54,539 INFO L225 Difference]: With dead ends: 704016 [2019-09-10 09:06:54,539 INFO L226 Difference]: Without dead ends: 704016 [2019-09-10 09:06:54,539 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:54,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704016 states. [2019-09-10 09:07:00,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704016 to 360206. [2019-09-10 09:07:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360206 states. [2019-09-10 09:07:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360206 states to 360206 states and 573783 transitions. [2019-09-10 09:07:00,739 INFO L78 Accepts]: Start accepts. Automaton has 360206 states and 573783 transitions. Word has length 508 [2019-09-10 09:07:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:00,739 INFO L475 AbstractCegarLoop]: Abstraction has 360206 states and 573783 transitions. [2019-09-10 09:07:00,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 360206 states and 573783 transitions. [2019-09-10 09:07:00,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-09-10 09:07:00,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:00,871 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] [2019-09-10 09:07:00,871 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:00,872 INFO L82 PathProgramCache]: Analyzing trace with hash 24858990, now seen corresponding path program 1 times [2019-09-10 09:07:00,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:00,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:00,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:00,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:00,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:02,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:07:02,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:02,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:02,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:02,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:02,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:02,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:02,458 INFO L87 Difference]: Start difference. First operand 360206 states and 573783 transitions. Second operand 3 states. [2019-09-10 09:07:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:04,040 INFO L93 Difference]: Finished difference Result 711500 states and 1129696 transitions. [2019-09-10 09:07:04,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:04,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 509 [2019-09-10 09:07:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:12,499 INFO L225 Difference]: With dead ends: 711500 [2019-09-10 09:07:12,500 INFO L226 Difference]: Without dead ends: 711500 [2019-09-10 09:07:12,500 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:12,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711500 states. [2019-09-10 09:07:20,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711500 to 711498. [2019-09-10 09:07:20,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711498 states. [2019-09-10 09:07:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711498 states to 711498 states and 1129695 transitions. [2019-09-10 09:07:32,490 INFO L78 Accepts]: Start accepts. Automaton has 711498 states and 1129695 transitions. Word has length 509 [2019-09-10 09:07:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:32,490 INFO L475 AbstractCegarLoop]: Abstraction has 711498 states and 1129695 transitions. [2019-09-10 09:07:32,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 711498 states and 1129695 transitions. [2019-09-10 09:07:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-09-10 09:07:32,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:32,739 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:07:32,739 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:32,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:32,739 INFO L82 PathProgramCache]: Analyzing trace with hash 782799059, now seen corresponding path program 1 times [2019-09-10 09:07:32,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:32,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:32,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:32,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:32,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:41,573 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:41,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:41,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:41,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:41,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:41,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:41,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:41,575 INFO L87 Difference]: Start difference. First operand 711498 states and 1129695 transitions. Second operand 3 states. [2019-09-10 09:07:45,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:45,608 INFO L93 Difference]: Finished difference Result 1399671 states and 2214083 transitions. [2019-09-10 09:07:45,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:45,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 511 [2019-09-10 09:07:45,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:57,257 INFO L225 Difference]: With dead ends: 1399671 [2019-09-10 09:07:57,257 INFO L226 Difference]: Without dead ends: 1399671 [2019-09-10 09:07:57,258 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:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399671 states. [2019-09-10 09:08:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399671 to 1399669. [2019-09-10 09:08:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1399669 states. [2019-09-10 09:08:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399669 states to 1399669 states and 2214082 transitions. [2019-09-10 09:08:48,091 INFO L78 Accepts]: Start accepts. Automaton has 1399669 states and 2214082 transitions. Word has length 511 [2019-09-10 09:08:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:48,092 INFO L475 AbstractCegarLoop]: Abstraction has 1399669 states and 2214082 transitions. [2019-09-10 09:08:48,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1399669 states and 2214082 transitions. [2019-09-10 09:08:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-09-10 09:08:48,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:48,553 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:48,554 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:48,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:48,554 INFO L82 PathProgramCache]: Analyzing trace with hash 933902038, now seen corresponding path program 1 times [2019-09-10 09:08:48,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:48,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:48,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:48,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:48,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:49,951 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:49,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:49,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:08:49,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:49,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:08:49,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:08:49,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:08:49,953 INFO L87 Difference]: Start difference. First operand 1399669 states and 2214082 transitions. Second operand 4 states. [2019-09-10 09:09:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:09:14,440 INFO L93 Difference]: Finished difference Result 2660015 states and 4201686 transitions. [2019-09-10 09:09:14,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:09:14,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 511 [2019-09-10 09:09:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:09:21,199 INFO L225 Difference]: With dead ends: 2660015 [2019-09-10 09:09:21,200 INFO L226 Difference]: Without dead ends: 2660015 [2019-09-10 09:09:21,200 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:09:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660015 states.