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/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 05:00:12,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 05:00:12,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 05:00:12,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 05:00:12,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 05:00:12,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 05:00:12,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 05:00:12,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 05:00:12,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 05:00:12,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 05:00:12,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 05:00:12,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 05:00:12,359 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 05:00:12,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 05:00:12,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 05:00:12,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 05:00:12,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 05:00:12,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 05:00:12,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 05:00:12,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 05:00:12,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 05:00:12,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 05:00:12,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 05:00:12,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 05:00:12,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 05:00:12,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 05:00:12,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 05:00:12,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 05:00:12,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 05:00:12,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 05:00:12,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 05:00:12,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 05:00:12,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 05:00:12,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 05:00:12,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 05:00:12,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 05:00:12,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 05:00:12,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 05:00:12,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 05:00:12,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 05:00:12,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 05:00:12,405 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 05:00:12,428 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 05:00:12,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 05:00:12,429 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 05:00:12,430 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 05:00:12,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 05:00:12,431 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 05:00:12,431 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 05:00:12,431 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 05:00:12,431 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 05:00:12,431 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 05:00:12,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 05:00:12,434 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 05:00:12,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 05:00:12,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 05:00:12,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 05:00:12,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 05:00:12,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 05:00:12,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 05:00:12,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 05:00:12,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 05:00:12,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 05:00:12,436 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 05:00:12,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 05:00:12,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 05:00:12,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 05:00:12,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 05:00:12,438 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 05:00:12,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 05:00:12,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 05:00:12,438 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 05:00:12,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 05:00:12,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 05:00:12,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 05:00:12,512 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 05:00:12,513 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 05:00:12,514 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c [2019-09-10 05:00:12,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f02e211/906494369ea647af969785b196e92a85/FLAG614ae2b8a [2019-09-10 05:00:13,111 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 05:00:13,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c [2019-09-10 05:00:13,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f02e211/906494369ea647af969785b196e92a85/FLAG614ae2b8a [2019-09-10 05:00:13,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f02e211/906494369ea647af969785b196e92a85 [2019-09-10 05:00:13,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 05:00:13,403 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 05:00:13,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 05:00:13,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 05:00:13,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 05:00:13,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 05:00:13" (1/1) ... [2019-09-10 05:00:13,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6940c547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:13, skipping insertion in model container [2019-09-10 05:00:13,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 05:00:13" (1/1) ... [2019-09-10 05:00:13,419 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 05:00:13,480 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 05:00:14,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 05:00:14,033 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 05:00:14,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 05:00:14,168 INFO L192 MainTranslator]: Completed translation [2019-09-10 05:00:14,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:14 WrapperNode [2019-09-10 05:00:14,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 05:00:14,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 05:00:14,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 05:00:14,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 05:00:14,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:14" (1/1) ... [2019-09-10 05:00:14,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:14" (1/1) ... [2019-09-10 05:00:14,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:14" (1/1) ... [2019-09-10 05:00:14,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:14" (1/1) ... [2019-09-10 05:00:14,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:14" (1/1) ... [2019-09-10 05:00:14,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:14" (1/1) ... [2019-09-10 05:00:14,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:14" (1/1) ... [2019-09-10 05:00:14,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 05:00:14,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 05:00:14,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 05:00:14,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 05:00:14,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:14" (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 05:00:14,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 05:00:14,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 05:00:14,356 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 05:00:14,357 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 05:00:14,357 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 05:00:14,357 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 05:00:14,357 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 05:00:14,357 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 05:00:14,357 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 05:00:14,358 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 05:00:14,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 05:00:14,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 05:00:14,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 05:00:14,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 05:00:14,360 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 05:00:14,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 05:00:14,361 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 05:00:14,361 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 05:00:14,361 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 05:00:14,361 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 05:00:14,362 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 05:00:14,362 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 05:00:14,362 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 05:00:14,362 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 05:00:14,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 05:00:14,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 05:00:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 05:00:15,763 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 05:00:15,764 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 05:00:15,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 05:00:15 BoogieIcfgContainer [2019-09-10 05:00:15,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 05:00:15,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 05:00:15,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 05:00:15,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 05:00:15,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 05:00:13" (1/3) ... [2019-09-10 05:00:15,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634ffc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 05:00:15, skipping insertion in model container [2019-09-10 05:00:15,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:14" (2/3) ... [2019-09-10 05:00:15,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634ffc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 05:00:15, skipping insertion in model container [2019-09-10 05:00:15,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 05:00:15" (3/3) ... [2019-09-10 05:00:15,775 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c [2019-09-10 05:00:15,785 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 05:00:15,794 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 05:00:15,811 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 05:00:15,842 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 05:00:15,842 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 05:00:15,842 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 05:00:15,843 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 05:00:15,843 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 05:00:15,843 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 05:00:15,843 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 05:00:15,843 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 05:00:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states. [2019-09-10 05:00:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 05:00:15,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:15,895 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] [2019-09-10 05:00:15,897 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:15,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:15,902 INFO L82 PathProgramCache]: Analyzing trace with hash -649329700, now seen corresponding path program 1 times [2019-09-10 05:00:15,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:15,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:15,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:16,462 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 05:00:16,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:16,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:00:16,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:16,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:00:16,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:00:16,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:00:16,490 INFO L87 Difference]: Start difference. First operand 360 states. Second operand 5 states. [2019-09-10 05:00:16,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:16,672 INFO L93 Difference]: Finished difference Result 359 states and 618 transitions. [2019-09-10 05:00:16,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 05:00:16,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 05:00:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:16,699 INFO L225 Difference]: With dead ends: 359 [2019-09-10 05:00:16,700 INFO L226 Difference]: Without dead ends: 355 [2019-09-10 05:00:16,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-09-10 05:00:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2019-09-10 05:00:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-10 05:00:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 569 transitions. [2019-09-10 05:00:16,785 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 569 transitions. Word has length 102 [2019-09-10 05:00:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:16,785 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 569 transitions. [2019-09-10 05:00:16,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:00:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 569 transitions. [2019-09-10 05:00:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 05:00:16,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:16,801 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] [2019-09-10 05:00:16,801 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:16,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:16,802 INFO L82 PathProgramCache]: Analyzing trace with hash 755856386, now seen corresponding path program 1 times [2019-09-10 05:00:16,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:16,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:16,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:16,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:16,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:17,251 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 05:00:17,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:17,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 05:00:17,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:17,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 05:00:17,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 05:00:17,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 05:00:17,254 INFO L87 Difference]: Start difference. First operand 355 states and 569 transitions. Second operand 11 states. [2019-09-10 05:00:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:23,343 INFO L93 Difference]: Finished difference Result 1519 states and 2474 transitions. [2019-09-10 05:00:23,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 05:00:23,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 147 [2019-09-10 05:00:23,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:23,359 INFO L225 Difference]: With dead ends: 1519 [2019-09-10 05:00:23,359 INFO L226 Difference]: Without dead ends: 1519 [2019-09-10 05:00:23,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 05:00:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2019-09-10 05:00:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1291. [2019-09-10 05:00:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2019-09-10 05:00:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 2090 transitions. [2019-09-10 05:00:23,492 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 2090 transitions. Word has length 147 [2019-09-10 05:00:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:23,493 INFO L475 AbstractCegarLoop]: Abstraction has 1291 states and 2090 transitions. [2019-09-10 05:00:23,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 05:00:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2090 transitions. [2019-09-10 05:00:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 05:00:23,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:23,498 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] [2019-09-10 05:00:23,499 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:23,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:23,499 INFO L82 PathProgramCache]: Analyzing trace with hash -233136022, now seen corresponding path program 1 times [2019-09-10 05:00:23,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:23,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:23,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:23,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:23,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:23,739 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 05:00:23,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:23,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:00:23,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:23,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:00:23,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:00:23,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:23,742 INFO L87 Difference]: Start difference. First operand 1291 states and 2090 transitions. Second operand 6 states. [2019-09-10 05:00:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:26,442 INFO L93 Difference]: Finished difference Result 3260 states and 5252 transitions. [2019-09-10 05:00:26,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:00:26,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-09-10 05:00:26,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:26,460 INFO L225 Difference]: With dead ends: 3260 [2019-09-10 05:00:26,460 INFO L226 Difference]: Without dead ends: 3260 [2019-09-10 05:00:26,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:00:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2019-09-10 05:00:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 3245. [2019-09-10 05:00:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3245 states. [2019-09-10 05:00:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 3245 states and 5234 transitions. [2019-09-10 05:00:26,569 INFO L78 Accepts]: Start accepts. Automaton has 3245 states and 5234 transitions. Word has length 148 [2019-09-10 05:00:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:26,569 INFO L475 AbstractCegarLoop]: Abstraction has 3245 states and 5234 transitions. [2019-09-10 05:00:26,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:00:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3245 states and 5234 transitions. [2019-09-10 05:00:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 05:00:26,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:26,575 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] [2019-09-10 05:00:26,575 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:26,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:26,576 INFO L82 PathProgramCache]: Analyzing trace with hash -878814535, now seen corresponding path program 1 times [2019-09-10 05:00:26,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:26,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:26,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:26,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:26,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:00:26,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:26,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:00:26,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:26,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:00:26,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:00:26,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:26,811 INFO L87 Difference]: Start difference. First operand 3245 states and 5234 transitions. Second operand 6 states. [2019-09-10 05:00:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:29,493 INFO L93 Difference]: Finished difference Result 8953 states and 14362 transitions. [2019-09-10 05:00:29,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:00:29,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-09-10 05:00:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:29,543 INFO L225 Difference]: With dead ends: 8953 [2019-09-10 05:00:29,544 INFO L226 Difference]: Without dead ends: 8953 [2019-09-10 05:00:29,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:00:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8953 states. [2019-09-10 05:00:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8953 to 8923. [2019-09-10 05:00:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8923 states. [2019-09-10 05:00:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8923 states to 8923 states and 14314 transitions. [2019-09-10 05:00:29,793 INFO L78 Accepts]: Start accepts. Automaton has 8923 states and 14314 transitions. Word has length 149 [2019-09-10 05:00:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:29,794 INFO L475 AbstractCegarLoop]: Abstraction has 8923 states and 14314 transitions. [2019-09-10 05:00:29,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:00:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8923 states and 14314 transitions. [2019-09-10 05:00:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 05:00:29,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:29,800 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] [2019-09-10 05:00:29,800 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:29,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:29,800 INFO L82 PathProgramCache]: Analyzing trace with hash 528303105, now seen corresponding path program 1 times [2019-09-10 05:00:29,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:29,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:29,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:29,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:29,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:30,047 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 05:00:30,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:30,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:00:30,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:30,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:00:30,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:00:30,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:30,049 INFO L87 Difference]: Start difference. First operand 8923 states and 14314 transitions. Second operand 6 states. [2019-09-10 05:00:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:32,871 INFO L93 Difference]: Finished difference Result 30240 states and 48312 transitions. [2019-09-10 05:00:32,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:00:32,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-10 05:00:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:33,167 INFO L225 Difference]: With dead ends: 30240 [2019-09-10 05:00:33,168 INFO L226 Difference]: Without dead ends: 30240 [2019-09-10 05:00:33,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:00:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30240 states. [2019-09-10 05:00:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30240 to 30152. [2019-09-10 05:00:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30152 states. [2019-09-10 05:00:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30152 states to 30152 states and 48148 transitions. [2019-09-10 05:00:34,043 INFO L78 Accepts]: Start accepts. Automaton has 30152 states and 48148 transitions. Word has length 150 [2019-09-10 05:00:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:34,044 INFO L475 AbstractCegarLoop]: Abstraction has 30152 states and 48148 transitions. [2019-09-10 05:00:34,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:00:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 30152 states and 48148 transitions. [2019-09-10 05:00:34,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 05:00:34,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:34,050 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] [2019-09-10 05:00:34,050 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:34,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:34,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1147592048, now seen corresponding path program 1 times [2019-09-10 05:00:34,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:34,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:34,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:34,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:34,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:34,265 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 05:00:34,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:34,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:00:34,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:34,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:00:34,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:00:34,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:34,267 INFO L87 Difference]: Start difference. First operand 30152 states and 48148 transitions. Second operand 6 states. [2019-09-10 05:00:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:37,383 INFO L93 Difference]: Finished difference Result 129616 states and 207703 transitions. [2019-09-10 05:00:37,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:00:37,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2019-09-10 05:00:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:38,093 INFO L225 Difference]: With dead ends: 129616 [2019-09-10 05:00:38,093 INFO L226 Difference]: Without dead ends: 129616 [2019-09-10 05:00:38,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 05:00:38,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129616 states. [2019-09-10 05:00:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129616 to 103010. [2019-09-10 05:00:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103010 states. [2019-09-10 05:00:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103010 states to 103010 states and 164958 transitions. [2019-09-10 05:00:40,459 INFO L78 Accepts]: Start accepts. Automaton has 103010 states and 164958 transitions. Word has length 151 [2019-09-10 05:00:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:40,468 INFO L475 AbstractCegarLoop]: Abstraction has 103010 states and 164958 transitions. [2019-09-10 05:00:40,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:00:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 103010 states and 164958 transitions. [2019-09-10 05:00:40,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 05:00:40,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:40,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:00:40,476 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:40,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:40,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1924125848, now seen corresponding path program 1 times [2019-09-10 05:00:40,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:40,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:40,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:40,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:40,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:42,137 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 05:00:42,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:42,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 05:00:42,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:42,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 05:00:42,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 05:00:42,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 05:00:42,139 INFO L87 Difference]: Start difference. First operand 103010 states and 164958 transitions. Second operand 4 states. [2019-09-10 05:00:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:43,397 INFO L93 Difference]: Finished difference Result 272617 states and 434902 transitions. [2019-09-10 05:00:43,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 05:00:43,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-10 05:00:43,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:44,800 INFO L225 Difference]: With dead ends: 272617 [2019-09-10 05:00:44,801 INFO L226 Difference]: Without dead ends: 272617 [2019-09-10 05:00:44,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 05:00:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272617 states. [2019-09-10 05:00:48,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272617 to 270609. [2019-09-10 05:00:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270609 states. [2019-09-10 05:00:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270609 states to 270609 states and 432240 transitions. [2019-09-10 05:00:49,316 INFO L78 Accepts]: Start accepts. Automaton has 270609 states and 432240 transitions. Word has length 153 [2019-09-10 05:00:49,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:49,317 INFO L475 AbstractCegarLoop]: Abstraction has 270609 states and 432240 transitions. [2019-09-10 05:00:49,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 05:00:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 270609 states and 432240 transitions. [2019-09-10 05:00:49,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 05:00:49,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:49,324 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] [2019-09-10 05:00:49,324 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:49,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:49,325 INFO L82 PathProgramCache]: Analyzing trace with hash -512364064, now seen corresponding path program 1 times [2019-09-10 05:00:49,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:49,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:49,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:49,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:49,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:53,482 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 05:00:53,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:53,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 05:00:53,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:53,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 05:00:53,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 05:00:53,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 05:00:53,486 INFO L87 Difference]: Start difference. First operand 270609 states and 432240 transitions. Second operand 11 states. [2019-09-10 05:00:59,839 WARN L188 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-09-10 05:01:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:02,866 INFO L93 Difference]: Finished difference Result 388373 states and 621416 transitions. [2019-09-10 05:01:02,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 05:01:02,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 154 [2019-09-10 05:01:02,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:04,145 INFO L225 Difference]: With dead ends: 388373 [2019-09-10 05:01:04,146 INFO L226 Difference]: Without dead ends: 388373 [2019-09-10 05:01:04,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 05:01:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388373 states. [2019-09-10 05:01:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388373 to 349117. [2019-09-10 05:01:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349117 states. [2019-09-10 05:01:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349117 states to 349117 states and 557564 transitions. [2019-09-10 05:01:14,016 INFO L78 Accepts]: Start accepts. Automaton has 349117 states and 557564 transitions. Word has length 154 [2019-09-10 05:01:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:01:14,016 INFO L475 AbstractCegarLoop]: Abstraction has 349117 states and 557564 transitions. [2019-09-10 05:01:14,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 05:01:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 349117 states and 557564 transitions. [2019-09-10 05:01:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 05:01:14,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:01:14,022 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] [2019-09-10 05:01:14,023 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:01:14,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:01:14,023 INFO L82 PathProgramCache]: Analyzing trace with hash -893264308, now seen corresponding path program 1 times [2019-09-10 05:01:14,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:01:14,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:14,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:01:14,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:14,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:01:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:01:14,244 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 05:01:14,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:01:14,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 05:01:14,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:01:14,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 05:01:14,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 05:01:14,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:01:14,247 INFO L87 Difference]: Start difference. First operand 349117 states and 557564 transitions. Second operand 12 states. [2019-09-10 05:01:22,584 WARN L188 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-09-10 05:01:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:30,223 INFO L93 Difference]: Finished difference Result 874613 states and 1415916 transitions. [2019-09-10 05:01:30,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 05:01:30,223 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 155 [2019-09-10 05:01:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:32,880 INFO L225 Difference]: With dead ends: 874613 [2019-09-10 05:01:32,880 INFO L226 Difference]: Without dead ends: 874613 [2019-09-10 05:01:32,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 05:01:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874613 states. [2019-09-10 05:01:53,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874613 to 720074. [2019-09-10 05:01:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720074 states. [2019-09-10 05:01:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720074 states to 720074 states and 1164852 transitions. [2019-09-10 05:01:55,538 INFO L78 Accepts]: Start accepts. Automaton has 720074 states and 1164852 transitions. Word has length 155 [2019-09-10 05:01:55,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:01:55,539 INFO L475 AbstractCegarLoop]: Abstraction has 720074 states and 1164852 transitions. [2019-09-10 05:01:55,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 05:01:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 720074 states and 1164852 transitions. [2019-09-10 05:01:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 05:01:55,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:01:55,545 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] [2019-09-10 05:01:55,545 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:01:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:01:55,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1922623606, now seen corresponding path program 1 times [2019-09-10 05:01:55,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:01:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:55,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:01:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:55,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:01:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:02:05,580 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 05:02:05,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:02:05,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 05:02:05,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:02:05,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 05:02:05,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 05:02:05,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:02:05,582 INFO L87 Difference]: Start difference. First operand 720074 states and 1164852 transitions. Second operand 7 states. [2019-09-10 05:02:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:02:10,079 INFO L93 Difference]: Finished difference Result 704543 states and 1140639 transitions. [2019-09-10 05:02:10,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:02:10,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2019-09-10 05:02:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:02:18,913 INFO L225 Difference]: With dead ends: 704543 [2019-09-10 05:02:18,913 INFO L226 Difference]: Without dead ends: 704543 [2019-09-10 05:02:18,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:02:19,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704543 states. [2019-09-10 05:02:27,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704543 to 594706. [2019-09-10 05:02:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594706 states. [2019-09-10 05:02:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594706 states to 594706 states and 962586 transitions. [2019-09-10 05:02:40,522 INFO L78 Accepts]: Start accepts. Automaton has 594706 states and 962586 transitions. Word has length 155 [2019-09-10 05:02:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:02:40,522 INFO L475 AbstractCegarLoop]: Abstraction has 594706 states and 962586 transitions. [2019-09-10 05:02:40,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 05:02:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 594706 states and 962586 transitions. [2019-09-10 05:02:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 05:02:40,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:02:40,528 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] [2019-09-10 05:02:40,528 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:02:40,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:02:40,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1352813233, now seen corresponding path program 1 times [2019-09-10 05:02:40,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:02:40,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:40,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:02:40,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:40,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:02:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:02:40,823 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 05:02:40,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:02:40,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:02:40,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:02:40,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:02:40,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:02:40,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:02:40,826 INFO L87 Difference]: Start difference. First operand 594706 states and 962586 transitions. Second operand 5 states. [2019-09-10 05:02:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:02:57,691 INFO L93 Difference]: Finished difference Result 1180881 states and 1898049 transitions. [2019-09-10 05:02:57,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:02:57,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-09-10 05:02:57,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:03:01,234 INFO L225 Difference]: With dead ends: 1180881 [2019-09-10 05:03:01,234 INFO L226 Difference]: Without dead ends: 1180881 [2019-09-10 05:03:01,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:03:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180881 states. [2019-09-10 05:03:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180881 to 1180879. [2019-09-10 05:03:37,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180879 states. [2019-09-10 05:03:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180879 states to 1180879 states and 1898048 transitions. [2019-09-10 05:03:54,112 INFO L78 Accepts]: Start accepts. Automaton has 1180879 states and 1898048 transitions. Word has length 156 [2019-09-10 05:03:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:03:54,112 INFO L475 AbstractCegarLoop]: Abstraction has 1180879 states and 1898048 transitions. [2019-09-10 05:03:54,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:03:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1180879 states and 1898048 transitions. [2019-09-10 05:03:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 05:03:54,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:03:54,119 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] [2019-09-10 05:03:54,119 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:03:54,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:03:54,119 INFO L82 PathProgramCache]: Analyzing trace with hash -283469812, now seen corresponding path program 1 times [2019-09-10 05:03:54,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:03:54,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:54,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:03:54,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:54,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:03:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:03:54,308 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 05:03:54,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:03:54,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:03:54,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:03:54,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:03:54,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:03:54,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:03:54,310 INFO L87 Difference]: Start difference. First operand 1180879 states and 1898048 transitions. Second operand 5 states. [2019-09-10 05:04:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:04:13,830 INFO L93 Difference]: Finished difference Result 1593441 states and 2556636 transitions. [2019-09-10 05:04:13,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 05:04:13,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-10 05:04:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:04:30,761 INFO L225 Difference]: With dead ends: 1593441 [2019-09-10 05:04:30,761 INFO L226 Difference]: Without dead ends: 1593441 [2019-09-10 05:04:30,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:04:31,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593441 states. [2019-09-10 05:05:06,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593441 to 1564165. [2019-09-10 05:05:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564165 states.