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_lcr.6.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:19:03,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:19:03,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:19:03,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:19:03,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:19:03,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:19:03,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:19:03,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:19:03,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:19:03,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:19:03,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:19:03,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:19:03,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:19:03,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:19:03,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:19:03,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:19:03,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:19:03,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:19:03,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:19:03,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:19:03,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:19:03,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:19:03,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:19:03,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:19:03,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:19:03,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:19:03,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:19:03,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:19:03,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:19:03,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:19:03,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:19:03,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:19:03,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:19:03,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:19:03,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:19:03,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:19:03,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:19:03,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:19:03,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:19:03,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:19:03,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:19:03,414 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 08:19:03,430 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:19:03,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:19:03,431 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:19:03,431 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:19:03,432 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:19:03,432 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:19:03,432 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:19:03,432 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:19:03,433 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:19:03,433 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:19:03,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:19:03,434 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:19:03,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:19:03,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:19:03,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:19:03,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:19:03,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:19:03,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:19:03,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:19:03,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:19:03,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:19:03,436 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:19:03,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:19:03,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:19:03,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:19:03,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:19:03,437 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:19:03,437 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:19:03,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:19:03,438 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:19:03,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:19:03,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:19:03,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:19:03,485 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:19:03,485 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:19:03,486 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-10 08:19:03,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6bfa967/8fe784e4dde847eb8521be33b3fee1c7/FLAGbe03e1a99 [2019-09-10 08:19:04,134 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:19:04,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-10 08:19:04,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6bfa967/8fe784e4dde847eb8521be33b3fee1c7/FLAGbe03e1a99 [2019-09-10 08:19:04,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6bfa967/8fe784e4dde847eb8521be33b3fee1c7 [2019-09-10 08:19:04,392 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:19:04,393 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:19:04,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:19:04,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:19:04,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:19:04,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:19:04" (1/1) ... [2019-09-10 08:19:04,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f081325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:04, skipping insertion in model container [2019-09-10 08:19:04,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:19:04" (1/1) ... [2019-09-10 08:19:04,416 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:19:04,501 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:19:05,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:19:05,053 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:19:05,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:19:05,480 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:19:05,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:05 WrapperNode [2019-09-10 08:19:05,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:19:05,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:19:05,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:19:05,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:19:05,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:05" (1/1) ... [2019-09-10 08:19:05,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:05" (1/1) ... [2019-09-10 08:19:05,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:05" (1/1) ... [2019-09-10 08:19:05,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:05" (1/1) ... [2019-09-10 08:19:05,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:05" (1/1) ... [2019-09-10 08:19:05,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:05" (1/1) ... [2019-09-10 08:19:05,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:05" (1/1) ... [2019-09-10 08:19:05,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:19:05,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:19:05,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:19:05,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:19:05,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:05" (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 08:19:05,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:19:05,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:19:05,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:19:05,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:19:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:19:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:19:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:19:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:19:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:19:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:19:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:19:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:19:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:19:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:19:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:19:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:19:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:19:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:19:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:19:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:19:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:19:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:19:06,946 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:19:06,946 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:19:06,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:19:06 BoogieIcfgContainer [2019-09-10 08:19:06,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:19:06,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:19:06,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:19:06,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:19:06,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:19:04" (1/3) ... [2019-09-10 08:19:06,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b94f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:19:06, skipping insertion in model container [2019-09-10 08:19:06,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:05" (2/3) ... [2019-09-10 08:19:06,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b94f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:19:06, skipping insertion in model container [2019-09-10 08:19:06,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:19:06" (3/3) ... [2019-09-10 08:19:06,960 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-10 08:19:06,968 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:19:06,976 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:19:06,992 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:19:07,026 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:19:07,026 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:19:07,027 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:19:07,027 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:19:07,027 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:19:07,027 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:19:07,027 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:19:07,027 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:19:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2019-09-10 08:19:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:19:07,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:07,089 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] [2019-09-10 08:19:07,091 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:07,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:07,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1558548154, now seen corresponding path program 1 times [2019-09-10 08:19:07,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:07,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:07,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:07,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:07,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:07,584 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 08:19:07,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:07,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:19:07,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:07,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:19:07,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:19:07,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:19:07,615 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 4 states. [2019-09-10 08:19:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:07,794 INFO L93 Difference]: Finished difference Result 335 states and 546 transitions. [2019-09-10 08:19:07,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:19:07,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-10 08:19:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:07,815 INFO L225 Difference]: With dead ends: 335 [2019-09-10 08:19:07,816 INFO L226 Difference]: Without dead ends: 327 [2019-09-10 08:19:07,818 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 08:19:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-10 08:19:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2019-09-10 08:19:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-10 08:19:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 495 transitions. [2019-09-10 08:19:07,895 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 495 transitions. Word has length 123 [2019-09-10 08:19:07,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:07,896 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 495 transitions. [2019-09-10 08:19:07,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:19:07,896 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 495 transitions. [2019-09-10 08:19:07,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 08:19:07,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:07,902 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] [2019-09-10 08:19:07,902 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:07,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:07,903 INFO L82 PathProgramCache]: Analyzing trace with hash 991072982, now seen corresponding path program 1 times [2019-09-10 08:19:07,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:07,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:07,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:07,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:07,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:08,222 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 08:19:08,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:08,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:08,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:08,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:08,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:08,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:08,226 INFO L87 Difference]: Start difference. First operand 327 states and 495 transitions. Second operand 3 states. [2019-09-10 08:19:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:08,284 INFO L93 Difference]: Finished difference Result 496 states and 761 transitions. [2019-09-10 08:19:08,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:08,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-09-10 08:19:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:08,290 INFO L225 Difference]: With dead ends: 496 [2019-09-10 08:19:08,290 INFO L226 Difference]: Without dead ends: 496 [2019-09-10 08:19:08,291 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 08:19:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-09-10 08:19:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 494. [2019-09-10 08:19:08,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-09-10 08:19:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 760 transitions. [2019-09-10 08:19:08,317 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 760 transitions. Word has length 162 [2019-09-10 08:19:08,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:08,318 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 760 transitions. [2019-09-10 08:19:08,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 760 transitions. [2019-09-10 08:19:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:19:08,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:08,322 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] [2019-09-10 08:19:08,322 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:08,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:08,323 INFO L82 PathProgramCache]: Analyzing trace with hash 573716544, now seen corresponding path program 1 times [2019-09-10 08:19:08,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:08,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:08,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:08,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:08,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:08,500 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 08:19:08,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:08,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:08,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:08,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:08,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:08,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:08,508 INFO L87 Difference]: Start difference. First operand 494 states and 760 transitions. Second operand 3 states. [2019-09-10 08:19:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:08,569 INFO L93 Difference]: Finished difference Result 798 states and 1239 transitions. [2019-09-10 08:19:08,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:08,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-10 08:19:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:08,579 INFO L225 Difference]: With dead ends: 798 [2019-09-10 08:19:08,579 INFO L226 Difference]: Without dead ends: 798 [2019-09-10 08:19:08,580 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 08:19:08,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-09-10 08:19:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 796. [2019-09-10 08:19:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-09-10 08:19:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1238 transitions. [2019-09-10 08:19:08,621 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1238 transitions. Word has length 164 [2019-09-10 08:19:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:08,621 INFO L475 AbstractCegarLoop]: Abstraction has 796 states and 1238 transitions. [2019-09-10 08:19:08,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1238 transitions. [2019-09-10 08:19:08,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:19:08,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:08,627 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] [2019-09-10 08:19:08,628 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1866061684, now seen corresponding path program 1 times [2019-09-10 08:19:08,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:08,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:08,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:08,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:08,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:08,814 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 08:19:08,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:08,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:08,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:08,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:08,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:08,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:08,816 INFO L87 Difference]: Start difference. First operand 796 states and 1238 transitions. Second operand 3 states. [2019-09-10 08:19:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:08,875 INFO L93 Difference]: Finished difference Result 1334 states and 2083 transitions. [2019-09-10 08:19:08,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:08,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-10 08:19:08,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:08,884 INFO L225 Difference]: With dead ends: 1334 [2019-09-10 08:19:08,885 INFO L226 Difference]: Without dead ends: 1334 [2019-09-10 08:19:08,885 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 08:19:08,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-09-10 08:19:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1332. [2019-09-10 08:19:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1332 states. [2019-09-10 08:19:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 2082 transitions. [2019-09-10 08:19:08,917 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 2082 transitions. Word has length 166 [2019-09-10 08:19:08,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:08,920 INFO L475 AbstractCegarLoop]: Abstraction has 1332 states and 2082 transitions. [2019-09-10 08:19:08,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 2082 transitions. [2019-09-10 08:19:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:19:08,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:08,925 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] [2019-09-10 08:19:08,925 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:08,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1665945972, now seen corresponding path program 1 times [2019-09-10 08:19:08,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:08,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:08,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:08,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:08,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:09,034 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 08:19:09,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:09,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:09,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:09,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:09,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:09,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:09,037 INFO L87 Difference]: Start difference. First operand 1332 states and 2082 transitions. Second operand 3 states. [2019-09-10 08:19:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:09,103 INFO L93 Difference]: Finished difference Result 2266 states and 3539 transitions. [2019-09-10 08:19:09,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:09,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 08:19:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:09,122 INFO L225 Difference]: With dead ends: 2266 [2019-09-10 08:19:09,123 INFO L226 Difference]: Without dead ends: 2266 [2019-09-10 08:19:09,124 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 08:19:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-09-10 08:19:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2264. [2019-09-10 08:19:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-09-10 08:19:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 3538 transitions. [2019-09-10 08:19:09,282 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 3538 transitions. Word has length 168 [2019-09-10 08:19:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:09,282 INFO L475 AbstractCegarLoop]: Abstraction has 2264 states and 3538 transitions. [2019-09-10 08:19:09,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 3538 transitions. [2019-09-10 08:19:09,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:19:09,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:09,295 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] [2019-09-10 08:19:09,295 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:09,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1995764882, now seen corresponding path program 1 times [2019-09-10 08:19:09,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:09,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:09,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:09,476 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 08:19:09,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:09,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:09,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:09,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:09,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:09,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:09,481 INFO L87 Difference]: Start difference. First operand 2264 states and 3538 transitions. Second operand 3 states. [2019-09-10 08:19:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:09,572 INFO L93 Difference]: Finished difference Result 3846 states and 5979 transitions. [2019-09-10 08:19:09,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:09,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-10 08:19:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:09,602 INFO L225 Difference]: With dead ends: 3846 [2019-09-10 08:19:09,602 INFO L226 Difference]: Without dead ends: 3846 [2019-09-10 08:19:09,603 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 08:19:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2019-09-10 08:19:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 3844. [2019-09-10 08:19:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2019-09-10 08:19:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 5978 transitions. [2019-09-10 08:19:09,777 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 5978 transitions. Word has length 170 [2019-09-10 08:19:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:09,786 INFO L475 AbstractCegarLoop]: Abstraction has 3844 states and 5978 transitions. [2019-09-10 08:19:09,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 5978 transitions. [2019-09-10 08:19:09,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 08:19:09,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:09,812 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] [2019-09-10 08:19:09,812 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:09,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1327606792, now seen corresponding path program 1 times [2019-09-10 08:19:09,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:09,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:09,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:09,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:09,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:09,939 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 08:19:09,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:09,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:09,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:09,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:09,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:09,941 INFO L87 Difference]: Start difference. First operand 3844 states and 5978 transitions. Second operand 3 states. [2019-09-10 08:19:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:10,489 INFO L93 Difference]: Finished difference Result 7566 states and 11697 transitions. [2019-09-10 08:19:10,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:10,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-10 08:19:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:10,529 INFO L225 Difference]: With dead ends: 7566 [2019-09-10 08:19:10,529 INFO L226 Difference]: Without dead ends: 7566 [2019-09-10 08:19:10,530 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 08:19:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7566 states. [2019-09-10 08:19:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7566 to 7564. [2019-09-10 08:19:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2019-09-10 08:19:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 11696 transitions. [2019-09-10 08:19:10,728 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 11696 transitions. Word has length 172 [2019-09-10 08:19:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:10,728 INFO L475 AbstractCegarLoop]: Abstraction has 7564 states and 11696 transitions. [2019-09-10 08:19:10,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 11696 transitions. [2019-09-10 08:19:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 08:19:10,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:10,749 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] [2019-09-10 08:19:10,749 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:10,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:10,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1061687790, now seen corresponding path program 1 times [2019-09-10 08:19:10,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:10,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:10,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:10,952 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 08:19:10,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:10,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:19:10,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:10,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:19:10,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:19:10,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:19:10,954 INFO L87 Difference]: Start difference. First operand 7564 states and 11696 transitions. Second operand 5 states. [2019-09-10 08:19:11,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:11,304 INFO L93 Difference]: Finished difference Result 7564 states and 11628 transitions. [2019-09-10 08:19:11,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:19:11,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-09-10 08:19:11,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:11,339 INFO L225 Difference]: With dead ends: 7564 [2019-09-10 08:19:11,339 INFO L226 Difference]: Without dead ends: 7564 [2019-09-10 08:19:11,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:19:11,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2019-09-10 08:19:11,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 7564. [2019-09-10 08:19:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2019-09-10 08:19:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 11628 transitions. [2019-09-10 08:19:11,494 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 11628 transitions. Word has length 172 [2019-09-10 08:19:11,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:11,494 INFO L475 AbstractCegarLoop]: Abstraction has 7564 states and 11628 transitions. [2019-09-10 08:19:11,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:19:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 11628 transitions. [2019-09-10 08:19:11,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 08:19:11,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:11,514 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] [2019-09-10 08:19:11,514 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:11,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:11,514 INFO L82 PathProgramCache]: Analyzing trace with hash 738416626, now seen corresponding path program 1 times [2019-09-10 08:19:11,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:11,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:11,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:11,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:11,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:11,682 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 08:19:11,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:11,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:19:11,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:11,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:19:11,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:19:11,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:19:11,684 INFO L87 Difference]: Start difference. First operand 7564 states and 11628 transitions. Second operand 5 states. [2019-09-10 08:19:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:12,074 INFO L93 Difference]: Finished difference Result 7564 states and 11554 transitions. [2019-09-10 08:19:12,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:19:12,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-09-10 08:19:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:12,095 INFO L225 Difference]: With dead ends: 7564 [2019-09-10 08:19:12,095 INFO L226 Difference]: Without dead ends: 7564 [2019-09-10 08:19:12,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:19:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2019-09-10 08:19:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 7564. [2019-09-10 08:19:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2019-09-10 08:19:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 11554 transitions. [2019-09-10 08:19:12,227 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 11554 transitions. Word has length 172 [2019-09-10 08:19:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:12,227 INFO L475 AbstractCegarLoop]: Abstraction has 7564 states and 11554 transitions. [2019-09-10 08:19:12,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:19:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 11554 transitions. [2019-09-10 08:19:12,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 08:19:12,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:12,248 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] [2019-09-10 08:19:12,248 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:12,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash -858809902, now seen corresponding path program 1 times [2019-09-10 08:19:12,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:12,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:12,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:12,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:12,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:12,395 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 08:19:12,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:12,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:19:12,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:12,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:19:12,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:19:12,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:19:12,398 INFO L87 Difference]: Start difference. First operand 7564 states and 11554 transitions. Second operand 5 states. [2019-09-10 08:19:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:12,701 INFO L93 Difference]: Finished difference Result 7564 states and 11472 transitions. [2019-09-10 08:19:12,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:19:12,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-09-10 08:19:12,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:12,717 INFO L225 Difference]: With dead ends: 7564 [2019-09-10 08:19:12,718 INFO L226 Difference]: Without dead ends: 7564 [2019-09-10 08:19:12,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:19:12,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2019-09-10 08:19:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 7564. [2019-09-10 08:19:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2019-09-10 08:19:12,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 11472 transitions. [2019-09-10 08:19:12,878 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 11472 transitions. Word has length 172 [2019-09-10 08:19:12,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:12,878 INFO L475 AbstractCegarLoop]: Abstraction has 7564 states and 11472 transitions. [2019-09-10 08:19:12,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:19:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 11472 transitions. [2019-09-10 08:19:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 08:19:12,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:12,899 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] [2019-09-10 08:19:12,900 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:12,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:12,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1743148046, now seen corresponding path program 1 times [2019-09-10 08:19:12,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:12,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:12,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:12,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:12,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:13,066 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 08:19:13,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:13,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:19:13,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:13,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:19:13,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:19:13,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:19:13,069 INFO L87 Difference]: Start difference. First operand 7564 states and 11472 transitions. Second operand 5 states. [2019-09-10 08:19:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:13,381 INFO L93 Difference]: Finished difference Result 7564 states and 11402 transitions. [2019-09-10 08:19:13,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:19:13,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-09-10 08:19:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:13,398 INFO L225 Difference]: With dead ends: 7564 [2019-09-10 08:19:13,398 INFO L226 Difference]: Without dead ends: 7564 [2019-09-10 08:19:13,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:19:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2019-09-10 08:19:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 7564. [2019-09-10 08:19:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2019-09-10 08:19:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 11402 transitions. [2019-09-10 08:19:13,516 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 11402 transitions. Word has length 172 [2019-09-10 08:19:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:13,516 INFO L475 AbstractCegarLoop]: Abstraction has 7564 states and 11402 transitions. [2019-09-10 08:19:13,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:19:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 11402 transitions. [2019-09-10 08:19:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 08:19:13,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:13,535 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] [2019-09-10 08:19:13,536 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:13,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:13,536 INFO L82 PathProgramCache]: Analyzing trace with hash 759314, now seen corresponding path program 1 times [2019-09-10 08:19:13,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:13,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:13,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:13,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:13,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:13,695 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 08:19:13,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:13,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:13,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:13,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:13,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:13,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:13,697 INFO L87 Difference]: Start difference. First operand 7564 states and 11402 transitions. Second operand 3 states. [2019-09-10 08:19:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:13,825 INFO L93 Difference]: Finished difference Result 14566 states and 21959 transitions. [2019-09-10 08:19:13,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:13,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-10 08:19:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:13,859 INFO L225 Difference]: With dead ends: 14566 [2019-09-10 08:19:13,859 INFO L226 Difference]: Without dead ends: 14566 [2019-09-10 08:19:13,860 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 08:19:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14566 states. [2019-09-10 08:19:14,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14566 to 13790. [2019-09-10 08:19:14,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13790 states. [2019-09-10 08:19:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13790 states to 13790 states and 20668 transitions. [2019-09-10 08:19:14,083 INFO L78 Accepts]: Start accepts. Automaton has 13790 states and 20668 transitions. Word has length 172 [2019-09-10 08:19:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:14,083 INFO L475 AbstractCegarLoop]: Abstraction has 13790 states and 20668 transitions. [2019-09-10 08:19:14,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 13790 states and 20668 transitions. [2019-09-10 08:19:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 08:19:14,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:14,110 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] [2019-09-10 08:19:14,110 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:14,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:14,111 INFO L82 PathProgramCache]: Analyzing trace with hash 961881910, now seen corresponding path program 1 times [2019-09-10 08:19:14,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:14,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:14,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:14,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:14,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:14,204 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 08:19:14,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:14,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:14,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:14,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:14,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:14,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:14,206 INFO L87 Difference]: Start difference. First operand 13790 states and 20668 transitions. Second operand 3 states. [2019-09-10 08:19:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:14,260 INFO L93 Difference]: Finished difference Result 9729 states and 14389 transitions. [2019-09-10 08:19:14,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:14,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 08:19:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:14,281 INFO L225 Difference]: With dead ends: 9729 [2019-09-10 08:19:14,281 INFO L226 Difference]: Without dead ends: 9729 [2019-09-10 08:19:14,282 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 08:19:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9729 states. [2019-09-10 08:19:14,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9729 to 9727. [2019-09-10 08:19:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9727 states. [2019-09-10 08:19:14,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9727 states to 9727 states and 14388 transitions. [2019-09-10 08:19:14,417 INFO L78 Accepts]: Start accepts. Automaton has 9727 states and 14388 transitions. Word has length 174 [2019-09-10 08:19:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:14,417 INFO L475 AbstractCegarLoop]: Abstraction has 9727 states and 14388 transitions. [2019-09-10 08:19:14,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 9727 states and 14388 transitions. [2019-09-10 08:19:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 08:19:14,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:14,437 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] [2019-09-10 08:19:14,437 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:14,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash -697279744, now seen corresponding path program 1 times [2019-09-10 08:19:14,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:14,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:14,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:14,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:14,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:14,895 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 08:19:14,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:14,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:19:14,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:14,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:19:14,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:19:14,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:19:14,897 INFO L87 Difference]: Start difference. First operand 9727 states and 14388 transitions. Second operand 10 states. [2019-09-10 08:19:17,418 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-09-10 08:19:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:17,677 INFO L93 Difference]: Finished difference Result 71129 states and 104352 transitions. [2019-09-10 08:19:17,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:19:17,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 174 [2019-09-10 08:19:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:17,836 INFO L225 Difference]: With dead ends: 71129 [2019-09-10 08:19:17,836 INFO L226 Difference]: Without dead ends: 71129 [2019-09-10 08:19:17,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:19:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71129 states. [2019-09-10 08:19:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71129 to 17417. [2019-09-10 08:19:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17417 states. [2019-09-10 08:19:19,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17417 states to 17417 states and 25608 transitions. [2019-09-10 08:19:19,499 INFO L78 Accepts]: Start accepts. Automaton has 17417 states and 25608 transitions. Word has length 174 [2019-09-10 08:19:19,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:19,499 INFO L475 AbstractCegarLoop]: Abstraction has 17417 states and 25608 transitions. [2019-09-10 08:19:19,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:19:19,499 INFO L276 IsEmpty]: Start isEmpty. Operand 17417 states and 25608 transitions. [2019-09-10 08:19:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:19:19,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:19,519 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] [2019-09-10 08:19:19,519 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:19,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:19,520 INFO L82 PathProgramCache]: Analyzing trace with hash 475227480, now seen corresponding path program 1 times [2019-09-10 08:19:19,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:19,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:19,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:19,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:19,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:20,041 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 08:19:20,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:20,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:19:20,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:20,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:19:20,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:19:20,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:19:20,044 INFO L87 Difference]: Start difference. First operand 17417 states and 25608 transitions. Second operand 14 states. [2019-09-10 08:19:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:23,799 INFO L93 Difference]: Finished difference Result 83225 states and 121373 transitions. [2019-09-10 08:19:23,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:19:23,799 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 175 [2019-09-10 08:19:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:23,894 INFO L225 Difference]: With dead ends: 83225 [2019-09-10 08:19:23,895 INFO L226 Difference]: Without dead ends: 83225 [2019-09-10 08:19:23,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:19:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83225 states. [2019-09-10 08:19:24,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83225 to 20549. [2019-09-10 08:19:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20549 states. [2019-09-10 08:19:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20549 states to 20549 states and 30092 transitions. [2019-09-10 08:19:24,833 INFO L78 Accepts]: Start accepts. Automaton has 20549 states and 30092 transitions. Word has length 175 [2019-09-10 08:19:24,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:24,834 INFO L475 AbstractCegarLoop]: Abstraction has 20549 states and 30092 transitions. [2019-09-10 08:19:24,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:19:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 20549 states and 30092 transitions. [2019-09-10 08:19:24,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:19:24,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:24,852 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] [2019-09-10 08:19:24,852 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:24,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:24,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1432076387, now seen corresponding path program 1 times [2019-09-10 08:19:24,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:24,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:24,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:24,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:24,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:25,062 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 08:19:25,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:25,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:19:25,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:25,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:19:25,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:19:25,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:19:25,066 INFO L87 Difference]: Start difference. First operand 20549 states and 30092 transitions. Second operand 8 states. [2019-09-10 08:19:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:26,083 INFO L93 Difference]: Finished difference Result 174737 states and 252005 transitions. [2019-09-10 08:19:26,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:19:26,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 176 [2019-09-10 08:19:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:26,284 INFO L225 Difference]: With dead ends: 174737 [2019-09-10 08:19:26,285 INFO L226 Difference]: Without dead ends: 174737 [2019-09-10 08:19:26,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:19:26,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174737 states. [2019-09-10 08:19:29,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174737 to 60651. [2019-09-10 08:19:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60651 states. [2019-09-10 08:19:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60651 states to 60651 states and 87744 transitions. [2019-09-10 08:19:29,227 INFO L78 Accepts]: Start accepts. Automaton has 60651 states and 87744 transitions. Word has length 176 [2019-09-10 08:19:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:29,227 INFO L475 AbstractCegarLoop]: Abstraction has 60651 states and 87744 transitions. [2019-09-10 08:19:29,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:19:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 60651 states and 87744 transitions. [2019-09-10 08:19:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:19:29,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:29,274 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] [2019-09-10 08:19:29,274 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:29,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:29,275 INFO L82 PathProgramCache]: Analyzing trace with hash -416737294, now seen corresponding path program 1 times [2019-09-10 08:19:29,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:29,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:29,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:29,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:29,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:29,377 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 08:19:29,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:29,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:29,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:29,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:29,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:29,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:29,379 INFO L87 Difference]: Start difference. First operand 60651 states and 87744 transitions. Second operand 3 states. [2019-09-10 08:19:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:29,579 INFO L93 Difference]: Finished difference Result 60647 states and 87728 transitions. [2019-09-10 08:19:29,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:29,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 08:19:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:29,657 INFO L225 Difference]: With dead ends: 60647 [2019-09-10 08:19:29,657 INFO L226 Difference]: Without dead ends: 60647 [2019-09-10 08:19:29,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 08:19:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60647 states. [2019-09-10 08:19:30,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60647 to 60647. [2019-09-10 08:19:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60647 states. [2019-09-10 08:19:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60647 states to 60647 states and 87728 transitions. [2019-09-10 08:19:30,900 INFO L78 Accepts]: Start accepts. Automaton has 60647 states and 87728 transitions. Word has length 179 [2019-09-10 08:19:30,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:30,901 INFO L475 AbstractCegarLoop]: Abstraction has 60647 states and 87728 transitions. [2019-09-10 08:19:30,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 60647 states and 87728 transitions. [2019-09-10 08:19:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:19:30,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:30,953 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] [2019-09-10 08:19:30,954 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash -229509453, now seen corresponding path program 1 times [2019-09-10 08:19:30,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:30,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:30,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:31,070 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 08:19:31,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:31,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:31,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:31,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:31,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:31,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:31,072 INFO L87 Difference]: Start difference. First operand 60647 states and 87728 transitions. Second operand 3 states. [2019-09-10 08:19:31,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:31,188 INFO L93 Difference]: Finished difference Result 33181 states and 47333 transitions. [2019-09-10 08:19:31,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:31,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 08:19:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:31,232 INFO L225 Difference]: With dead ends: 33181 [2019-09-10 08:19:31,233 INFO L226 Difference]: Without dead ends: 33181 [2019-09-10 08:19:31,233 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 08:19:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33181 states. [2019-09-10 08:19:31,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33181 to 33179. [2019-09-10 08:19:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33179 states. [2019-09-10 08:19:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33179 states to 33179 states and 47332 transitions. [2019-09-10 08:19:31,714 INFO L78 Accepts]: Start accepts. Automaton has 33179 states and 47332 transitions. Word has length 179 [2019-09-10 08:19:31,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:31,714 INFO L475 AbstractCegarLoop]: Abstraction has 33179 states and 47332 transitions. [2019-09-10 08:19:31,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 33179 states and 47332 transitions. [2019-09-10 08:19:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:19:31,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:31,737 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] [2019-09-10 08:19:31,737 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:31,738 INFO L82 PathProgramCache]: Analyzing trace with hash 389779707, now seen corresponding path program 1 times [2019-09-10 08:19:31,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:31,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:31,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:31,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:31,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:32,130 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 08:19:32,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:32,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:19:32,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:32,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:19:32,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:19:32,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:19:32,132 INFO L87 Difference]: Start difference. First operand 33179 states and 47332 transitions. Second operand 14 states. [2019-09-10 08:19:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:36,441 INFO L93 Difference]: Finished difference Result 119178 states and 168924 transitions. [2019-09-10 08:19:36,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:19:36,441 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 179 [2019-09-10 08:19:36,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:36,559 INFO L225 Difference]: With dead ends: 119178 [2019-09-10 08:19:36,559 INFO L226 Difference]: Without dead ends: 119178 [2019-09-10 08:19:36,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=289, Invalid=971, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:19:36,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119178 states. [2019-09-10 08:19:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119178 to 33463. [2019-09-10 08:19:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33463 states. [2019-09-10 08:19:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33463 states to 33463 states and 47718 transitions. [2019-09-10 08:19:37,614 INFO L78 Accepts]: Start accepts. Automaton has 33463 states and 47718 transitions. Word has length 179 [2019-09-10 08:19:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:37,614 INFO L475 AbstractCegarLoop]: Abstraction has 33463 states and 47718 transitions. [2019-09-10 08:19:37,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:19:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 33463 states and 47718 transitions. [2019-09-10 08:19:37,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:19:37,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:37,637 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] [2019-09-10 08:19:37,638 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:37,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:37,638 INFO L82 PathProgramCache]: Analyzing trace with hash -866630752, now seen corresponding path program 1 times [2019-09-10 08:19:37,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:37,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:37,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:37,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:37,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:37,843 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 08:19:37,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:37,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:19:37,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:37,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:19:37,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:19:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:19:37,845 INFO L87 Difference]: Start difference. First operand 33463 states and 47718 transitions. Second operand 8 states. [2019-09-10 08:19:38,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:38,635 INFO L93 Difference]: Finished difference Result 142795 states and 203384 transitions. [2019-09-10 08:19:38,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:19:38,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 180 [2019-09-10 08:19:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:38,766 INFO L225 Difference]: With dead ends: 142795 [2019-09-10 08:19:38,766 INFO L226 Difference]: Without dead ends: 142795 [2019-09-10 08:19:38,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:19:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142795 states. [2019-09-10 08:19:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142795 to 54705. [2019-09-10 08:19:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54705 states. [2019-09-10 08:19:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54705 states to 54705 states and 77514 transitions. [2019-09-10 08:19:40,146 INFO L78 Accepts]: Start accepts. Automaton has 54705 states and 77514 transitions. Word has length 180 [2019-09-10 08:19:40,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:40,146 INFO L475 AbstractCegarLoop]: Abstraction has 54705 states and 77514 transitions. [2019-09-10 08:19:40,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:19:40,147 INFO L276 IsEmpty]: Start isEmpty. Operand 54705 states and 77514 transitions. [2019-09-10 08:19:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:19:40,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:40,178 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] [2019-09-10 08:19:40,179 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:40,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:40,179 INFO L82 PathProgramCache]: Analyzing trace with hash -2045152957, now seen corresponding path program 1 times [2019-09-10 08:19:40,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:40,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:40,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:40,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:40,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:40,531 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 08:19:40,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:40,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:19:40,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:40,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:19:40,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:19:40,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:19:40,534 INFO L87 Difference]: Start difference. First operand 54705 states and 77514 transitions. Second operand 12 states. [2019-09-10 08:19:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:44,397 INFO L93 Difference]: Finished difference Result 180478 states and 255399 transitions. [2019-09-10 08:19:44,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:19:44,397 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 180 [2019-09-10 08:19:44,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:44,905 INFO L225 Difference]: With dead ends: 180478 [2019-09-10 08:19:44,905 INFO L226 Difference]: Without dead ends: 180478 [2019-09-10 08:19:44,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=322, Invalid=868, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:19:44,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180478 states. [2019-09-10 08:19:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180478 to 61303. [2019-09-10 08:19:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61303 states. [2019-09-10 08:19:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61303 states to 61303 states and 86629 transitions. [2019-09-10 08:19:45,997 INFO L78 Accepts]: Start accepts. Automaton has 61303 states and 86629 transitions. Word has length 180 [2019-09-10 08:19:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:45,998 INFO L475 AbstractCegarLoop]: Abstraction has 61303 states and 86629 transitions. [2019-09-10 08:19:45,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:19:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 61303 states and 86629 transitions. [2019-09-10 08:19:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:19:46,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:46,034 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] [2019-09-10 08:19:46,035 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:46,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:46,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1194243097, now seen corresponding path program 1 times [2019-09-10 08:19:46,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:46,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:46,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:46,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:46,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:46,114 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 08:19:46,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:46,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:46,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:46,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:46,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:46,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:46,116 INFO L87 Difference]: Start difference. First operand 61303 states and 86629 transitions. Second operand 3 states. [2019-09-10 08:19:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:46,507 INFO L93 Difference]: Finished difference Result 60821 states and 85401 transitions. [2019-09-10 08:19:46,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:46,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:19:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:46,586 INFO L225 Difference]: With dead ends: 60821 [2019-09-10 08:19:46,586 INFO L226 Difference]: Without dead ends: 60821 [2019-09-10 08:19:46,587 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 08:19:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60821 states. [2019-09-10 08:19:47,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60821 to 60821. [2019-09-10 08:19:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60821 states. [2019-09-10 08:19:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60821 states to 60821 states and 85401 transitions. [2019-09-10 08:19:47,529 INFO L78 Accepts]: Start accepts. Automaton has 60821 states and 85401 transitions. Word has length 180 [2019-09-10 08:19:47,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:47,529 INFO L475 AbstractCegarLoop]: Abstraction has 60821 states and 85401 transitions. [2019-09-10 08:19:47,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 60821 states and 85401 transitions. [2019-09-10 08:19:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 08:19:47,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:47,569 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] [2019-09-10 08:19:47,570 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:47,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:47,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1601690686, now seen corresponding path program 1 times [2019-09-10 08:19:47,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:47,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:47,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:47,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:47,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:47,911 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 08:19:47,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:47,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:19:47,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:47,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:19:47,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:19:47,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:19:47,913 INFO L87 Difference]: Start difference. First operand 60821 states and 85401 transitions. Second operand 8 states. [2019-09-10 08:19:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:48,491 INFO L93 Difference]: Finished difference Result 70993 states and 99300 transitions. [2019-09-10 08:19:48,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:19:48,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-09-10 08:19:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:48,552 INFO L225 Difference]: With dead ends: 70993 [2019-09-10 08:19:48,552 INFO L226 Difference]: Without dead ends: 70993 [2019-09-10 08:19:48,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:19:48,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70993 states. [2019-09-10 08:19:49,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70993 to 60821. [2019-09-10 08:19:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60821 states. [2019-09-10 08:19:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60821 states to 60821 states and 84793 transitions. [2019-09-10 08:19:49,209 INFO L78 Accepts]: Start accepts. Automaton has 60821 states and 84793 transitions. Word has length 181 [2019-09-10 08:19:49,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:49,209 INFO L475 AbstractCegarLoop]: Abstraction has 60821 states and 84793 transitions. [2019-09-10 08:19:49,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:19:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 60821 states and 84793 transitions. [2019-09-10 08:19:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:19:49,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:49,248 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] [2019-09-10 08:19:49,248 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:49,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:49,248 INFO L82 PathProgramCache]: Analyzing trace with hash -419666744, now seen corresponding path program 1 times [2019-09-10 08:19:49,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:49,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:49,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:49,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:49,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:49,449 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 08:19:49,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:49,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:19:49,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:49,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:19:49,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:19:49,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:19:49,451 INFO L87 Difference]: Start difference. First operand 60821 states and 84793 transitions. Second operand 8 states. [2019-09-10 08:19:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:50,283 INFO L93 Difference]: Finished difference Result 166994 states and 234256 transitions. [2019-09-10 08:19:50,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:19:50,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-09-10 08:19:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:50,446 INFO L225 Difference]: With dead ends: 166994 [2019-09-10 08:19:50,446 INFO L226 Difference]: Without dead ends: 166994 [2019-09-10 08:19:50,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:19:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166994 states. [2019-09-10 08:19:51,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166994 to 72292. [2019-09-10 08:19:51,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72292 states. [2019-09-10 08:19:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72292 states to 72292 states and 100837 transitions. [2019-09-10 08:19:51,740 INFO L78 Accepts]: Start accepts. Automaton has 72292 states and 100837 transitions. Word has length 182 [2019-09-10 08:19:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:51,740 INFO L475 AbstractCegarLoop]: Abstraction has 72292 states and 100837 transitions. [2019-09-10 08:19:51,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:19:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 72292 states and 100837 transitions. [2019-09-10 08:19:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:19:51,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:51,789 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] [2019-09-10 08:19:51,790 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:51,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:51,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1522190874, now seen corresponding path program 1 times [2019-09-10 08:19:51,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:51,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:51,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:52,211 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 08:19:52,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:52,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:19:52,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:52,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:19:52,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:19:52,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:19:52,213 INFO L87 Difference]: Start difference. First operand 72292 states and 100837 transitions. Second operand 14 states. [2019-09-10 08:19:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:56,374 INFO L93 Difference]: Finished difference Result 285886 states and 399904 transitions. [2019-09-10 08:19:56,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:19:56,374 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 182 [2019-09-10 08:19:56,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:56,737 INFO L225 Difference]: With dead ends: 285886 [2019-09-10 08:19:56,737 INFO L226 Difference]: Without dead ends: 285886 [2019-09-10 08:19:56,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:19:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285886 states. [2019-09-10 08:20:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285886 to 90556. [2019-09-10 08:20:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90556 states. [2019-09-10 08:20:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90556 states to 90556 states and 125524 transitions. [2019-09-10 08:20:01,303 INFO L78 Accepts]: Start accepts. Automaton has 90556 states and 125524 transitions. Word has length 182 [2019-09-10 08:20:01,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:01,304 INFO L475 AbstractCegarLoop]: Abstraction has 90556 states and 125524 transitions. [2019-09-10 08:20:01,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:20:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 90556 states and 125524 transitions. [2019-09-10 08:20:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:20:01,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:01,372 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] [2019-09-10 08:20:01,372 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:01,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:01,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1284939698, now seen corresponding path program 1 times [2019-09-10 08:20:01,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:01,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:01,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:01,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:01,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:01,489 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 08:20:01,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:01,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:20:01,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:01,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:20:01,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:20:01,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:20:01,491 INFO L87 Difference]: Start difference. First operand 90556 states and 125524 transitions. Second operand 5 states. [2019-09-10 08:20:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:02,179 INFO L93 Difference]: Finished difference Result 163156 states and 226471 transitions. [2019-09-10 08:20:02,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:20:02,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-10 08:20:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:02,349 INFO L225 Difference]: With dead ends: 163156 [2019-09-10 08:20:02,349 INFO L226 Difference]: Without dead ends: 163156 [2019-09-10 08:20:02,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:20:02,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163156 states. [2019-09-10 08:20:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163156 to 149846. [2019-09-10 08:20:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149846 states. [2019-09-10 08:20:04,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149846 states to 149846 states and 208610 transitions. [2019-09-10 08:20:04,667 INFO L78 Accepts]: Start accepts. Automaton has 149846 states and 208610 transitions. Word has length 183 [2019-09-10 08:20:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:04,668 INFO L475 AbstractCegarLoop]: Abstraction has 149846 states and 208610 transitions. [2019-09-10 08:20:04,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:20:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 149846 states and 208610 transitions. [2019-09-10 08:20:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:20:04,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:04,778 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] [2019-09-10 08:20:04,778 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:04,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:04,778 INFO L82 PathProgramCache]: Analyzing trace with hash -657180844, now seen corresponding path program 1 times [2019-09-10 08:20:04,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:04,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:04,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:04,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:04,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:04,885 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 08:20:04,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:04,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:20:04,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:04,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:20:04,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:20:04,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:20:04,887 INFO L87 Difference]: Start difference. First operand 149846 states and 208610 transitions. Second operand 5 states. [2019-09-10 08:20:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:05,493 INFO L93 Difference]: Finished difference Result 186568 states and 260238 transitions. [2019-09-10 08:20:05,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:20:05,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-10 08:20:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:05,660 INFO L225 Difference]: With dead ends: 186568 [2019-09-10 08:20:05,660 INFO L226 Difference]: Without dead ends: 186568 [2019-09-10 08:20:05,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:20:05,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186568 states. [2019-09-10 08:20:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186568 to 171788. [2019-09-10 08:20:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171788 states. [2019-09-10 08:20:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171788 states to 171788 states and 239755 transitions. [2019-09-10 08:20:10,465 INFO L78 Accepts]: Start accepts. Automaton has 171788 states and 239755 transitions. Word has length 183 [2019-09-10 08:20:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:10,465 INFO L475 AbstractCegarLoop]: Abstraction has 171788 states and 239755 transitions. [2019-09-10 08:20:10,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:20:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 171788 states and 239755 transitions. [2019-09-10 08:20:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:20:10,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:10,574 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] [2019-09-10 08:20:10,574 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:10,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:10,575 INFO L82 PathProgramCache]: Analyzing trace with hash 703430059, now seen corresponding path program 1 times [2019-09-10 08:20:10,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:10,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:10,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:10,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:10,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:10,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:10,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:10,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:20:10,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:10,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:20:10,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:20:10,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:20:10,703 INFO L87 Difference]: Start difference. First operand 171788 states and 239755 transitions. Second operand 5 states. [2019-09-10 08:20:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:11,613 INFO L93 Difference]: Finished difference Result 208614 states and 291181 transitions. [2019-09-10 08:20:11,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:20:11,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-10 08:20:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:11,854 INFO L225 Difference]: With dead ends: 208614 [2019-09-10 08:20:11,854 INFO L226 Difference]: Without dead ends: 208614 [2019-09-10 08:20:11,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:20:11,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208614 states. [2019-09-10 08:20:14,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208614 to 191668. [2019-09-10 08:20:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191668 states. [2019-09-10 08:20:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191668 states to 191668 states and 267786 transitions. [2019-09-10 08:20:14,446 INFO L78 Accepts]: Start accepts. Automaton has 191668 states and 267786 transitions. Word has length 183 [2019-09-10 08:20:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:14,446 INFO L475 AbstractCegarLoop]: Abstraction has 191668 states and 267786 transitions. [2019-09-10 08:20:14,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:20:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 191668 states and 267786 transitions. [2019-09-10 08:20:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:20:14,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:14,565 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] [2019-09-10 08:20:14,565 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:14,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:14,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2105194156, now seen corresponding path program 1 times [2019-09-10 08:20:14,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:14,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:14,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:14,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:14,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:14,976 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 08:20:14,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:14,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:20:14,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:14,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:20:14,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:20:14,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:20:14,977 INFO L87 Difference]: Start difference. First operand 191668 states and 267786 transitions. Second operand 14 states. [2019-09-10 08:20:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:22,749 INFO L93 Difference]: Finished difference Result 569977 states and 799555 transitions. [2019-09-10 08:20:22,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:20:22,750 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 183 [2019-09-10 08:20:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:23,461 INFO L225 Difference]: With dead ends: 569977 [2019-09-10 08:20:23,461 INFO L226 Difference]: Without dead ends: 569977 [2019-09-10 08:20:23,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:20:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569977 states. [2019-09-10 08:20:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569977 to 159204. [2019-09-10 08:20:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159204 states. [2019-09-10 08:20:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159204 states to 159204 states and 222871 transitions. [2019-09-10 08:20:27,675 INFO L78 Accepts]: Start accepts. Automaton has 159204 states and 222871 transitions. Word has length 183 [2019-09-10 08:20:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:27,676 INFO L475 AbstractCegarLoop]: Abstraction has 159204 states and 222871 transitions. [2019-09-10 08:20:27,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:20:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 159204 states and 222871 transitions. [2019-09-10 08:20:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:20:27,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:27,789 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] [2019-09-10 08:20:27,790 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:27,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:27,790 INFO L82 PathProgramCache]: Analyzing trace with hash -257360994, now seen corresponding path program 1 times [2019-09-10 08:20:27,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:27,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:27,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:27,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:27,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:28,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:28,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:20:28,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:28,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:20:28,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:20:28,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:20:28,512 INFO L87 Difference]: Start difference. First operand 159204 states and 222871 transitions. Second operand 5 states. [2019-09-10 08:20:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:29,174 INFO L93 Difference]: Finished difference Result 193268 states and 270378 transitions. [2019-09-10 08:20:29,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:20:29,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-10 08:20:29,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:29,374 INFO L225 Difference]: With dead ends: 193268 [2019-09-10 08:20:29,375 INFO L226 Difference]: Without dead ends: 193268 [2019-09-10 08:20:29,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:20:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193268 states. [2019-09-10 08:20:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193268 to 177538. [2019-09-10 08:20:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177538 states. [2019-09-10 08:20:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177538 states to 177538 states and 248576 transitions. [2019-09-10 08:20:34,960 INFO L78 Accepts]: Start accepts. Automaton has 177538 states and 248576 transitions. Word has length 183 [2019-09-10 08:20:34,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:34,960 INFO L475 AbstractCegarLoop]: Abstraction has 177538 states and 248576 transitions. [2019-09-10 08:20:34,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:20:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 177538 states and 248576 transitions. [2019-09-10 08:20:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:20:35,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:35,066 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] [2019-09-10 08:20:35,066 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:35,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:35,066 INFO L82 PathProgramCache]: Analyzing trace with hash 483817445, now seen corresponding path program 1 times [2019-09-10 08:20:35,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:35,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:35,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:35,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:35,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:35,145 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 08:20:35,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:35,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:20:35,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:35,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:20:35,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:20:35,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:20:35,146 INFO L87 Difference]: Start difference. First operand 177538 states and 248576 transitions. Second operand 3 states. [2019-09-10 08:20:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:35,367 INFO L93 Difference]: Finished difference Result 98989 states and 136341 transitions. [2019-09-10 08:20:35,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:20:35,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-10 08:20:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:35,461 INFO L225 Difference]: With dead ends: 98989 [2019-09-10 08:20:35,461 INFO L226 Difference]: Without dead ends: 98989 [2019-09-10 08:20:35,462 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 08:20:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98989 states. [2019-09-10 08:20:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98989 to 98987. [2019-09-10 08:20:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98987 states. [2019-09-10 08:20:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98987 states to 98987 states and 136340 transitions. [2019-09-10 08:20:36,363 INFO L78 Accepts]: Start accepts. Automaton has 98987 states and 136340 transitions. Word has length 184 [2019-09-10 08:20:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:36,363 INFO L475 AbstractCegarLoop]: Abstraction has 98987 states and 136340 transitions. [2019-09-10 08:20:36,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:20:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 98987 states and 136340 transitions. [2019-09-10 08:20:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:20:36,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:36,418 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:36,419 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:36,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:36,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1656820827, now seen corresponding path program 1 times [2019-09-10 08:20:36,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:36,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:36,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:36,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:36,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:36,495 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 08:20:36,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:36,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:20:36,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:36,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:20:36,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:20:36,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:20:36,497 INFO L87 Difference]: Start difference. First operand 98987 states and 136340 transitions. Second operand 3 states. [2019-09-10 08:20:36,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:36,659 INFO L93 Difference]: Finished difference Result 56242 states and 76415 transitions. [2019-09-10 08:20:36,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:20:36,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-10 08:20:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:36,721 INFO L225 Difference]: With dead ends: 56242 [2019-09-10 08:20:36,721 INFO L226 Difference]: Without dead ends: 56242 [2019-09-10 08:20:36,721 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 08:20:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56242 states. [2019-09-10 08:20:37,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56242 to 56240. [2019-09-10 08:20:37,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56240 states. [2019-09-10 08:20:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56240 states to 56240 states and 76414 transitions. [2019-09-10 08:20:37,883 INFO L78 Accepts]: Start accepts. Automaton has 56240 states and 76414 transitions. Word has length 184 [2019-09-10 08:20:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:37,883 INFO L475 AbstractCegarLoop]: Abstraction has 56240 states and 76414 transitions. [2019-09-10 08:20:37,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:20:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 56240 states and 76414 transitions. [2019-09-10 08:20:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:20:37,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:37,914 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] [2019-09-10 08:20:37,915 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:37,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:37,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1454752053, now seen corresponding path program 1 times [2019-09-10 08:20:37,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:37,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:37,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:37,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:37,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:38,168 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 08:20:38,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:38,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:20:38,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:38,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:20:38,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:20:38,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:20:38,170 INFO L87 Difference]: Start difference. First operand 56240 states and 76414 transitions. Second operand 10 states. [2019-09-10 08:20:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:40,878 INFO L93 Difference]: Finished difference Result 308071 states and 424215 transitions. [2019-09-10 08:20:40,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:20:40,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2019-09-10 08:20:40,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:41,216 INFO L225 Difference]: With dead ends: 308071 [2019-09-10 08:20:41,217 INFO L226 Difference]: Without dead ends: 308071 [2019-09-10 08:20:41,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:20:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308071 states. [2019-09-10 08:20:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308071 to 56792. [2019-09-10 08:20:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56792 states. [2019-09-10 08:20:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56792 states to 56792 states and 77161 transitions. [2019-09-10 08:20:43,832 INFO L78 Accepts]: Start accepts. Automaton has 56792 states and 77161 transitions. Word has length 184 [2019-09-10 08:20:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:43,833 INFO L475 AbstractCegarLoop]: Abstraction has 56792 states and 77161 transitions. [2019-09-10 08:20:43,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:20:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 56792 states and 77161 transitions. [2019-09-10 08:20:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:20:43,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:43,868 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] [2019-09-10 08:20:43,868 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:43,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:43,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1671974860, now seen corresponding path program 1 times [2019-09-10 08:20:43,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:43,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:43,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:43,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:43,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:43,958 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 08:20:43,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:43,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:20:43,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:43,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:20:43,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:20:43,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:20:43,960 INFO L87 Difference]: Start difference. First operand 56792 states and 77161 transitions. Second operand 3 states. [2019-09-10 08:20:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:44,054 INFO L93 Difference]: Finished difference Result 35248 states and 47221 transitions. [2019-09-10 08:20:44,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:20:44,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-10 08:20:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:44,085 INFO L225 Difference]: With dead ends: 35248 [2019-09-10 08:20:44,085 INFO L226 Difference]: Without dead ends: 35248 [2019-09-10 08:20:44,086 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 08:20:44,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35248 states. [2019-09-10 08:20:44,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35248 to 35246. [2019-09-10 08:20:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35246 states. [2019-09-10 08:20:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35246 states to 35246 states and 47220 transitions. [2019-09-10 08:20:44,382 INFO L78 Accepts]: Start accepts. Automaton has 35246 states and 47220 transitions. Word has length 184 [2019-09-10 08:20:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:44,383 INFO L475 AbstractCegarLoop]: Abstraction has 35246 states and 47220 transitions. [2019-09-10 08:20:44,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:20:44,383 INFO L276 IsEmpty]: Start isEmpty. Operand 35246 states and 47220 transitions. [2019-09-10 08:20:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:20:44,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:44,409 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] [2019-09-10 08:20:44,409 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:44,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1516962193, now seen corresponding path program 1 times [2019-09-10 08:20:44,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:44,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:44,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:44,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:44,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:45,362 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 08:20:45,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:45,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:20:45,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:45,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:20:45,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:20:45,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:20:45,364 INFO L87 Difference]: Start difference. First operand 35246 states and 47220 transitions. Second operand 16 states. [2019-09-10 08:20:52,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:52,683 INFO L93 Difference]: Finished difference Result 150736 states and 201435 transitions. [2019-09-10 08:20:52,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 08:20:52,684 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 184 [2019-09-10 08:20:52,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:52,822 INFO L225 Difference]: With dead ends: 150736 [2019-09-10 08:20:52,822 INFO L226 Difference]: Without dead ends: 150736 [2019-09-10 08:20:52,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1158, Invalid=3954, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 08:20:52,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150736 states. [2019-09-10 08:20:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150736 to 35518. [2019-09-10 08:20:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35518 states. [2019-09-10 08:20:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35518 states to 35518 states and 47616 transitions. [2019-09-10 08:20:54,129 INFO L78 Accepts]: Start accepts. Automaton has 35518 states and 47616 transitions. Word has length 184 [2019-09-10 08:20:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:54,129 INFO L475 AbstractCegarLoop]: Abstraction has 35518 states and 47616 transitions. [2019-09-10 08:20:54,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:20:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 35518 states and 47616 transitions. [2019-09-10 08:20:54,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:20:54,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:54,152 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] [2019-09-10 08:20:54,152 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:54,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:54,153 INFO L82 PathProgramCache]: Analyzing trace with hash -341374658, now seen corresponding path program 1 times [2019-09-10 08:20:54,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:54,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:54,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:54,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:54,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:54,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:54,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:20:54,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:54,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:20:54,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:20:54,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:20:54,201 INFO L87 Difference]: Start difference. First operand 35518 states and 47616 transitions. Second operand 3 states. [2019-09-10 08:20:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:54,396 INFO L93 Difference]: Finished difference Result 34160 states and 45441 transitions. [2019-09-10 08:20:54,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:20:54,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 08:20:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:54,426 INFO L225 Difference]: With dead ends: 34160 [2019-09-10 08:20:54,426 INFO L226 Difference]: Without dead ends: 34160 [2019-09-10 08:20:54,426 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 08:20:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34160 states. [2019-09-10 08:20:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34160 to 34160. [2019-09-10 08:20:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34160 states. [2019-09-10 08:20:54,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34160 states to 34160 states and 45441 transitions. [2019-09-10 08:20:54,681 INFO L78 Accepts]: Start accepts. Automaton has 34160 states and 45441 transitions. Word has length 185 [2019-09-10 08:20:54,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:54,681 INFO L475 AbstractCegarLoop]: Abstraction has 34160 states and 45441 transitions. [2019-09-10 08:20:54,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:20:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 34160 states and 45441 transitions. [2019-09-10 08:20:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:20:54,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:54,703 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] [2019-09-10 08:20:54,703 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:54,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1769931108, now seen corresponding path program 1 times [2019-09-10 08:20:54,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:54,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:54,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:55,007 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 08:20:55,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:55,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:20:55,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:55,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:20:55,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:20:55,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:20:55,008 INFO L87 Difference]: Start difference. First operand 34160 states and 45441 transitions. Second operand 12 states. [2019-09-10 08:20:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:57,512 INFO L93 Difference]: Finished difference Result 90275 states and 120416 transitions. [2019-09-10 08:20:57,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:20:57,513 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 185 [2019-09-10 08:20:57,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:57,587 INFO L225 Difference]: With dead ends: 90275 [2019-09-10 08:20:57,587 INFO L226 Difference]: Without dead ends: 90275 [2019-09-10 08:20:57,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:20:57,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90275 states. [2019-09-10 08:20:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90275 to 25787. [2019-09-10 08:20:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25787 states. [2019-09-10 08:20:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25787 states to 25787 states and 34815 transitions. [2019-09-10 08:20:58,313 INFO L78 Accepts]: Start accepts. Automaton has 25787 states and 34815 transitions. Word has length 185 [2019-09-10 08:20:58,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:58,314 INFO L475 AbstractCegarLoop]: Abstraction has 25787 states and 34815 transitions. [2019-09-10 08:20:58,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:20:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 25787 states and 34815 transitions. [2019-09-10 08:20:58,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:20:58,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:58,325 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] [2019-09-10 08:20:58,326 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:58,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:58,326 INFO L82 PathProgramCache]: Analyzing trace with hash -566482271, now seen corresponding path program 1 times [2019-09-10 08:20:58,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:58,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:58,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:58,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:58,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:58,623 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 08:20:58,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:58,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:20:58,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:58,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:20:58,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:20:58,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:20:58,624 INFO L87 Difference]: Start difference. First operand 25787 states and 34815 transitions. Second operand 12 states. [2019-09-10 08:21:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:00,978 INFO L93 Difference]: Finished difference Result 51210 states and 71070 transitions. [2019-09-10 08:21:00,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:00,979 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 185 [2019-09-10 08:21:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:01,023 INFO L225 Difference]: With dead ends: 51210 [2019-09-10 08:21:01,023 INFO L226 Difference]: Without dead ends: 51210 [2019-09-10 08:21:01,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:21:01,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51210 states. [2019-09-10 08:21:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51210 to 23153. [2019-09-10 08:21:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23153 states. [2019-09-10 08:21:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23153 states to 23153 states and 31071 transitions. [2019-09-10 08:21:01,316 INFO L78 Accepts]: Start accepts. Automaton has 23153 states and 31071 transitions. Word has length 185 [2019-09-10 08:21:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:01,317 INFO L475 AbstractCegarLoop]: Abstraction has 23153 states and 31071 transitions. [2019-09-10 08:21:01,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:21:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 23153 states and 31071 transitions. [2019-09-10 08:21:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:21:01,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:01,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, 1, 1, 1, 1, 1, 1, 1, 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 08:21:01,325 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:01,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:01,325 INFO L82 PathProgramCache]: Analyzing trace with hash -822250241, now seen corresponding path program 1 times [2019-09-10 08:21:01,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:01,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:01,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:01,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:01,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:01,673 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 08:21:01,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:01,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:21:01,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:01,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:21:01,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:21:01,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:21:01,675 INFO L87 Difference]: Start difference. First operand 23153 states and 31071 transitions. Second operand 12 states. [2019-09-10 08:21:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:05,537 INFO L93 Difference]: Finished difference Result 104029 states and 140649 transitions. [2019-09-10 08:21:05,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:21:05,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 185 [2019-09-10 08:21:05,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:05,630 INFO L225 Difference]: With dead ends: 104029 [2019-09-10 08:21:05,630 INFO L226 Difference]: Without dead ends: 104029 [2019-09-10 08:21:05,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=322, Invalid=868, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:21:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104029 states. [2019-09-10 08:21:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104029 to 28480. [2019-09-10 08:21:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28480 states. [2019-09-10 08:21:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28480 states to 28480 states and 37809 transitions. [2019-09-10 08:21:06,195 INFO L78 Accepts]: Start accepts. Automaton has 28480 states and 37809 transitions. Word has length 185 [2019-09-10 08:21:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:06,195 INFO L475 AbstractCegarLoop]: Abstraction has 28480 states and 37809 transitions. [2019-09-10 08:21:06,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:21:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 28480 states and 37809 transitions. [2019-09-10 08:21:06,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:21:06,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:06,208 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] [2019-09-10 08:21:06,208 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:06,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:06,208 INFO L82 PathProgramCache]: Analyzing trace with hash -866722416, now seen corresponding path program 1 times [2019-09-10 08:21:06,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:06,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:06,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:06,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:06,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:06,293 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 08:21:06,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:06,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:21:06,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:06,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:21:06,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:21:06,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:21:06,294 INFO L87 Difference]: Start difference. First operand 28480 states and 37809 transitions. Second operand 3 states. [2019-09-10 08:21:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:06,360 INFO L93 Difference]: Finished difference Result 17708 states and 23057 transitions. [2019-09-10 08:21:06,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:21:06,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 08:21:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:06,378 INFO L225 Difference]: With dead ends: 17708 [2019-09-10 08:21:06,379 INFO L226 Difference]: Without dead ends: 17708 [2019-09-10 08:21:06,379 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 08:21:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17708 states. [2019-09-10 08:21:06,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17708 to 17706. [2019-09-10 08:21:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17706 states. [2019-09-10 08:21:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17706 states to 17706 states and 23056 transitions. [2019-09-10 08:21:06,561 INFO L78 Accepts]: Start accepts. Automaton has 17706 states and 23056 transitions. Word has length 185 [2019-09-10 08:21:06,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:06,561 INFO L475 AbstractCegarLoop]: Abstraction has 17706 states and 23056 transitions. [2019-09-10 08:21:06,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:21:06,561 INFO L276 IsEmpty]: Start isEmpty. Operand 17706 states and 23056 transitions. [2019-09-10 08:21:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:21:06,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:06,573 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] [2019-09-10 08:21:06,574 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:06,574 INFO L82 PathProgramCache]: Analyzing trace with hash 971971826, now seen corresponding path program 1 times [2019-09-10 08:21:06,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:06,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:06,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:06,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:06,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:06,830 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 08:21:06,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:06,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:21:06,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:06,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:21:06,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:21:06,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:21:06,832 INFO L87 Difference]: Start difference. First operand 17706 states and 23056 transitions. Second operand 10 states. [2019-09-10 08:21:09,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:09,086 INFO L93 Difference]: Finished difference Result 89438 states and 118148 transitions. [2019-09-10 08:21:09,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:21:09,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2019-09-10 08:21:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:09,160 INFO L225 Difference]: With dead ends: 89438 [2019-09-10 08:21:09,160 INFO L226 Difference]: Without dead ends: 89438 [2019-09-10 08:21:09,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:21:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89438 states. [2019-09-10 08:21:09,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89438 to 17756. [2019-09-10 08:21:09,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17756 states. [2019-09-10 08:21:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17756 states to 17756 states and 23111 transitions. [2019-09-10 08:21:09,650 INFO L78 Accepts]: Start accepts. Automaton has 17756 states and 23111 transitions. Word has length 185 [2019-09-10 08:21:09,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:09,651 INFO L475 AbstractCegarLoop]: Abstraction has 17756 states and 23111 transitions. [2019-09-10 08:21:09,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:21:09,651 INFO L276 IsEmpty]: Start isEmpty. Operand 17756 states and 23111 transitions. [2019-09-10 08:21:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:21:09,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:09,765 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] [2019-09-10 08:21:09,765 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:09,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:09,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1129912610, now seen corresponding path program 1 times [2019-09-10 08:21:09,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:09,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:09,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:09,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:09,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:10,002 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 08:21:10,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:10,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:21:10,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:10,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:21:10,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:21:10,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:21:10,003 INFO L87 Difference]: Start difference. First operand 17756 states and 23111 transitions. Second operand 10 states. [2019-09-10 08:21:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:12,047 INFO L93 Difference]: Finished difference Result 83102 states and 109058 transitions. [2019-09-10 08:21:12,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:21:12,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2019-09-10 08:21:12,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:12,127 INFO L225 Difference]: With dead ends: 83102 [2019-09-10 08:21:12,127 INFO L226 Difference]: Without dead ends: 83102 [2019-09-10 08:21:12,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:21:12,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83102 states. [2019-09-10 08:21:12,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83102 to 17912. [2019-09-10 08:21:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17912 states. [2019-09-10 08:21:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17912 states to 17912 states and 23285 transitions. [2019-09-10 08:21:12,581 INFO L78 Accepts]: Start accepts. Automaton has 17912 states and 23285 transitions. Word has length 185 [2019-09-10 08:21:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:12,582 INFO L475 AbstractCegarLoop]: Abstraction has 17912 states and 23285 transitions. [2019-09-10 08:21:12,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:21:12,582 INFO L276 IsEmpty]: Start isEmpty. Operand 17912 states and 23285 transitions. [2019-09-10 08:21:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:21:12,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:12,591 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] [2019-09-10 08:21:12,591 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash -529203303, now seen corresponding path program 1 times [2019-09-10 08:21:12,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:12,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:12,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:12,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:12,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:12,867 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 08:21:12,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:12,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:21:12,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:12,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:21:12,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:21:12,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:21:12,869 INFO L87 Difference]: Start difference. First operand 17912 states and 23285 transitions. Second operand 10 states. [2019-09-10 08:21:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:14,339 INFO L93 Difference]: Finished difference Result 32086 states and 43380 transitions. [2019-09-10 08:21:14,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:21:14,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2019-09-10 08:21:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:14,365 INFO L225 Difference]: With dead ends: 32086 [2019-09-10 08:21:14,365 INFO L226 Difference]: Without dead ends: 32086 [2019-09-10 08:21:14,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:21:14,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32086 states. [2019-09-10 08:21:14,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32086 to 13866. [2019-09-10 08:21:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13866 states. [2019-09-10 08:21:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13866 states to 13866 states and 18277 transitions. [2019-09-10 08:21:14,558 INFO L78 Accepts]: Start accepts. Automaton has 13866 states and 18277 transitions. Word has length 185 [2019-09-10 08:21:14,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:14,559 INFO L475 AbstractCegarLoop]: Abstraction has 13866 states and 18277 transitions. [2019-09-10 08:21:14,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:21:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 13866 states and 18277 transitions. [2019-09-10 08:21:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:21:14,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:14,565 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] [2019-09-10 08:21:14,565 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:14,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:14,565 INFO L82 PathProgramCache]: Analyzing trace with hash -183377798, now seen corresponding path program 1 times [2019-09-10 08:21:14,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:14,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:14,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:14,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:14,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:14,776 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 08:21:14,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:14,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:21:14,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:14,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:21:14,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:21:14,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:21:14,777 INFO L87 Difference]: Start difference. First operand 13866 states and 18277 transitions. Second operand 10 states. [2019-09-10 08:21:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:16,466 INFO L93 Difference]: Finished difference Result 78314 states and 103210 transitions. [2019-09-10 08:21:16,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:21:16,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 186 [2019-09-10 08:21:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:16,537 INFO L225 Difference]: With dead ends: 78314 [2019-09-10 08:21:16,537 INFO L226 Difference]: Without dead ends: 78314 [2019-09-10 08:21:16,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:21:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78314 states. [2019-09-10 08:21:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78314 to 14080. [2019-09-10 08:21:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14080 states. [2019-09-10 08:21:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14080 states to 14080 states and 18542 transitions. [2019-09-10 08:21:16,910 INFO L78 Accepts]: Start accepts. Automaton has 14080 states and 18542 transitions. Word has length 186 [2019-09-10 08:21:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:16,910 INFO L475 AbstractCegarLoop]: Abstraction has 14080 states and 18542 transitions. [2019-09-10 08:21:16,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:21:16,911 INFO L276 IsEmpty]: Start isEmpty. Operand 14080 states and 18542 transitions. [2019-09-10 08:21:16,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:21:16,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:16,917 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] [2019-09-10 08:21:16,917 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:16,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:16,918 INFO L82 PathProgramCache]: Analyzing trace with hash -862841792, now seen corresponding path program 1 times [2019-09-10 08:21:16,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:16,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:16,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:16,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:16,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:17,157 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 08:21:17,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:17,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:21:17,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:17,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:21:17,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:21:17,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:21:17,158 INFO L87 Difference]: Start difference. First operand 14080 states and 18542 transitions. Second operand 10 states. [2019-09-10 08:21:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:19,326 INFO L93 Difference]: Finished difference Result 68300 states and 90628 transitions. [2019-09-10 08:21:19,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:21:19,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 187 [2019-09-10 08:21:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:19,381 INFO L225 Difference]: With dead ends: 68300 [2019-09-10 08:21:19,382 INFO L226 Difference]: Without dead ends: 68300 [2019-09-10 08:21:19,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:21:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68300 states. [2019-09-10 08:21:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68300 to 14616. [2019-09-10 08:21:19,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14616 states. [2019-09-10 08:21:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14616 states to 14616 states and 19158 transitions. [2019-09-10 08:21:19,756 INFO L78 Accepts]: Start accepts. Automaton has 14616 states and 19158 transitions. Word has length 187 [2019-09-10 08:21:19,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:19,757 INFO L475 AbstractCegarLoop]: Abstraction has 14616 states and 19158 transitions. [2019-09-10 08:21:19,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:21:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 14616 states and 19158 transitions. [2019-09-10 08:21:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 08:21:19,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:19,763 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] [2019-09-10 08:21:19,763 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:19,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:19,764 INFO L82 PathProgramCache]: Analyzing trace with hash 759589853, now seen corresponding path program 1 times [2019-09-10 08:21:19,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:19,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:19,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:19,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:19,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:20,081 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 08:21:20,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:20,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:21:20,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:20,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:21:20,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:21:20,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:21:20,082 INFO L87 Difference]: Start difference. First operand 14616 states and 19158 transitions. Second operand 12 states. [2019-09-10 08:21:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:23,251 INFO L93 Difference]: Finished difference Result 56810 states and 74910 transitions. [2019-09-10 08:21:23,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:21:23,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 188 [2019-09-10 08:21:23,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:23,295 INFO L225 Difference]: With dead ends: 56810 [2019-09-10 08:21:23,295 INFO L226 Difference]: Without dead ends: 56810 [2019-09-10 08:21:23,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=322, Invalid=868, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:21:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56810 states. [2019-09-10 08:21:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56810 to 20756. [2019-09-10 08:21:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20756 states. [2019-09-10 08:21:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20756 states to 20756 states and 26915 transitions. [2019-09-10 08:21:23,672 INFO L78 Accepts]: Start accepts. Automaton has 20756 states and 26915 transitions. Word has length 188 [2019-09-10 08:21:23,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:23,673 INFO L475 AbstractCegarLoop]: Abstraction has 20756 states and 26915 transitions. [2019-09-10 08:21:23,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:21:23,673 INFO L276 IsEmpty]: Start isEmpty. Operand 20756 states and 26915 transitions. [2019-09-10 08:21:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 08:21:23,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:23,684 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] [2019-09-10 08:21:23,684 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:23,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:23,684 INFO L82 PathProgramCache]: Analyzing trace with hash 478383418, now seen corresponding path program 1 times [2019-09-10 08:21:23,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:23,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:23,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:23,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:23,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:24,073 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 08:21:24,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:24,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:21:24,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:24,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:21:24,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:21:24,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:21:24,076 INFO L87 Difference]: Start difference. First operand 20756 states and 26915 transitions. Second operand 10 states. [2019-09-10 08:21:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:26,456 INFO L93 Difference]: Finished difference Result 66926 states and 88990 transitions. [2019-09-10 08:21:26,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:21:26,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2019-09-10 08:21:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:26,510 INFO L225 Difference]: With dead ends: 66926 [2019-09-10 08:21:26,510 INFO L226 Difference]: Without dead ends: 66926 [2019-09-10 08:21:26,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:21:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66926 states. [2019-09-10 08:21:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66926 to 20182. [2019-09-10 08:21:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20182 states. [2019-09-10 08:21:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20182 states to 20182 states and 26127 transitions. [2019-09-10 08:21:26,889 INFO L78 Accepts]: Start accepts. Automaton has 20182 states and 26127 transitions. Word has length 188 [2019-09-10 08:21:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:26,889 INFO L475 AbstractCegarLoop]: Abstraction has 20182 states and 26127 transitions. [2019-09-10 08:21:26,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:21:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 20182 states and 26127 transitions. [2019-09-10 08:21:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:21:26,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:26,900 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] [2019-09-10 08:21:26,900 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:26,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:26,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1128783347, now seen corresponding path program 1 times [2019-09-10 08:21:26,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:26,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:26,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:26,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:26,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:27,139 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 08:21:27,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:27,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:21:27,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:27,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:21:27,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:21:27,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:21:27,140 INFO L87 Difference]: Start difference. First operand 20182 states and 26127 transitions. Second operand 10 states. [2019-09-10 08:21:29,140 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-09-10 08:21:29,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:29,145 INFO L93 Difference]: Finished difference Result 61136 states and 80378 transitions. [2019-09-10 08:21:29,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:21:29,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2019-09-10 08:21:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:29,187 INFO L225 Difference]: With dead ends: 61136 [2019-09-10 08:21:29,187 INFO L226 Difference]: Without dead ends: 61136 [2019-09-10 08:21:29,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:21:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61136 states. [2019-09-10 08:21:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61136 to 18845. [2019-09-10 08:21:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18845 states. [2019-09-10 08:21:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18845 states to 18845 states and 24506 transitions. [2019-09-10 08:21:29,553 INFO L78 Accepts]: Start accepts. Automaton has 18845 states and 24506 transitions. Word has length 189 [2019-09-10 08:21:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:29,554 INFO L475 AbstractCegarLoop]: Abstraction has 18845 states and 24506 transitions. [2019-09-10 08:21:29,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:21:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 18845 states and 24506 transitions. [2019-09-10 08:21:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:21:29,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:29,563 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] [2019-09-10 08:21:29,563 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:29,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:29,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1917253519, now seen corresponding path program 1 times [2019-09-10 08:21:29,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:29,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:29,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:29,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:29,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:29,659 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 08:21:29,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:29,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:21:29,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:29,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:21:29,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:21:29,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:21:29,661 INFO L87 Difference]: Start difference. First operand 18845 states and 24506 transitions. Second operand 4 states. [2019-09-10 08:21:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:29,704 INFO L93 Difference]: Finished difference Result 18895 states and 24531 transitions. [2019-09-10 08:21:29,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:21:29,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-09-10 08:21:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:29,720 INFO L225 Difference]: With dead ends: 18895 [2019-09-10 08:21:29,721 INFO L226 Difference]: Without dead ends: 18841 [2019-09-10 08:21:29,721 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 08:21:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18841 states. [2019-09-10 08:21:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18841 to 18834. [2019-09-10 08:21:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18834 states. [2019-09-10 08:21:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18834 states to 18834 states and 24451 transitions. [2019-09-10 08:21:29,847 INFO L78 Accepts]: Start accepts. Automaton has 18834 states and 24451 transitions. Word has length 190 [2019-09-10 08:21:29,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:29,847 INFO L475 AbstractCegarLoop]: Abstraction has 18834 states and 24451 transitions. [2019-09-10 08:21:29,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:21:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 18834 states and 24451 transitions. [2019-09-10 08:21:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:21:29,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:29,857 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] [2019-09-10 08:21:29,857 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:29,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:29,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1536831170, now seen corresponding path program 1 times [2019-09-10 08:21:29,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:29,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:29,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:29,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:29,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:29,901 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 08:21:29,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:29,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:21:29,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:29,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:21:29,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:21:29,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:21:29,902 INFO L87 Difference]: Start difference. First operand 18834 states and 24451 transitions. Second operand 3 states. [2019-09-10 08:21:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:29,981 INFO L93 Difference]: Finished difference Result 23742 states and 29575 transitions. [2019-09-10 08:21:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:21:29,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-10 08:21:29,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:30,005 INFO L225 Difference]: With dead ends: 23742 [2019-09-10 08:21:30,005 INFO L226 Difference]: Without dead ends: 23740 [2019-09-10 08:21:30,005 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 08:21:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23740 states. [2019-09-10 08:21:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23740 to 22698. [2019-09-10 08:21:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22698 states. [2019-09-10 08:21:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22698 states to 22698 states and 28308 transitions. [2019-09-10 08:21:30,189 INFO L78 Accepts]: Start accepts. Automaton has 22698 states and 28308 transitions. Word has length 192 [2019-09-10 08:21:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:30,189 INFO L475 AbstractCegarLoop]: Abstraction has 22698 states and 28308 transitions. [2019-09-10 08:21:30,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:21:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 22698 states and 28308 transitions. [2019-09-10 08:21:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:21:30,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:30,201 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] [2019-09-10 08:21:30,201 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:30,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:30,202 INFO L82 PathProgramCache]: Analyzing trace with hash -38782446, now seen corresponding path program 1 times [2019-09-10 08:21:30,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:30,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:30,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:30,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:30,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:30,258 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 08:21:30,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:30,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:21:30,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:30,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:21:30,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:21:30,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:21:30,260 INFO L87 Difference]: Start difference. First operand 22698 states and 28308 transitions. Second operand 3 states. [2019-09-10 08:21:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:30,344 INFO L93 Difference]: Finished difference Result 24666 states and 30842 transitions. [2019-09-10 08:21:30,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:21:30,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-09-10 08:21:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:30,367 INFO L225 Difference]: With dead ends: 24666 [2019-09-10 08:21:30,367 INFO L226 Difference]: Without dead ends: 24666 [2019-09-10 08:21:30,367 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 08:21:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24666 states. [2019-09-10 08:21:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24666 to 23118. [2019-09-10 08:21:30,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23118 states. [2019-09-10 08:21:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23118 states to 23118 states and 28776 transitions. [2019-09-10 08:21:30,550 INFO L78 Accepts]: Start accepts. Automaton has 23118 states and 28776 transitions. Word has length 193 [2019-09-10 08:21:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:30,551 INFO L475 AbstractCegarLoop]: Abstraction has 23118 states and 28776 transitions. [2019-09-10 08:21:30,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:21:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 23118 states and 28776 transitions. [2019-09-10 08:21:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:21:30,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:30,565 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] [2019-09-10 08:21:30,565 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:30,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1129424335, now seen corresponding path program 1 times [2019-09-10 08:21:30,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:30,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:30,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:30,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:30,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:30,633 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 08:21:30,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:30,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:21:30,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:30,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:21:30,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:21:30,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:21:30,634 INFO L87 Difference]: Start difference. First operand 23118 states and 28776 transitions. Second operand 3 states. [2019-09-10 08:21:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:30,717 INFO L93 Difference]: Finished difference Result 22064 states and 27505 transitions. [2019-09-10 08:21:30,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:21:30,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-09-10 08:21:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:30,736 INFO L225 Difference]: With dead ends: 22064 [2019-09-10 08:21:30,736 INFO L226 Difference]: Without dead ends: 22058 [2019-09-10 08:21:30,737 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 08:21:30,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22058 states. [2019-09-10 08:21:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22058 to 16766. [2019-09-10 08:21:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16766 states. [2019-09-10 08:21:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16766 states to 16766 states and 20799 transitions. [2019-09-10 08:21:30,936 INFO L78 Accepts]: Start accepts. Automaton has 16766 states and 20799 transitions. Word has length 195 [2019-09-10 08:21:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:30,936 INFO L475 AbstractCegarLoop]: Abstraction has 16766 states and 20799 transitions. [2019-09-10 08:21:30,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:21:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 16766 states and 20799 transitions. [2019-09-10 08:21:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 08:21:30,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:30,944 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] [2019-09-10 08:21:30,944 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:30,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:30,945 INFO L82 PathProgramCache]: Analyzing trace with hash -472964127, now seen corresponding path program 1 times [2019-09-10 08:21:30,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:30,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:30,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:30,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:30,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:31,011 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 08:21:31,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:31,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:21:31,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:31,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:21:31,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:21:31,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:21:31,013 INFO L87 Difference]: Start difference. First operand 16766 states and 20799 transitions. Second operand 3 states. [2019-09-10 08:21:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:31,077 INFO L93 Difference]: Finished difference Result 17024 states and 20836 transitions. [2019-09-10 08:21:31,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:21:31,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-10 08:21:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:31,091 INFO L225 Difference]: With dead ends: 17024 [2019-09-10 08:21:31,091 INFO L226 Difference]: Without dead ends: 17024 [2019-09-10 08:21:31,092 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 08:21:31,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-09-10 08:21:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16862. [2019-09-10 08:21:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16862 states. [2019-09-10 08:21:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16862 states to 16862 states and 20675 transitions. [2019-09-10 08:21:31,331 INFO L78 Accepts]: Start accepts. Automaton has 16862 states and 20675 transitions. Word has length 196 [2019-09-10 08:21:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:31,332 INFO L475 AbstractCegarLoop]: Abstraction has 16862 states and 20675 transitions. [2019-09-10 08:21:31,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:21:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 16862 states and 20675 transitions. [2019-09-10 08:21:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 08:21:31,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:31,340 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] [2019-09-10 08:21:31,340 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:31,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:31,341 INFO L82 PathProgramCache]: Analyzing trace with hash 494913445, now seen corresponding path program 1 times [2019-09-10 08:21:31,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:31,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:31,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:31,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:31,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:31,526 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 08:21:31,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:31,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:21:31,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:31,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:21:31,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:21:31,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:21:31,528 INFO L87 Difference]: Start difference. First operand 16862 states and 20675 transitions. Second operand 8 states. [2019-09-10 08:21:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:31,895 INFO L93 Difference]: Finished difference Result 33380 states and 41292 transitions. [2019-09-10 08:21:31,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:21:31,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 196 [2019-09-10 08:21:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:31,930 INFO L225 Difference]: With dead ends: 33380 [2019-09-10 08:21:31,931 INFO L226 Difference]: Without dead ends: 33376 [2019-09-10 08:21:31,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:21:31,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33376 states. [2019-09-10 08:21:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33376 to 33366. [2019-09-10 08:21:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33366 states. [2019-09-10 08:21:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33366 states to 33366 states and 41283 transitions. [2019-09-10 08:21:32,271 INFO L78 Accepts]: Start accepts. Automaton has 33366 states and 41283 transitions. Word has length 196 [2019-09-10 08:21:32,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:32,271 INFO L475 AbstractCegarLoop]: Abstraction has 33366 states and 41283 transitions. [2019-09-10 08:21:32,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:21:32,271 INFO L276 IsEmpty]: Start isEmpty. Operand 33366 states and 41283 transitions. [2019-09-10 08:21:32,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 08:21:32,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:32,285 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] [2019-09-10 08:21:32,285 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:32,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:32,286 INFO L82 PathProgramCache]: Analyzing trace with hash 702973800, now seen corresponding path program 1 times [2019-09-10 08:21:32,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:32,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:32,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:32,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:32,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:32,651 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 08:21:32,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:32,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:21:32,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:32,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:21:32,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:21:32,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:21:32,652 INFO L87 Difference]: Start difference. First operand 33366 states and 41283 transitions. Second operand 12 states. [2019-09-10 08:21:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:35,853 INFO L93 Difference]: Finished difference Result 124376 states and 156122 transitions. [2019-09-10 08:21:35,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:21:35,853 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 196 [2019-09-10 08:21:35,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:35,958 INFO L225 Difference]: With dead ends: 124376 [2019-09-10 08:21:35,958 INFO L226 Difference]: Without dead ends: 124376 [2019-09-10 08:21:35,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=321, Invalid=869, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:21:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124376 states. [2019-09-10 08:21:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124376 to 32494. [2019-09-10 08:21:36,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32494 states. [2019-09-10 08:21:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32494 states to 32494 states and 40233 transitions. [2019-09-10 08:21:36,935 INFO L78 Accepts]: Start accepts. Automaton has 32494 states and 40233 transitions. Word has length 196 [2019-09-10 08:21:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:36,935 INFO L475 AbstractCegarLoop]: Abstraction has 32494 states and 40233 transitions. [2019-09-10 08:21:36,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:21:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 32494 states and 40233 transitions. [2019-09-10 08:21:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 08:21:36,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:36,948 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] [2019-09-10 08:21:36,948 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:36,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:36,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1108111406, now seen corresponding path program 1 times [2019-09-10 08:21:36,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:36,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:36,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:36,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:36,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:37,565 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 08:21:37,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:37,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:21:37,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:37,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:21:37,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:21:37,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:21:37,567 INFO L87 Difference]: Start difference. First operand 32494 states and 40233 transitions. Second operand 18 states. [2019-09-10 08:21:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:40,099 INFO L93 Difference]: Finished difference Result 163856 states and 204479 transitions. [2019-09-10 08:21:40,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:21:40,099 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 197 [2019-09-10 08:21:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:40,234 INFO L225 Difference]: With dead ends: 163856 [2019-09-10 08:21:40,234 INFO L226 Difference]: Without dead ends: 163856 [2019-09-10 08:21:40,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=181, Invalid=1079, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:21:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163856 states. [2019-09-10 08:21:41,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163856 to 38246. [2019-09-10 08:21:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38246 states. [2019-09-10 08:21:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38246 states to 38246 states and 47098 transitions. [2019-09-10 08:21:41,819 INFO L78 Accepts]: Start accepts. Automaton has 38246 states and 47098 transitions. Word has length 197 [2019-09-10 08:21:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:41,820 INFO L475 AbstractCegarLoop]: Abstraction has 38246 states and 47098 transitions. [2019-09-10 08:21:41,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:21:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 38246 states and 47098 transitions. [2019-09-10 08:21:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 08:21:41,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:41,838 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] [2019-09-10 08:21:41,839 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:41,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:41,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1354154773, now seen corresponding path program 1 times [2019-09-10 08:21:41,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:41,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:41,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:41,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:41,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:42,353 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 08:21:42,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:42,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:21:42,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:42,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:21:42,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:21:42,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:21:42,355 INFO L87 Difference]: Start difference. First operand 38246 states and 47098 transitions. Second operand 18 states. [2019-09-10 08:21:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:44,464 INFO L93 Difference]: Finished difference Result 178554 states and 221662 transitions. [2019-09-10 08:21:44,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:21:44,465 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 197 [2019-09-10 08:21:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:44,620 INFO L225 Difference]: With dead ends: 178554 [2019-09-10 08:21:44,620 INFO L226 Difference]: Without dead ends: 178554 [2019-09-10 08:21:44,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:21:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178554 states. [2019-09-10 08:21:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178554 to 46144. [2019-09-10 08:21:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46144 states. [2019-09-10 08:21:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46144 states to 46144 states and 56551 transitions. [2019-09-10 08:21:45,629 INFO L78 Accepts]: Start accepts. Automaton has 46144 states and 56551 transitions. Word has length 197 [2019-09-10 08:21:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:45,629 INFO L475 AbstractCegarLoop]: Abstraction has 46144 states and 56551 transitions. [2019-09-10 08:21:45,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:21:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 46144 states and 56551 transitions. [2019-09-10 08:21:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 08:21:45,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:45,651 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] [2019-09-10 08:21:45,652 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:45,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:45,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1132675954, now seen corresponding path program 1 times [2019-09-10 08:21:45,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:45,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:45,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:45,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:45,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:47,594 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 08:21:47,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:47,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2019-09-10 08:21:47,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:47,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 08:21:47,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 08:21:47,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1311, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:21:47,596 INFO L87 Difference]: Start difference. First operand 46144 states and 56551 transitions. Second operand 38 states. [2019-09-10 08:21:47,887 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-10 08:21:49,612 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 08:21:49,870 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 08:21:50,090 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 08:21:50,372 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 08:21:50,663 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:21:51,015 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 08:21:51,402 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-10 08:21:51,854 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-09-10 08:21:52,320 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2019-09-10 08:21:52,540 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 08:21:53,125 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 08:22:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:12,414 INFO L93 Difference]: Finished difference Result 269582 states and 331719 transitions. [2019-09-10 08:22:12,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 08:22:12,416 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 197 [2019-09-10 08:22:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:12,638 INFO L225 Difference]: With dead ends: 269582 [2019-09-10 08:22:12,638 INFO L226 Difference]: Without dead ends: 269582 [2019-09-10 08:22:12,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=849, Invalid=7161, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 08:22:12,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269582 states. [2019-09-10 08:22:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269582 to 47178. [2019-09-10 08:22:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47178 states. [2019-09-10 08:22:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47178 states to 47178 states and 57657 transitions. [2019-09-10 08:22:14,444 INFO L78 Accepts]: Start accepts. Automaton has 47178 states and 57657 transitions. Word has length 197 [2019-09-10 08:22:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:14,444 INFO L475 AbstractCegarLoop]: Abstraction has 47178 states and 57657 transitions. [2019-09-10 08:22:14,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 08:22:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 47178 states and 57657 transitions. [2019-09-10 08:22:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 08:22:14,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:14,467 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] [2019-09-10 08:22:14,467 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:14,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:14,467 INFO L82 PathProgramCache]: Analyzing trace with hash -108591862, now seen corresponding path program 1 times [2019-09-10 08:22:14,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:14,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:14,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:14,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:14,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:14,635 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 08:22:14,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:14,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:22:14,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:14,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:22:14,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:22:14,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:22:14,637 INFO L87 Difference]: Start difference. First operand 47178 states and 57657 transitions. Second operand 10 states. [2019-09-10 08:22:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:15,326 INFO L93 Difference]: Finished difference Result 107971 states and 134198 transitions. [2019-09-10 08:22:15,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:22:15,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 197 [2019-09-10 08:22:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:15,413 INFO L225 Difference]: With dead ends: 107971 [2019-09-10 08:22:15,414 INFO L226 Difference]: Without dead ends: 107971 [2019-09-10 08:22:15,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:22:15,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107971 states. [2019-09-10 08:22:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107971 to 50238. [2019-09-10 08:22:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50238 states. [2019-09-10 08:22:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50238 states to 50238 states and 61583 transitions. [2019-09-10 08:22:16,220 INFO L78 Accepts]: Start accepts. Automaton has 50238 states and 61583 transitions. Word has length 197 [2019-09-10 08:22:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:16,221 INFO L475 AbstractCegarLoop]: Abstraction has 50238 states and 61583 transitions. [2019-09-10 08:22:16,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:22:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 50238 states and 61583 transitions. [2019-09-10 08:22:16,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 08:22:16,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:16,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] [2019-09-10 08:22:16,245 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:16,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:16,246 INFO L82 PathProgramCache]: Analyzing trace with hash 208421937, now seen corresponding path program 1 times [2019-09-10 08:22:16,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:16,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:16,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:16,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:16,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:16,591 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 08:22:16,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:16,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:22:16,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:16,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:22:16,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:22:16,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:22:16,593 INFO L87 Difference]: Start difference. First operand 50238 states and 61583 transitions. Second operand 4 states. [2019-09-10 08:22:16,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:16,688 INFO L93 Difference]: Finished difference Result 32400 states and 40004 transitions. [2019-09-10 08:22:16,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:16,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-09-10 08:22:16,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:16,712 INFO L225 Difference]: With dead ends: 32400 [2019-09-10 08:22:16,712 INFO L226 Difference]: Without dead ends: 32335 [2019-09-10 08:22:16,712 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 08:22:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32335 states. [2019-09-10 08:22:16,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32335 to 32202. [2019-09-10 08:22:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32202 states. [2019-09-10 08:22:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32202 states to 32202 states and 39771 transitions. [2019-09-10 08:22:16,989 INFO L78 Accepts]: Start accepts. Automaton has 32202 states and 39771 transitions. Word has length 197 [2019-09-10 08:22:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:16,989 INFO L475 AbstractCegarLoop]: Abstraction has 32202 states and 39771 transitions. [2019-09-10 08:22:16,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:22:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 32202 states and 39771 transitions. [2019-09-10 08:22:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 08:22:17,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:17,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] [2019-09-10 08:22:17,001 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:17,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:17,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1896185741, now seen corresponding path program 1 times [2019-09-10 08:22:17,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:17,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:17,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:17,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:17,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:17,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:17,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:17,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:17,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:17,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:17,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:17,219 INFO L87 Difference]: Start difference. First operand 32202 states and 39771 transitions. Second operand 9 states. [2019-09-10 08:22:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:17,717 INFO L93 Difference]: Finished difference Result 82877 states and 103110 transitions. [2019-09-10 08:22:17,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:17,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 197 [2019-09-10 08:22:17,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:17,788 INFO L225 Difference]: With dead ends: 82877 [2019-09-10 08:22:17,788 INFO L226 Difference]: Without dead ends: 82877 [2019-09-10 08:22:17,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:22:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82877 states. [2019-09-10 08:22:18,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82877 to 46477. [2019-09-10 08:22:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46477 states. [2019-09-10 08:22:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46477 states to 46477 states and 57790 transitions. [2019-09-10 08:22:18,324 INFO L78 Accepts]: Start accepts. Automaton has 46477 states and 57790 transitions. Word has length 197 [2019-09-10 08:22:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:18,324 INFO L475 AbstractCegarLoop]: Abstraction has 46477 states and 57790 transitions. [2019-09-10 08:22:18,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 46477 states and 57790 transitions. [2019-09-10 08:22:18,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 08:22:18,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:18,338 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] [2019-09-10 08:22:18,338 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:18,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:18,338 INFO L82 PathProgramCache]: Analyzing trace with hash 83156040, now seen corresponding path program 1 times [2019-09-10 08:22:18,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:18,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:18,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:18,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:18,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:18,408 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 08:22:18,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:18,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:22:18,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:18,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:22:18,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:22:18,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:22:18,410 INFO L87 Difference]: Start difference. First operand 46477 states and 57790 transitions. Second operand 3 states. [2019-09-10 08:22:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:18,599 INFO L93 Difference]: Finished difference Result 39856 states and 49460 transitions. [2019-09-10 08:22:18,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:22:18,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-09-10 08:22:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:18,629 INFO L225 Difference]: With dead ends: 39856 [2019-09-10 08:22:18,630 INFO L226 Difference]: Without dead ends: 39856 [2019-09-10 08:22:18,630 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 08:22:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39856 states. [2019-09-10 08:22:18,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39856 to 39856. [2019-09-10 08:22:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39856 states. [2019-09-10 08:22:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39856 states to 39856 states and 49460 transitions. [2019-09-10 08:22:18,976 INFO L78 Accepts]: Start accepts. Automaton has 39856 states and 49460 transitions. Word has length 197 [2019-09-10 08:22:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:18,976 INFO L475 AbstractCegarLoop]: Abstraction has 39856 states and 49460 transitions. [2019-09-10 08:22:18,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:22:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 39856 states and 49460 transitions. [2019-09-10 08:22:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 08:22:18,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:18,989 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] [2019-09-10 08:22:18,989 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:18,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:18,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1689540336, now seen corresponding path program 1 times [2019-09-10 08:22:18,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:18,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:18,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:18,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:18,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:19,036 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 08:22:19,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:19,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:22:19,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:19,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:22:19,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:22:19,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:22:19,037 INFO L87 Difference]: Start difference. First operand 39856 states and 49460 transitions. Second operand 3 states. [2019-09-10 08:22:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:19,230 INFO L93 Difference]: Finished difference Result 35760 states and 44254 transitions. [2019-09-10 08:22:19,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:22:19,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-09-10 08:22:19,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:19,258 INFO L225 Difference]: With dead ends: 35760 [2019-09-10 08:22:19,258 INFO L226 Difference]: Without dead ends: 35760 [2019-09-10 08:22:19,259 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 08:22:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35760 states. [2019-09-10 08:22:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35760 to 35760. [2019-09-10 08:22:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35760 states. [2019-09-10 08:22:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35760 states to 35760 states and 44254 transitions. [2019-09-10 08:22:19,697 INFO L78 Accepts]: Start accepts. Automaton has 35760 states and 44254 transitions. Word has length 197 [2019-09-10 08:22:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:19,698 INFO L475 AbstractCegarLoop]: Abstraction has 35760 states and 44254 transitions. [2019-09-10 08:22:19,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:22:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 35760 states and 44254 transitions. [2019-09-10 08:22:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 08:22:19,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:19,705 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] [2019-09-10 08:22:19,705 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:19,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:19,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1704602971, now seen corresponding path program 1 times [2019-09-10 08:22:19,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:19,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:19,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:19,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:19,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:19,764 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 08:22:19,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:19,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:22:19,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:19,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:22:19,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:22:19,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:22:19,766 INFO L87 Difference]: Start difference. First operand 35760 states and 44254 transitions. Second operand 3 states. [2019-09-10 08:22:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:19,941 INFO L93 Difference]: Finished difference Result 32516 states and 40168 transitions. [2019-09-10 08:22:19,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:22:19,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-09-10 08:22:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:19,965 INFO L225 Difference]: With dead ends: 32516 [2019-09-10 08:22:19,965 INFO L226 Difference]: Without dead ends: 32516 [2019-09-10 08:22:19,965 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 08:22:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32516 states. [2019-09-10 08:22:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32516 to 32516. [2019-09-10 08:22:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32516 states. [2019-09-10 08:22:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32516 states to 32516 states and 40168 transitions. [2019-09-10 08:22:20,275 INFO L78 Accepts]: Start accepts. Automaton has 32516 states and 40168 transitions. Word has length 197 [2019-09-10 08:22:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:20,275 INFO L475 AbstractCegarLoop]: Abstraction has 32516 states and 40168 transitions. [2019-09-10 08:22:20,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:22:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 32516 states and 40168 transitions. [2019-09-10 08:22:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 08:22:20,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:20,281 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] [2019-09-10 08:22:20,282 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:20,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1969910264, now seen corresponding path program 1 times [2019-09-10 08:22:20,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:20,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:20,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:20,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:20,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:20,319 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 08:22:20,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:20,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:22:20,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:20,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:22:20,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:22:20,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:22:20,321 INFO L87 Difference]: Start difference. First operand 32516 states and 40168 transitions. Second operand 3 states. [2019-09-10 08:22:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:20,499 INFO L93 Difference]: Finished difference Result 30988 states and 38290 transitions. [2019-09-10 08:22:20,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:22:20,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-09-10 08:22:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:20,522 INFO L225 Difference]: With dead ends: 30988 [2019-09-10 08:22:20,522 INFO L226 Difference]: Without dead ends: 30988 [2019-09-10 08:22:20,522 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 08:22:20,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30988 states. [2019-09-10 08:22:20,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30988 to 30988. [2019-09-10 08:22:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30988 states. [2019-09-10 08:22:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30988 states to 30988 states and 38290 transitions. [2019-09-10 08:22:20,781 INFO L78 Accepts]: Start accepts. Automaton has 30988 states and 38290 transitions. Word has length 197 [2019-09-10 08:22:20,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:20,781 INFO L475 AbstractCegarLoop]: Abstraction has 30988 states and 38290 transitions. [2019-09-10 08:22:20,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:22:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 30988 states and 38290 transitions. [2019-09-10 08:22:20,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:22:20,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:20,786 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:20,786 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:20,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:20,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1882381690, now seen corresponding path program 1 times [2019-09-10 08:22:20,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:20,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:20,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:20,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:20,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:20,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:20,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:20,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:20,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:20,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:20,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:20,879 INFO L87 Difference]: Start difference. First operand 30988 states and 38290 transitions. Second operand 5 states. [2019-09-10 08:22:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:21,029 INFO L93 Difference]: Finished difference Result 54358 states and 67263 transitions. [2019-09-10 08:22:21,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:22:21,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 198 [2019-09-10 08:22:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:21,072 INFO L225 Difference]: With dead ends: 54358 [2019-09-10 08:22:21,072 INFO L226 Difference]: Without dead ends: 54358 [2019-09-10 08:22:21,072 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 08:22:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54358 states. [2019-09-10 08:22:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54358 to 40696. [2019-09-10 08:22:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40696 states. [2019-09-10 08:22:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40696 states to 40696 states and 50350 transitions. [2019-09-10 08:22:21,474 INFO L78 Accepts]: Start accepts. Automaton has 40696 states and 50350 transitions. Word has length 198 [2019-09-10 08:22:21,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:21,475 INFO L475 AbstractCegarLoop]: Abstraction has 40696 states and 50350 transitions. [2019-09-10 08:22:21,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:21,475 INFO L276 IsEmpty]: Start isEmpty. Operand 40696 states and 50350 transitions. [2019-09-10 08:22:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:22:21,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:21,480 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:21,480 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:21,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:21,480 INFO L82 PathProgramCache]: Analyzing trace with hash 458113498, now seen corresponding path program 1 times [2019-09-10 08:22:21,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:21,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:21,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:21,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:21,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:21,623 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 08:22:21,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:21,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:22:21,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:21,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:22:21,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:22:21,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:22:21,625 INFO L87 Difference]: Start difference. First operand 40696 states and 50350 transitions. Second operand 8 states. [2019-09-10 08:22:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:21,994 INFO L93 Difference]: Finished difference Result 62032 states and 76857 transitions. [2019-09-10 08:22:21,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:22:21,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2019-09-10 08:22:21,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:22,046 INFO L225 Difference]: With dead ends: 62032 [2019-09-10 08:22:22,046 INFO L226 Difference]: Without dead ends: 62011 [2019-09-10 08:22:22,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:22:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62011 states. [2019-09-10 08:22:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62011 to 61995. [2019-09-10 08:22:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61995 states. [2019-09-10 08:22:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61995 states to 61995 states and 76814 transitions. [2019-09-10 08:22:22,713 INFO L78 Accepts]: Start accepts. Automaton has 61995 states and 76814 transitions. Word has length 198 [2019-09-10 08:22:22,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:22,713 INFO L475 AbstractCegarLoop]: Abstraction has 61995 states and 76814 transitions. [2019-09-10 08:22:22,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:22:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 61995 states and 76814 transitions. [2019-09-10 08:22:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:22:22,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:22,720 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] [2019-09-10 08:22:22,720 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:22,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:22,720 INFO L82 PathProgramCache]: Analyzing trace with hash -778892009, now seen corresponding path program 1 times [2019-09-10 08:22:22,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:22,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:22,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:22,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:22,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:22,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:22,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:22:22,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:22,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:22:22,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:22:22,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:22:22,880 INFO L87 Difference]: Start difference. First operand 61995 states and 76814 transitions. Second operand 8 states. [2019-09-10 08:22:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:23,215 INFO L93 Difference]: Finished difference Result 82433 states and 102286 transitions. [2019-09-10 08:22:23,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:22:23,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2019-09-10 08:22:23,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:23,282 INFO L225 Difference]: With dead ends: 82433 [2019-09-10 08:22:23,282 INFO L226 Difference]: Without dead ends: 82385 [2019-09-10 08:22:23,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:22:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82385 states. [2019-09-10 08:22:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82385 to 82064. [2019-09-10 08:22:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82064 states. [2019-09-10 08:22:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82064 states to 82064 states and 101823 transitions. [2019-09-10 08:22:23,962 INFO L78 Accepts]: Start accepts. Automaton has 82064 states and 101823 transitions. Word has length 198 [2019-09-10 08:22:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:23,963 INFO L475 AbstractCegarLoop]: Abstraction has 82064 states and 101823 transitions. [2019-09-10 08:22:23,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:22:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 82064 states and 101823 transitions. [2019-09-10 08:22:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:22:23,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:23,971 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] [2019-09-10 08:22:23,971 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:23,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash -370754185, now seen corresponding path program 1 times [2019-09-10 08:22:23,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:23,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:23,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:23,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:23,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:24,132 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 08:22:24,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:24,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:22:24,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:24,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:22:24,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:22:24,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:22:24,133 INFO L87 Difference]: Start difference. First operand 82064 states and 101823 transitions. Second operand 10 states. [2019-09-10 08:22:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:24,795 INFO L93 Difference]: Finished difference Result 126102 states and 156236 transitions. [2019-09-10 08:22:24,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:22:24,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 198 [2019-09-10 08:22:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:24,903 INFO L225 Difference]: With dead ends: 126102 [2019-09-10 08:22:24,904 INFO L226 Difference]: Without dead ends: 126102 [2019-09-10 08:22:24,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:22:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126102 states. [2019-09-10 08:22:25,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126102 to 60441. [2019-09-10 08:22:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60441 states. [2019-09-10 08:22:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60441 states to 60441 states and 74995 transitions. [2019-09-10 08:22:25,962 INFO L78 Accepts]: Start accepts. Automaton has 60441 states and 74995 transitions. Word has length 198 [2019-09-10 08:22:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:25,962 INFO L475 AbstractCegarLoop]: Abstraction has 60441 states and 74995 transitions. [2019-09-10 08:22:25,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:22:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 60441 states and 74995 transitions. [2019-09-10 08:22:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:22:25,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:25,968 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] [2019-09-10 08:22:25,968 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash 784703306, now seen corresponding path program 1 times [2019-09-10 08:22:25,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:25,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:25,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:25,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:25,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:26,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 08:22:26,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:26,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:22:26,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:26,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:22:26,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:22:26,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:22:26,138 INFO L87 Difference]: Start difference. First operand 60441 states and 74995 transitions. Second operand 8 states. [2019-09-10 08:22:26,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:26,532 INFO L93 Difference]: Finished difference Result 105919 states and 131344 transitions. [2019-09-10 08:22:26,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:22:26,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2019-09-10 08:22:26,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:26,622 INFO L225 Difference]: With dead ends: 105919 [2019-09-10 08:22:26,623 INFO L226 Difference]: Without dead ends: 105875 [2019-09-10 08:22:26,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:22:26,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105875 states. [2019-09-10 08:22:27,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105875 to 105860. [2019-09-10 08:22:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105860 states. [2019-09-10 08:22:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105860 states to 105860 states and 131281 transitions. [2019-09-10 08:22:27,450 INFO L78 Accepts]: Start accepts. Automaton has 105860 states and 131281 transitions. Word has length 198 [2019-09-10 08:22:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:27,450 INFO L475 AbstractCegarLoop]: Abstraction has 105860 states and 131281 transitions. [2019-09-10 08:22:27,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:22:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 105860 states and 131281 transitions. [2019-09-10 08:22:27,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:22:27,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:27,460 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] [2019-09-10 08:22:27,460 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:27,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:27,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2120969976, now seen corresponding path program 1 times [2019-09-10 08:22:27,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:27,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:27,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:27,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:27,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:27,885 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 08:22:27,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:27,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:22:27,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:27,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:22:27,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:22:27,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:22:27,886 INFO L87 Difference]: Start difference. First operand 105860 states and 131281 transitions. Second operand 18 states. [2019-09-10 08:22:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:30,836 INFO L93 Difference]: Finished difference Result 537897 states and 663311 transitions. [2019-09-10 08:22:30,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:22:30,836 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 198 [2019-09-10 08:22:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:31,421 INFO L225 Difference]: With dead ends: 537897 [2019-09-10 08:22:31,421 INFO L226 Difference]: Without dead ends: 537897 [2019-09-10 08:22:31,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:22:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537897 states. [2019-09-10 08:22:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537897 to 110114. [2019-09-10 08:22:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110114 states. [2019-09-10 08:22:34,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110114 states to 110114 states and 136437 transitions. [2019-09-10 08:22:34,954 INFO L78 Accepts]: Start accepts. Automaton has 110114 states and 136437 transitions. Word has length 198 [2019-09-10 08:22:34,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:34,954 INFO L475 AbstractCegarLoop]: Abstraction has 110114 states and 136437 transitions. [2019-09-10 08:22:34,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:22:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 110114 states and 136437 transitions. [2019-09-10 08:22:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:22:34,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:34,966 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] [2019-09-10 08:22:34,966 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:34,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:34,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2071520162, now seen corresponding path program 1 times [2019-09-10 08:22:34,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:34,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:34,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:34,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:34,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:35,518 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 08:22:35,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:35,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:22:35,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:35,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:22:35,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:22:35,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:22:35,519 INFO L87 Difference]: Start difference. First operand 110114 states and 136437 transitions. Second operand 19 states. [2019-09-10 08:22:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:44,302 INFO L93 Difference]: Finished difference Result 792810 states and 992004 transitions. [2019-09-10 08:22:44,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:22:44,303 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 198 [2019-09-10 08:22:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:45,196 INFO L225 Difference]: With dead ends: 792810 [2019-09-10 08:22:45,196 INFO L226 Difference]: Without dead ends: 792810 [2019-09-10 08:22:45,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:22:45,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792810 states. [2019-09-10 08:22:50,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792810 to 110365. [2019-09-10 08:22:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110365 states. [2019-09-10 08:22:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110365 states to 110365 states and 136697 transitions. [2019-09-10 08:22:50,253 INFO L78 Accepts]: Start accepts. Automaton has 110365 states and 136697 transitions. Word has length 198 [2019-09-10 08:22:50,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:50,253 INFO L475 AbstractCegarLoop]: Abstraction has 110365 states and 136697 transitions. [2019-09-10 08:22:50,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:22:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 110365 states and 136697 transitions. [2019-09-10 08:22:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:22:50,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:50,266 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] [2019-09-10 08:22:50,266 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:50,267 INFO L82 PathProgramCache]: Analyzing trace with hash 161854440, now seen corresponding path program 1 times [2019-09-10 08:22:50,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:50,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:50,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:50,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:50,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:50,816 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 08:22:50,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:50,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:22:50,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:50,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:22:50,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:22:50,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:22:50,818 INFO L87 Difference]: Start difference. First operand 110365 states and 136697 transitions. Second operand 18 states. [2019-09-10 08:22:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:53,210 INFO L93 Difference]: Finished difference Result 373006 states and 462699 transitions. [2019-09-10 08:22:53,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:22:53,210 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 198 [2019-09-10 08:22:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:53,565 INFO L225 Difference]: With dead ends: 373006 [2019-09-10 08:22:53,565 INFO L226 Difference]: Without dead ends: 373006 [2019-09-10 08:22:53,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:22:53,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373006 states. [2019-09-10 08:22:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373006 to 112076. [2019-09-10 08:22:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112076 states. [2019-09-10 08:22:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112076 states to 112076 states and 138503 transitions. [2019-09-10 08:22:56,404 INFO L78 Accepts]: Start accepts. Automaton has 112076 states and 138503 transitions. Word has length 198 [2019-09-10 08:22:56,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:56,404 INFO L475 AbstractCegarLoop]: Abstraction has 112076 states and 138503 transitions. [2019-09-10 08:22:56,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:22:56,404 INFO L276 IsEmpty]: Start isEmpty. Operand 112076 states and 138503 transitions. [2019-09-10 08:22:56,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:22:56,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:56,417 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] [2019-09-10 08:22:56,417 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:56,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:56,418 INFO L82 PathProgramCache]: Analyzing trace with hash 950726852, now seen corresponding path program 1 times [2019-09-10 08:22:56,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:56,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:56,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:56,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:56,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:56,600 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 08:22:56,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:56,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:22:56,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:56,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:22:56,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:22:56,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:22:56,601 INFO L87 Difference]: Start difference. First operand 112076 states and 138503 transitions. Second operand 8 states. [2019-09-10 08:22:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:57,421 INFO L93 Difference]: Finished difference Result 111900 states and 138326 transitions. [2019-09-10 08:22:57,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:22:57,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2019-09-10 08:22:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:57,512 INFO L225 Difference]: With dead ends: 111900 [2019-09-10 08:22:57,512 INFO L226 Difference]: Without dead ends: 111854 [2019-09-10 08:22:57,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:22:57,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111854 states. [2019-09-10 08:22:58,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111854 to 111844. [2019-09-10 08:22:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111844 states. [2019-09-10 08:22:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111844 states to 111844 states and 138271 transitions. [2019-09-10 08:22:58,363 INFO L78 Accepts]: Start accepts. Automaton has 111844 states and 138271 transitions. Word has length 198 [2019-09-10 08:22:58,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:58,363 INFO L475 AbstractCegarLoop]: Abstraction has 111844 states and 138271 transitions. [2019-09-10 08:22:58,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:22:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand 111844 states and 138271 transitions. [2019-09-10 08:22:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:22:58,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:58,377 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] [2019-09-10 08:22:58,377 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:58,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:58,377 INFO L82 PathProgramCache]: Analyzing trace with hash -668248062, now seen corresponding path program 1 times [2019-09-10 08:22:58,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:58,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:58,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:58,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:58,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:58,817 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 08:22:58,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:58,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:22:58,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:58,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:22:58,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:22:58,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:22:58,819 INFO L87 Difference]: Start difference. First operand 111844 states and 138271 transitions. Second operand 16 states. [2019-09-10 08:23:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:01,639 INFO L93 Difference]: Finished difference Result 621254 states and 750212 transitions. [2019-09-10 08:23:01,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:23:01,639 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 198 [2019-09-10 08:23:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:02,284 INFO L225 Difference]: With dead ends: 621254 [2019-09-10 08:23:02,284 INFO L226 Difference]: Without dead ends: 621254 [2019-09-10 08:23:02,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:23:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621254 states. [2019-09-10 08:23:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621254 to 111033. [2019-09-10 08:23:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111033 states. [2019-09-10 08:23:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111033 states to 111033 states and 137236 transitions. [2019-09-10 08:23:07,576 INFO L78 Accepts]: Start accepts. Automaton has 111033 states and 137236 transitions. Word has length 198 [2019-09-10 08:23:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:07,576 INFO L475 AbstractCegarLoop]: Abstraction has 111033 states and 137236 transitions. [2019-09-10 08:23:07,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:23:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 111033 states and 137236 transitions. [2019-09-10 08:23:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:23:07,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:07,589 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] [2019-09-10 08:23:07,589 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:07,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:07,589 INFO L82 PathProgramCache]: Analyzing trace with hash 203874760, now seen corresponding path program 1 times [2019-09-10 08:23:07,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:07,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:07,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:07,976 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 08:23:07,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:07,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:23:07,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:07,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:23:07,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:23:07,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:23:07,977 INFO L87 Difference]: Start difference. First operand 111033 states and 137236 transitions. Second operand 18 states. [2019-09-10 08:23:11,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:11,387 INFO L93 Difference]: Finished difference Result 536851 states and 665035 transitions. [2019-09-10 08:23:11,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:23:11,388 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 198 [2019-09-10 08:23:11,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:11,921 INFO L225 Difference]: With dead ends: 536851 [2019-09-10 08:23:11,922 INFO L226 Difference]: Without dead ends: 536851 [2019-09-10 08:23:11,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:23:12,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536851 states. [2019-09-10 08:23:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536851 to 111454. [2019-09-10 08:23:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111454 states. [2019-09-10 08:23:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111454 states to 111454 states and 137677 transitions. [2019-09-10 08:23:16,484 INFO L78 Accepts]: Start accepts. Automaton has 111454 states and 137677 transitions. Word has length 198 [2019-09-10 08:23:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:16,484 INFO L475 AbstractCegarLoop]: Abstraction has 111454 states and 137677 transitions. [2019-09-10 08:23:16,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:23:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 111454 states and 137677 transitions. [2019-09-10 08:23:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:23:16,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:16,497 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] [2019-09-10 08:23:16,497 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:16,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:16,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2088094811, now seen corresponding path program 1 times [2019-09-10 08:23:16,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:16,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:16,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:16,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:16,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:17,498 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 08:23:17,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:17,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:23:17,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:17,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:23:17,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:23:17,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:23:17,499 INFO L87 Difference]: Start difference. First operand 111454 states and 137677 transitions. Second operand 18 states. [2019-09-10 08:23:18,071 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 08:23:18,246 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:23:18,429 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:23:18,603 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:23:18,834 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 08:23:19,086 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:23:19,235 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 08:23:19,536 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 08:23:19,811 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 08:23:20,104 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 08:23:20,430 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 08:23:20,752 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 08:23:21,079 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 08:23:21,360 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 08:23:21,648 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 08:23:22,227 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 08:23:22,497 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 08:23:22,772 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 08:23:23,158 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 08:23:23,386 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 08:23:23,649 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 08:23:23,924 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 08:23:24,303 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 08:23:25,031 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 08:23:25,283 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 08:23:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:26,080 INFO L93 Difference]: Finished difference Result 416312 states and 514545 transitions. [2019-09-10 08:23:26,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 08:23:26,080 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 198 [2019-09-10 08:23:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:26,524 INFO L225 Difference]: With dead ends: 416312 [2019-09-10 08:23:26,524 INFO L226 Difference]: Without dead ends: 416312 [2019-09-10 08:23:26,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=579, Invalid=1677, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 08:23:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416312 states. [2019-09-10 08:23:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416312 to 113752. [2019-09-10 08:23:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113752 states. [2019-09-10 08:23:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113752 states to 113752 states and 140169 transitions. [2019-09-10 08:23:29,937 INFO L78 Accepts]: Start accepts. Automaton has 113752 states and 140169 transitions. Word has length 198 [2019-09-10 08:23:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:29,937 INFO L475 AbstractCegarLoop]: Abstraction has 113752 states and 140169 transitions. [2019-09-10 08:23:29,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:23:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 113752 states and 140169 transitions. [2019-09-10 08:23:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:23:29,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:29,952 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] [2019-09-10 08:23:29,952 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:29,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1727298090, now seen corresponding path program 1 times [2019-09-10 08:23:29,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:29,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:29,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:29,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:29,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:30,092 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 08:23:30,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:30,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:23:30,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:30,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:23:30,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:23:30,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:23:30,095 INFO L87 Difference]: Start difference. First operand 113752 states and 140169 transitions. Second operand 5 states. [2019-09-10 08:23:30,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:30,713 INFO L93 Difference]: Finished difference Result 238622 states and 295609 transitions. [2019-09-10 08:23:30,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:23:30,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 198 [2019-09-10 08:23:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:30,980 INFO L225 Difference]: With dead ends: 238622 [2019-09-10 08:23:30,980 INFO L226 Difference]: Without dead ends: 238562 [2019-09-10 08:23:30,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:23:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238562 states. [2019-09-10 08:23:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238562 to 231272. [2019-09-10 08:23:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231272 states. [2019-09-10 08:23:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231272 states to 231272 states and 286358 transitions. [2019-09-10 08:23:35,560 INFO L78 Accepts]: Start accepts. Automaton has 231272 states and 286358 transitions. Word has length 198 [2019-09-10 08:23:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:35,560 INFO L475 AbstractCegarLoop]: Abstraction has 231272 states and 286358 transitions. [2019-09-10 08:23:35,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:23:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 231272 states and 286358 transitions. [2019-09-10 08:23:35,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:23:35,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:35,581 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] [2019-09-10 08:23:35,582 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:35,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash -151832856, now seen corresponding path program 1 times [2019-09-10 08:23:35,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:35,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:35,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:35,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:35,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:36,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:36,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 08:23:36,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:36,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 08:23:36,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 08:23:36,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:23:36,432 INFO L87 Difference]: Start difference. First operand 231272 states and 286358 transitions. Second operand 27 states. [2019-09-10 08:23:38,282 WARN L188 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 08:23:38,466 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 08:23:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:48,623 INFO L93 Difference]: Finished difference Result 968199 states and 1254170 transitions. [2019-09-10 08:23:48,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 08:23:48,623 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 198 [2019-09-10 08:23:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:49,859 INFO L225 Difference]: With dead ends: 968199 [2019-09-10 08:23:49,859 INFO L226 Difference]: Without dead ends: 968199 [2019-09-10 08:23:49,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=503, Invalid=2919, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 08:23:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968199 states. [2019-09-10 08:24:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968199 to 231353. [2019-09-10 08:24:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231353 states. [2019-09-10 08:24:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231353 states to 231353 states and 286428 transitions. [2019-09-10 08:24:00,792 INFO L78 Accepts]: Start accepts. Automaton has 231353 states and 286428 transitions. Word has length 198 [2019-09-10 08:24:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:00,792 INFO L475 AbstractCegarLoop]: Abstraction has 231353 states and 286428 transitions. [2019-09-10 08:24:00,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 08:24:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 231353 states and 286428 transitions. [2019-09-10 08:24:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:24:00,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:00,814 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] [2019-09-10 08:24:00,814 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:00,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:00,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1836066899, now seen corresponding path program 1 times [2019-09-10 08:24:00,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:00,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:00,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:00,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:00,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:00,897 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 08:24:00,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:00,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:24:00,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:00,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:24:00,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:24:00,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:24:00,898 INFO L87 Difference]: Start difference. First operand 231353 states and 286428 transitions. Second operand 5 states. [2019-09-10 08:24:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:02,681 INFO L93 Difference]: Finished difference Result 421903 states and 523762 transitions. [2019-09-10 08:24:02,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:24:02,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 198 [2019-09-10 08:24:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:03,149 INFO L225 Difference]: With dead ends: 421903 [2019-09-10 08:24:03,149 INFO L226 Difference]: Without dead ends: 421863 [2019-09-10 08:24:03,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:24:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421863 states. [2019-09-10 08:24:12,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421863 to 416609. [2019-09-10 08:24:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416609 states. [2019-09-10 08:24:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416609 states to 416609 states and 517067 transitions. [2019-09-10 08:24:13,729 INFO L78 Accepts]: Start accepts. Automaton has 416609 states and 517067 transitions. Word has length 198 [2019-09-10 08:24:13,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:13,729 INFO L475 AbstractCegarLoop]: Abstraction has 416609 states and 517067 transitions. [2019-09-10 08:24:13,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:24:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 416609 states and 517067 transitions. [2019-09-10 08:24:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:24:13,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:13,755 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] [2019-09-10 08:24:13,755 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:13,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1688166831, now seen corresponding path program 1 times [2019-09-10 08:24:13,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:13,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:13,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:13,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:13,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:14,795 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 08:24:23,211 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 08:24:23,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:23,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2019-09-10 08:24:23,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:23,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 08:24:23,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 08:24:23,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2063, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 08:24:23,213 INFO L87 Difference]: Start difference. First operand 416609 states and 517067 transitions. Second operand 47 states. [2019-09-10 08:24:24,315 WARN L188 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 200 [2019-09-10 08:24:25,360 WARN L188 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 194 [2019-09-10 08:24:27,022 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 08:24:27,988 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:24:28,268 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:24:28,678 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 08:24:29,096 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 90 [2019-09-10 08:24:29,649 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 102 [2019-09-10 08:24:30,159 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 106 [2019-09-10 08:24:30,804 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 120 [2019-09-10 08:24:31,475 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 137 [2019-09-10 08:24:32,195 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 141 [2019-09-10 08:24:32,984 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 158 [2019-09-10 08:24:33,939 WARN L188 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 172 [2019-09-10 08:24:34,945 WARN L188 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 187 [2019-09-10 08:24:35,510 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2019-09-10 08:24:35,883 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2019-09-10 08:24:36,310 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-09-10 08:24:36,667 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-09-10 08:24:37,051 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 08:24:52,887 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:24:53,744 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 08:25:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:10,195 INFO L93 Difference]: Finished difference Result 2822717 states and 3358529 transitions. [2019-09-10 08:25:10,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-10 08:25:10,196 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 198 [2019-09-10 08:25:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:13,064 INFO L225 Difference]: With dead ends: 2822717 [2019-09-10 08:25:13,064 INFO L226 Difference]: Without dead ends: 2822717 [2019-09-10 08:25:13,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=993, Invalid=7937, Unknown=0, NotChecked=0, Total=8930 [2019-09-10 08:25:27,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822717 states. [2019-09-10 08:25:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822717 to 416718. [2019-09-10 08:25:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416718 states. [2019-09-10 08:25:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416718 states to 416718 states and 517189 transitions. [2019-09-10 08:25:45,434 INFO L78 Accepts]: Start accepts. Automaton has 416718 states and 517189 transitions. Word has length 198 [2019-09-10 08:25:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:45,434 INFO L475 AbstractCegarLoop]: Abstraction has 416718 states and 517189 transitions. [2019-09-10 08:25:45,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 08:25:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 416718 states and 517189 transitions. [2019-09-10 08:25:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:25:45,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:45,462 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] [2019-09-10 08:25:45,462 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:45,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1897755277, now seen corresponding path program 1 times [2019-09-10 08:25:45,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:45,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:45,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:50,508 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 08:25:50,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:50,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:25:50,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:50,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:25:50,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:25:50,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:25:50,510 INFO L87 Difference]: Start difference. First operand 416718 states and 517189 transitions. Second operand 8 states. [2019-09-10 08:25:51,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:51,848 INFO L93 Difference]: Finished difference Result 502694 states and 624483 transitions. [2019-09-10 08:25:51,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:25:51,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2019-09-10 08:25:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:52,438 INFO L225 Difference]: With dead ends: 502694 [2019-09-10 08:25:52,438 INFO L226 Difference]: Without dead ends: 502588 [2019-09-10 08:25:52,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:25:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502588 states. [2019-09-10 08:26:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502588 to 499636. [2019-09-10 08:26:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499636 states. [2019-09-10 08:26:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499636 states to 499636 states and 620674 transitions. [2019-09-10 08:26:04,095 INFO L78 Accepts]: Start accepts. Automaton has 499636 states and 620674 transitions. Word has length 198 [2019-09-10 08:26:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:04,096 INFO L475 AbstractCegarLoop]: Abstraction has 499636 states and 620674 transitions. [2019-09-10 08:26:04,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:26:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 499636 states and 620674 transitions. [2019-09-10 08:26:04,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 08:26:04,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:04,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] [2019-09-10 08:26:04,121 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:04,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:04,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1366171121, now seen corresponding path program 1 times [2019-09-10 08:26:04,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:04,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:04,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:04,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:04,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:04,932 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 08:26:04,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:04,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:26:04,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:04,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:26:04,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:26:04,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:26:04,934 INFO L87 Difference]: Start difference. First operand 499636 states and 620674 transitions. Second operand 19 states. [2019-09-10 08:26:06,449 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-09-10 08:26:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:40,135 INFO L93 Difference]: Finished difference Result 4199333 states and 5189694 transitions. [2019-09-10 08:26:40,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:26:40,136 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 198 [2019-09-10 08:26:40,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:57,354 INFO L225 Difference]: With dead ends: 4199333 [2019-09-10 08:26:57,354 INFO L226 Difference]: Without dead ends: 4199333 [2019-09-10 08:26:57,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=247, Invalid=1559, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 08:26:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199333 states. [2019-09-10 08:27:34,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199333 to 501866. [2019-09-10 08:27:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501866 states. [2019-09-10 08:27:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501866 states to 501866 states and 623250 transitions. [2019-09-10 08:27:35,042 INFO L78 Accepts]: Start accepts. Automaton has 501866 states and 623250 transitions. Word has length 198 [2019-09-10 08:27:35,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:35,043 INFO L475 AbstractCegarLoop]: Abstraction has 501866 states and 623250 transitions. [2019-09-10 08:27:35,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:27:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 501866 states and 623250 transitions. [2019-09-10 08:27:35,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 08:27:35,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:35,068 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] [2019-09-10 08:27:35,068 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:35,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:35,069 INFO L82 PathProgramCache]: Analyzing trace with hash 694904441, now seen corresponding path program 1 times [2019-09-10 08:27:35,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:35,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:35,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:35,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:35,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:35,749 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 08:27:35,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:35,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:27:35,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:35,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:27:35,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:27:35,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:27:35,750 INFO L87 Difference]: Start difference. First operand 501866 states and 623250 transitions. Second operand 16 states. [2019-09-10 08:27:38,548 WARN L188 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-09-10 08:27:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:59,293 INFO L93 Difference]: Finished difference Result 3309737 states and 4108753 transitions. [2019-09-10 08:27:59,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 08:27:59,293 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 199 [2019-09-10 08:27:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:06,230 INFO L225 Difference]: With dead ends: 3309737 [2019-09-10 08:28:06,230 INFO L226 Difference]: Without dead ends: 3309737 [2019-09-10 08:28:06,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=300, Invalid=1106, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:28:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309737 states. [2019-09-10 08:28:48,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309737 to 503305. [2019-09-10 08:28:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503305 states. [2019-09-10 08:28:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503305 states to 503305 states and 624811 transitions. [2019-09-10 08:28:50,532 INFO L78 Accepts]: Start accepts. Automaton has 503305 states and 624811 transitions. Word has length 199 [2019-09-10 08:28:50,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:50,532 INFO L475 AbstractCegarLoop]: Abstraction has 503305 states and 624811 transitions. [2019-09-10 08:28:50,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:28:50,533 INFO L276 IsEmpty]: Start isEmpty. Operand 503305 states and 624811 transitions. [2019-09-10 08:28:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 08:28:50,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:50,559 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] [2019-09-10 08:28:50,559 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:50,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:50,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1555044810, now seen corresponding path program 1 times [2019-09-10 08:28:50,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:50,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:50,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:50,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:50,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:51,191 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 08:28:51,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:51,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:28:51,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:51,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:28:51,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:28:51,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:28:51,192 INFO L87 Difference]: Start difference. First operand 503305 states and 624811 transitions. Second operand 19 states. [2019-09-10 08:28:51,359 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 08:28:52,037 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 08:29:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:20,302 INFO L93 Difference]: Finished difference Result 3251692 states and 4109319 transitions. [2019-09-10 08:29:20,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:29:20,303 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 199 [2019-09-10 08:29:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:25,853 INFO L225 Difference]: With dead ends: 3251692 [2019-09-10 08:29:25,853 INFO L226 Difference]: Without dead ends: 3251692 [2019-09-10 08:29:25,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=237, Invalid=1485, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 08:29:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251692 states.