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_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:10:28,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:10:28,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:10:28,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:10:28,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:10:28,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:10:28,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:10:28,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:10:28,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:10:28,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:10:28,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:10:28,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:10:28,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:10:28,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:10:28,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:10:28,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:10:28,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:10:28,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:10:28,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:10:28,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:10:28,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:10:28,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:10:28,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:10:28,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:10:28,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:10:28,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:10:28,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:10:28,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:10:28,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:10:28,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:10:28,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:10:28,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:10:28,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:10:28,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:10:28,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:10:28,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:10:28,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:10:28,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:10:28,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:10:28,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:10:28,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:10:28,620 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 06:10:28,648 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:10:28,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:10:28,649 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:10:28,650 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:10:28,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:10:28,651 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:10:28,651 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:10:28,651 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:10:28,651 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:10:28,651 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:10:28,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:10:28,654 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:10:28,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:10:28,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:10:28,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:10:28,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:10:28,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:10:28,655 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:10:28,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:10:28,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:10:28,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:10:28,656 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:10:28,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:10:28,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:10:28,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:10:28,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:10:28,657 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:10:28,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:10:28,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:10:28,658 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:10:28,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:10:28,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:10:28,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:10:28,725 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:10:28,726 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:10:28,727 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 06:10:28,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a830a7fb/1323474e90694f0e8c330b7ade9db9b1/FLAG1abd450f0 [2019-09-10 06:10:29,313 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:10:29,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 06:10:29,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a830a7fb/1323474e90694f0e8c330b7ade9db9b1/FLAG1abd450f0 [2019-09-10 06:10:29,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a830a7fb/1323474e90694f0e8c330b7ade9db9b1 [2019-09-10 06:10:29,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:10:29,623 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:10:29,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:10:29,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:10:29,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:10:29,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:10:29" (1/1) ... [2019-09-10 06:10:29,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b60ac12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:29, skipping insertion in model container [2019-09-10 06:10:29,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:10:29" (1/1) ... [2019-09-10 06:10:29,641 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:10:29,715 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:10:30,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:10:30,312 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:10:30,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:10:30,763 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:10:30,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:30 WrapperNode [2019-09-10 06:10:30,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:10:30,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:10:30,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:10:30,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:10:30,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:30" (1/1) ... [2019-09-10 06:10:30,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:30" (1/1) ... [2019-09-10 06:10:30,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:30" (1/1) ... [2019-09-10 06:10:30,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:30" (1/1) ... [2019-09-10 06:10:30,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:30" (1/1) ... [2019-09-10 06:10:30,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:30" (1/1) ... [2019-09-10 06:10:30,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:30" (1/1) ... [2019-09-10 06:10:30,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:10:30,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:10:30,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:10:30,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:10:30,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:30" (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 06:10:30,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:10:30,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:10:30,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:10:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:10:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:10:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:10:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:10:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:10:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:10:30,957 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:10:30,957 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:10:30,957 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:10:30,957 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:10:30,957 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:10:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:10:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:10:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:10:30,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:10:32,480 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:10:32,481 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:10:32,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:10:32 BoogieIcfgContainer [2019-09-10 06:10:32,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:10:32,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:10:32,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:10:32,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:10:32,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:10:29" (1/3) ... [2019-09-10 06:10:32,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479bcc15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:10:32, skipping insertion in model container [2019-09-10 06:10:32,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:30" (2/3) ... [2019-09-10 06:10:32,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479bcc15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:10:32, skipping insertion in model container [2019-09-10 06:10:32,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:10:32" (3/3) ... [2019-09-10 06:10:32,492 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 06:10:32,503 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:10:32,513 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:10:32,531 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:10:32,560 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:10:32,561 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:10:32,561 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:10:32,561 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:10:32,561 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:10:32,561 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:10:32,561 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:10:32,562 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:10:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states. [2019-09-10 06:10:32,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 06:10:32,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:32,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:32,610 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:32,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1850165601, now seen corresponding path program 1 times [2019-09-10 06:10:32,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:32,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:32,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:32,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:32,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:33,271 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 06:10:33,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:33,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:33,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:33,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:33,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:33,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:33,299 INFO L87 Difference]: Start difference. First operand 310 states. Second operand 3 states. [2019-09-10 06:10:33,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:33,518 INFO L93 Difference]: Finished difference Result 501 states and 877 transitions. [2019-09-10 06:10:33,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:33,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-09-10 06:10:33,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:33,539 INFO L225 Difference]: With dead ends: 501 [2019-09-10 06:10:33,539 INFO L226 Difference]: Without dead ends: 493 [2019-09-10 06:10:33,541 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 06:10:33,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-10 06:10:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2019-09-10 06:10:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-09-10 06:10:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 730 transitions. [2019-09-10 06:10:33,651 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 730 transitions. Word has length 148 [2019-09-10 06:10:33,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:33,652 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 730 transitions. [2019-09-10 06:10:33,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 730 transitions. [2019-09-10 06:10:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 06:10:33,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:33,657 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:33,657 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:33,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash -835560269, now seen corresponding path program 1 times [2019-09-10 06:10:33,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:33,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:33,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:33,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:33,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:34,069 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 06:10:34,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:34,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:34,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:34,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:34,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:34,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:34,074 INFO L87 Difference]: Start difference. First operand 491 states and 730 transitions. Second operand 4 states. [2019-09-10 06:10:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:34,198 INFO L93 Difference]: Finished difference Result 945 states and 1390 transitions. [2019-09-10 06:10:34,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:34,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-09-10 06:10:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:34,205 INFO L225 Difference]: With dead ends: 945 [2019-09-10 06:10:34,205 INFO L226 Difference]: Without dead ends: 945 [2019-09-10 06:10:34,206 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 06:10:34,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-09-10 06:10:34,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 943. [2019-09-10 06:10:34,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-09-10 06:10:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1389 transitions. [2019-09-10 06:10:34,239 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1389 transitions. Word has length 148 [2019-09-10 06:10:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:34,240 INFO L475 AbstractCegarLoop]: Abstraction has 943 states and 1389 transitions. [2019-09-10 06:10:34,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1389 transitions. [2019-09-10 06:10:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 06:10:34,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:34,246 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:34,246 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:34,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:34,247 INFO L82 PathProgramCache]: Analyzing trace with hash -312485947, now seen corresponding path program 1 times [2019-09-10 06:10:34,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:34,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:34,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:34,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:34,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:34,351 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 06:10:34,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:34,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:34,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:34,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:34,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:34,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:34,356 INFO L87 Difference]: Start difference. First operand 943 states and 1389 transitions. Second operand 3 states. [2019-09-10 06:10:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:34,387 INFO L93 Difference]: Finished difference Result 1872 states and 2757 transitions. [2019-09-10 06:10:34,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:34,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-10 06:10:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:34,402 INFO L225 Difference]: With dead ends: 1872 [2019-09-10 06:10:34,410 INFO L226 Difference]: Without dead ends: 1872 [2019-09-10 06:10:34,411 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 06:10:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-09-10 06:10:34,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 945. [2019-09-10 06:10:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-09-10 06:10:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1391 transitions. [2019-09-10 06:10:34,453 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1391 transitions. Word has length 149 [2019-09-10 06:10:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:34,454 INFO L475 AbstractCegarLoop]: Abstraction has 945 states and 1391 transitions. [2019-09-10 06:10:34,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1391 transitions. [2019-09-10 06:10:34,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 06:10:34,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:34,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:34,461 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:34,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:34,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1358823732, now seen corresponding path program 1 times [2019-09-10 06:10:34,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:34,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:34,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:34,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:34,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:34,678 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 06:10:34,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:34,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:34,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:34,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:34,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:34,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:34,680 INFO L87 Difference]: Start difference. First operand 945 states and 1391 transitions. Second operand 4 states. [2019-09-10 06:10:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:34,715 INFO L93 Difference]: Finished difference Result 1001 states and 1468 transitions. [2019-09-10 06:10:34,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:34,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-10 06:10:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:34,721 INFO L225 Difference]: With dead ends: 1001 [2019-09-10 06:10:34,721 INFO L226 Difference]: Without dead ends: 945 [2019-09-10 06:10:34,722 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 06:10:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-09-10 06:10:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 944. [2019-09-10 06:10:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-09-10 06:10:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1388 transitions. [2019-09-10 06:10:34,748 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1388 transitions. Word has length 150 [2019-09-10 06:10:34,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:34,748 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1388 transitions. [2019-09-10 06:10:34,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1388 transitions. [2019-09-10 06:10:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 06:10:34,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:34,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:34,752 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:34,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:34,753 INFO L82 PathProgramCache]: Analyzing trace with hash -192101545, now seen corresponding path program 1 times [2019-09-10 06:10:34,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:34,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:34,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:34,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:34,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 06:10:34,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:34,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:34,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:34,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:34,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:34,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:34,960 INFO L87 Difference]: Start difference. First operand 944 states and 1388 transitions. Second operand 4 states. [2019-09-10 06:10:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:35,005 INFO L93 Difference]: Finished difference Result 1002 states and 1468 transitions. [2019-09-10 06:10:35,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:35,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-10 06:10:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:35,012 INFO L225 Difference]: With dead ends: 1002 [2019-09-10 06:10:35,013 INFO L226 Difference]: Without dead ends: 942 [2019-09-10 06:10:35,013 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 06:10:35,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-10 06:10:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 942. [2019-09-10 06:10:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-09-10 06:10:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1384 transitions. [2019-09-10 06:10:35,039 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1384 transitions. Word has length 150 [2019-09-10 06:10:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:35,039 INFO L475 AbstractCegarLoop]: Abstraction has 942 states and 1384 transitions. [2019-09-10 06:10:35,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1384 transitions. [2019-09-10 06:10:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 06:10:35,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:35,042 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:35,042 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:35,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1528940934, now seen corresponding path program 1 times [2019-09-10 06:10:35,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:35,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:35,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:35,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:35,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:35,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:35,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:35,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:35,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:35,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:35,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:35,155 INFO L87 Difference]: Start difference. First operand 942 states and 1384 transitions. Second operand 3 states. [2019-09-10 06:10:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:35,212 INFO L93 Difference]: Finished difference Result 1396 states and 2023 transitions. [2019-09-10 06:10:35,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:35,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 06:10:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:35,222 INFO L225 Difference]: With dead ends: 1396 [2019-09-10 06:10:35,222 INFO L226 Difference]: Without dead ends: 1396 [2019-09-10 06:10:35,223 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 06:10:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-09-10 06:10:35,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1394. [2019-09-10 06:10:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2019-09-10 06:10:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2022 transitions. [2019-09-10 06:10:35,264 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2022 transitions. Word has length 150 [2019-09-10 06:10:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:35,267 INFO L475 AbstractCegarLoop]: Abstraction has 1394 states and 2022 transitions. [2019-09-10 06:10:35,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2022 transitions. [2019-09-10 06:10:35,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 06:10:35,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:35,275 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:35,275 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:35,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:35,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2049235060, now seen corresponding path program 1 times [2019-09-10 06:10:35,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:35,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:35,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:35,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:35,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:35,410 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 06:10:35,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:35,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:35,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:35,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:35,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:35,413 INFO L87 Difference]: Start difference. First operand 1394 states and 2022 transitions. Second operand 3 states. [2019-09-10 06:10:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:35,895 INFO L93 Difference]: Finished difference Result 2595 states and 3762 transitions. [2019-09-10 06:10:35,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:35,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-10 06:10:35,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:35,916 INFO L225 Difference]: With dead ends: 2595 [2019-09-10 06:10:35,916 INFO L226 Difference]: Without dead ends: 2595 [2019-09-10 06:10:35,917 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 06:10:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2019-09-10 06:10:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2593. [2019-09-10 06:10:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2593 states. [2019-09-10 06:10:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3761 transitions. [2019-09-10 06:10:35,999 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3761 transitions. Word has length 156 [2019-09-10 06:10:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:35,999 INFO L475 AbstractCegarLoop]: Abstraction has 2593 states and 3761 transitions. [2019-09-10 06:10:36,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3761 transitions. [2019-09-10 06:10:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 06:10:36,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:36,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:36,008 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:36,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:36,010 INFO L82 PathProgramCache]: Analyzing trace with hash 327258095, now seen corresponding path program 1 times [2019-09-10 06:10:36,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:36,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:36,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:36,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:36,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:36,688 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 06:10:36,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:36,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:10:36,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:36,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:10:36,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:10:36,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:10:36,691 INFO L87 Difference]: Start difference. First operand 2593 states and 3761 transitions. Second operand 17 states. [2019-09-10 06:10:39,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:39,067 INFO L93 Difference]: Finished difference Result 6957 states and 10256 transitions. [2019-09-10 06:10:39,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:10:39,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 156 [2019-09-10 06:10:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:39,099 INFO L225 Difference]: With dead ends: 6957 [2019-09-10 06:10:39,099 INFO L226 Difference]: Without dead ends: 6957 [2019-09-10 06:10:39,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=315, Invalid=945, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:10:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2019-09-10 06:10:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 5028. [2019-09-10 06:10:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5028 states. [2019-09-10 06:10:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5028 states to 5028 states and 7307 transitions. [2019-09-10 06:10:39,238 INFO L78 Accepts]: Start accepts. Automaton has 5028 states and 7307 transitions. Word has length 156 [2019-09-10 06:10:39,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:39,239 INFO L475 AbstractCegarLoop]: Abstraction has 5028 states and 7307 transitions. [2019-09-10 06:10:39,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:10:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 5028 states and 7307 transitions. [2019-09-10 06:10:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 06:10:39,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:39,247 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:39,248 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:39,248 INFO L82 PathProgramCache]: Analyzing trace with hash -681147618, now seen corresponding path program 1 times [2019-09-10 06:10:39,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:39,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:39,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:39,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:39,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:39,443 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 06:10:39,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:39,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:39,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:39,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:39,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:39,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:39,445 INFO L87 Difference]: Start difference. First operand 5028 states and 7307 transitions. Second operand 4 states. [2019-09-10 06:10:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:39,550 INFO L93 Difference]: Finished difference Result 8209 states and 11776 transitions. [2019-09-10 06:10:39,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:39,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-10 06:10:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:39,588 INFO L225 Difference]: With dead ends: 8209 [2019-09-10 06:10:39,588 INFO L226 Difference]: Without dead ends: 8209 [2019-09-10 06:10:39,589 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 06:10:39,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8209 states. [2019-09-10 06:10:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8209 to 8207. [2019-09-10 06:10:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8207 states. [2019-09-10 06:10:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8207 states to 8207 states and 11775 transitions. [2019-09-10 06:10:39,869 INFO L78 Accepts]: Start accepts. Automaton has 8207 states and 11775 transitions. Word has length 156 [2019-09-10 06:10:39,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:39,869 INFO L475 AbstractCegarLoop]: Abstraction has 8207 states and 11775 transitions. [2019-09-10 06:10:39,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 8207 states and 11775 transitions. [2019-09-10 06:10:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 06:10:39,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:39,882 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] [2019-09-10 06:10:39,882 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:39,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:39,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1122789079, now seen corresponding path program 1 times [2019-09-10 06:10:39,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:39,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:39,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:39,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:39,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:39,978 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 06:10:39,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:39,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:39,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:39,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:39,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:39,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:39,979 INFO L87 Difference]: Start difference. First operand 8207 states and 11775 transitions. Second operand 3 states. [2019-09-10 06:10:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:40,060 INFO L93 Difference]: Finished difference Result 12729 states and 17987 transitions. [2019-09-10 06:10:40,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:40,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-10 06:10:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:40,092 INFO L225 Difference]: With dead ends: 12729 [2019-09-10 06:10:40,093 INFO L226 Difference]: Without dead ends: 12729 [2019-09-10 06:10:40,093 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 06:10:40,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12729 states. [2019-09-10 06:10:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12729 to 12727. [2019-09-10 06:10:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12727 states. [2019-09-10 06:10:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12727 states to 12727 states and 17986 transitions. [2019-09-10 06:10:40,300 INFO L78 Accepts]: Start accepts. Automaton has 12727 states and 17986 transitions. Word has length 158 [2019-09-10 06:10:40,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:40,301 INFO L475 AbstractCegarLoop]: Abstraction has 12727 states and 17986 transitions. [2019-09-10 06:10:40,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:40,301 INFO L276 IsEmpty]: Start isEmpty. Operand 12727 states and 17986 transitions. [2019-09-10 06:10:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 06:10:40,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:40,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] [2019-09-10 06:10:40,324 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:40,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:40,325 INFO L82 PathProgramCache]: Analyzing trace with hash 579616721, now seen corresponding path program 1 times [2019-09-10 06:10:40,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:40,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:40,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:40,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:40,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:40,558 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 06:10:40,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:40,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:40,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:40,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:40,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:40,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:40,561 INFO L87 Difference]: Start difference. First operand 12727 states and 17986 transitions. Second operand 4 states. [2019-09-10 06:10:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:40,845 INFO L93 Difference]: Finished difference Result 24555 states and 34221 transitions. [2019-09-10 06:10:40,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:40,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-10 06:10:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:40,896 INFO L225 Difference]: With dead ends: 24555 [2019-09-10 06:10:40,896 INFO L226 Difference]: Without dead ends: 24555 [2019-09-10 06:10:40,899 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 06:10:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24555 states. [2019-09-10 06:10:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24555 to 24553. [2019-09-10 06:10:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24553 states. [2019-09-10 06:10:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24553 states to 24553 states and 34220 transitions. [2019-09-10 06:10:41,281 INFO L78 Accepts]: Start accepts. Automaton has 24553 states and 34220 transitions. Word has length 164 [2019-09-10 06:10:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:41,281 INFO L475 AbstractCegarLoop]: Abstraction has 24553 states and 34220 transitions. [2019-09-10 06:10:41,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 24553 states and 34220 transitions. [2019-09-10 06:10:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 06:10:41,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:41,316 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] [2019-09-10 06:10:41,317 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1599816613, now seen corresponding path program 1 times [2019-09-10 06:10:41,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:41,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:41,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:41,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:41,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:41,385 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 06:10:41,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:41,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:41,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:41,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:41,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:41,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:41,388 INFO L87 Difference]: Start difference. First operand 24553 states and 34220 transitions. Second operand 3 states. [2019-09-10 06:10:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:42,026 INFO L93 Difference]: Finished difference Result 49013 states and 68320 transitions. [2019-09-10 06:10:42,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:42,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-10 06:10:42,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:42,135 INFO L225 Difference]: With dead ends: 49013 [2019-09-10 06:10:42,135 INFO L226 Difference]: Without dead ends: 49013 [2019-09-10 06:10:42,135 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 06:10:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49013 states. [2019-09-10 06:10:42,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49013 to 24559. [2019-09-10 06:10:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24559 states. [2019-09-10 06:10:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24559 states to 24559 states and 34226 transitions. [2019-09-10 06:10:42,708 INFO L78 Accepts]: Start accepts. Automaton has 24559 states and 34226 transitions. Word has length 165 [2019-09-10 06:10:42,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:42,708 INFO L475 AbstractCegarLoop]: Abstraction has 24559 states and 34226 transitions. [2019-09-10 06:10:42,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 24559 states and 34226 transitions. [2019-09-10 06:10:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 06:10:42,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:42,745 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:42,746 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:42,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:42,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1477917308, now seen corresponding path program 1 times [2019-09-10 06:10:42,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:42,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:42,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:42,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:42,998 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 06:10:42,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:42,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:42,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:42,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:42,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:43,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:43,000 INFO L87 Difference]: Start difference. First operand 24559 states and 34226 transitions. Second operand 3 states. [2019-09-10 06:10:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:43,140 INFO L93 Difference]: Finished difference Result 42950 states and 58662 transitions. [2019-09-10 06:10:43,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:43,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-10 06:10:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:43,204 INFO L225 Difference]: With dead ends: 42950 [2019-09-10 06:10:43,205 INFO L226 Difference]: Without dead ends: 42950 [2019-09-10 06:10:43,205 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 06:10:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42950 states. [2019-09-10 06:10:44,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42950 to 42948. [2019-09-10 06:10:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42948 states. [2019-09-10 06:10:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42948 states to 42948 states and 58661 transitions. [2019-09-10 06:10:44,774 INFO L78 Accepts]: Start accepts. Automaton has 42948 states and 58661 transitions. Word has length 166 [2019-09-10 06:10:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:44,774 INFO L475 AbstractCegarLoop]: Abstraction has 42948 states and 58661 transitions. [2019-09-10 06:10:44,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 42948 states and 58661 transitions. [2019-09-10 06:10:44,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 06:10:44,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:44,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] [2019-09-10 06:10:44,813 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:44,813 INFO L82 PathProgramCache]: Analyzing trace with hash 561013721, now seen corresponding path program 1 times [2019-09-10 06:10:44,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:44,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:44,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:44,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:44,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:44,945 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 06:10:44,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:44,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:44,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:44,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:44,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:44,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:44,947 INFO L87 Difference]: Start difference. First operand 42948 states and 58661 transitions. Second operand 4 states. [2019-09-10 06:10:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:45,046 INFO L93 Difference]: Finished difference Result 36615 states and 50074 transitions. [2019-09-10 06:10:45,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:45,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-10 06:10:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:45,093 INFO L225 Difference]: With dead ends: 36615 [2019-09-10 06:10:45,093 INFO L226 Difference]: Without dead ends: 36424 [2019-09-10 06:10:45,093 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 06:10:45,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36424 states. [2019-09-10 06:10:45,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36424 to 36424. [2019-09-10 06:10:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36424 states. [2019-09-10 06:10:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36424 states to 36424 states and 49846 transitions. [2019-09-10 06:10:45,603 INFO L78 Accepts]: Start accepts. Automaton has 36424 states and 49846 transitions. Word has length 166 [2019-09-10 06:10:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:45,603 INFO L475 AbstractCegarLoop]: Abstraction has 36424 states and 49846 transitions. [2019-09-10 06:10:45,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 36424 states and 49846 transitions. [2019-09-10 06:10:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 06:10:45,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:45,632 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 06:10:45,632 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1043597530, now seen corresponding path program 1 times [2019-09-10 06:10:45,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:45,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:45,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:45,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:45,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:45,896 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 06:10:45,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:45,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:45,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:45,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:45,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:45,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:45,898 INFO L87 Difference]: Start difference. First operand 36424 states and 49846 transitions. Second operand 3 states. [2019-09-10 06:10:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:46,291 INFO L93 Difference]: Finished difference Result 40862 states and 56506 transitions. [2019-09-10 06:10:46,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:46,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-10 06:10:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:46,345 INFO L225 Difference]: With dead ends: 40862 [2019-09-10 06:10:46,345 INFO L226 Difference]: Without dead ends: 40862 [2019-09-10 06:10:46,347 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 06:10:46,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40862 states. [2019-09-10 06:10:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40862 to 40860. [2019-09-10 06:10:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40860 states. [2019-09-10 06:10:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40860 states to 40860 states and 56505 transitions. [2019-09-10 06:10:46,800 INFO L78 Accepts]: Start accepts. Automaton has 40860 states and 56505 transitions. Word has length 172 [2019-09-10 06:10:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:46,800 INFO L475 AbstractCegarLoop]: Abstraction has 40860 states and 56505 transitions. [2019-09-10 06:10:46,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 40860 states and 56505 transitions. [2019-09-10 06:10:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 06:10:46,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:46,827 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 06:10:46,827 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:46,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:46,827 INFO L82 PathProgramCache]: Analyzing trace with hash -668932181, now seen corresponding path program 1 times [2019-09-10 06:10:46,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:46,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:46,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:46,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:47,178 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 06:10:47,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:47,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:47,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:47,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:47,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:47,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:47,180 INFO L87 Difference]: Start difference. First operand 40860 states and 56505 transitions. Second operand 3 states. [2019-09-10 06:10:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:47,546 INFO L93 Difference]: Finished difference Result 72424 states and 99985 transitions. [2019-09-10 06:10:47,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:47,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-10 06:10:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:47,624 INFO L225 Difference]: With dead ends: 72424 [2019-09-10 06:10:47,624 INFO L226 Difference]: Without dead ends: 72424 [2019-09-10 06:10:47,624 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 06:10:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72424 states. [2019-09-10 06:10:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72424 to 72422. [2019-09-10 06:10:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72422 states. [2019-09-10 06:10:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72422 states to 72422 states and 99984 transitions. [2019-09-10 06:10:48,572 INFO L78 Accepts]: Start accepts. Automaton has 72422 states and 99984 transitions. Word has length 172 [2019-09-10 06:10:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:48,573 INFO L475 AbstractCegarLoop]: Abstraction has 72422 states and 99984 transitions. [2019-09-10 06:10:48,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 72422 states and 99984 transitions. [2019-09-10 06:10:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 06:10:48,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:48,615 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 06:10:48,615 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:48,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:48,616 INFO L82 PathProgramCache]: Analyzing trace with hash -801167312, now seen corresponding path program 1 times [2019-09-10 06:10:48,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:48,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:48,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:48,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:48,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:48,868 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 06:10:48,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:48,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:10:48,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:48,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:10:48,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:10:48,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:10:48,870 INFO L87 Difference]: Start difference. First operand 72422 states and 99984 transitions. Second operand 10 states. [2019-09-10 06:10:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:49,143 INFO L93 Difference]: Finished difference Result 44896 states and 61794 transitions. [2019-09-10 06:10:49,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:10:49,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 172 [2019-09-10 06:10:49,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:49,180 INFO L225 Difference]: With dead ends: 44896 [2019-09-10 06:10:49,181 INFO L226 Difference]: Without dead ends: 44896 [2019-09-10 06:10:49,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:10:49,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44896 states. [2019-09-10 06:10:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44896 to 36606. [2019-09-10 06:10:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36606 states. [2019-09-10 06:10:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36606 states to 36606 states and 49074 transitions. [2019-09-10 06:10:49,891 INFO L78 Accepts]: Start accepts. Automaton has 36606 states and 49074 transitions. Word has length 172 [2019-09-10 06:10:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:49,891 INFO L475 AbstractCegarLoop]: Abstraction has 36606 states and 49074 transitions. [2019-09-10 06:10:49,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:10:49,891 INFO L276 IsEmpty]: Start isEmpty. Operand 36606 states and 49074 transitions. [2019-09-10 06:10:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 06:10:49,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:49,910 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 06:10:49,910 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:49,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:49,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1602307110, now seen corresponding path program 1 times [2019-09-10 06:10:49,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:49,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:49,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:49,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:49,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:50,126 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 06:10:50,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:50,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:10:50,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:50,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:10:50,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:10:50,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:10:50,128 INFO L87 Difference]: Start difference. First operand 36606 states and 49074 transitions. Second operand 9 states. [2019-09-10 06:10:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:50,450 INFO L93 Difference]: Finished difference Result 36608 states and 48827 transitions. [2019-09-10 06:10:50,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:50,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 172 [2019-09-10 06:10:50,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:50,478 INFO L225 Difference]: With dead ends: 36608 [2019-09-10 06:10:50,478 INFO L226 Difference]: Without dead ends: 36608 [2019-09-10 06:10:50,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:10:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36608 states. [2019-09-10 06:10:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36608 to 36606. [2019-09-10 06:10:50,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36606 states. [2019-09-10 06:10:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36606 states to 36606 states and 48826 transitions. [2019-09-10 06:10:50,773 INFO L78 Accepts]: Start accepts. Automaton has 36606 states and 48826 transitions. Word has length 172 [2019-09-10 06:10:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:50,774 INFO L475 AbstractCegarLoop]: Abstraction has 36606 states and 48826 transitions. [2019-09-10 06:10:50,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:10:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 36606 states and 48826 transitions. [2019-09-10 06:10:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 06:10:50,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:50,792 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 06:10:50,792 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:50,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1518935673, now seen corresponding path program 1 times [2019-09-10 06:10:50,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:50,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:50,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:50,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:50,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:50,968 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 06:10:50,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:50,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:10:50,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:50,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:10:50,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:10:50,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:10:50,970 INFO L87 Difference]: Start difference. First operand 36606 states and 48826 transitions. Second operand 6 states. [2019-09-10 06:10:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:51,599 INFO L93 Difference]: Finished difference Result 73185 states and 103951 transitions. [2019-09-10 06:10:51,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:10:51,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-09-10 06:10:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:51,664 INFO L225 Difference]: With dead ends: 73185 [2019-09-10 06:10:51,664 INFO L226 Difference]: Without dead ends: 73185 [2019-09-10 06:10:51,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:10:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73185 states. [2019-09-10 06:10:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73185 to 72639. [2019-09-10 06:10:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72639 states. [2019-09-10 06:10:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72639 states to 72639 states and 103408 transitions. [2019-09-10 06:10:52,784 INFO L78 Accepts]: Start accepts. Automaton has 72639 states and 103408 transitions. Word has length 172 [2019-09-10 06:10:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:52,785 INFO L475 AbstractCegarLoop]: Abstraction has 72639 states and 103408 transitions. [2019-09-10 06:10:52,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:10:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 72639 states and 103408 transitions. [2019-09-10 06:10:52,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 06:10:52,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:52,803 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 06:10:52,804 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:52,804 INFO L82 PathProgramCache]: Analyzing trace with hash -134187673, now seen corresponding path program 1 times [2019-09-10 06:10:52,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:52,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:52,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:52,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:52,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:53,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:53,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:10:53,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:53,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:10:53,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:10:53,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:10:53,037 INFO L87 Difference]: Start difference. First operand 72639 states and 103408 transitions. Second operand 8 states. [2019-09-10 06:10:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:53,346 INFO L93 Difference]: Finished difference Result 72641 states and 102959 transitions. [2019-09-10 06:10:53,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:53,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 172 [2019-09-10 06:10:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:53,420 INFO L225 Difference]: With dead ends: 72641 [2019-09-10 06:10:53,420 INFO L226 Difference]: Without dead ends: 72641 [2019-09-10 06:10:53,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:10:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72641 states. [2019-09-10 06:10:55,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72641 to 72639. [2019-09-10 06:10:55,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72639 states. [2019-09-10 06:10:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72639 states to 72639 states and 102958 transitions. [2019-09-10 06:10:56,023 INFO L78 Accepts]: Start accepts. Automaton has 72639 states and 102958 transitions. Word has length 172 [2019-09-10 06:10:56,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:56,023 INFO L475 AbstractCegarLoop]: Abstraction has 72639 states and 102958 transitions. [2019-09-10 06:10:56,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:10:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 72639 states and 102958 transitions. [2019-09-10 06:10:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 06:10:56,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:56,041 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 06:10:56,042 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:56,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:56,042 INFO L82 PathProgramCache]: Analyzing trace with hash 323129642, now seen corresponding path program 1 times [2019-09-10 06:10:56,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:56,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:56,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:56,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:56,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:56,515 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 06:10:56,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:56,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:10:56,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:56,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:10:56,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:10:56,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:10:56,517 INFO L87 Difference]: Start difference. First operand 72639 states and 102958 transitions. Second operand 16 states. [2019-09-10 06:10:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:59,311 INFO L93 Difference]: Finished difference Result 116535 states and 166514 transitions. [2019-09-10 06:10:59,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:10:59,311 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 172 [2019-09-10 06:10:59,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:59,429 INFO L225 Difference]: With dead ends: 116535 [2019-09-10 06:10:59,429 INFO L226 Difference]: Without dead ends: 116535 [2019-09-10 06:10:59,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=362, Invalid=970, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:10:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116535 states. [2019-09-10 06:11:00,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116535 to 74551. [2019-09-10 06:11:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74551 states. [2019-09-10 06:11:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74551 states to 74551 states and 105196 transitions. [2019-09-10 06:11:00,593 INFO L78 Accepts]: Start accepts. Automaton has 74551 states and 105196 transitions. Word has length 172 [2019-09-10 06:11:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:00,593 INFO L475 AbstractCegarLoop]: Abstraction has 74551 states and 105196 transitions. [2019-09-10 06:11:00,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:11:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 74551 states and 105196 transitions. [2019-09-10 06:11:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 06:11:00,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:00,611 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 06:11:00,611 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:00,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:00,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1983572546, now seen corresponding path program 1 times [2019-09-10 06:11:00,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:00,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:00,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:00,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:00,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:00,796 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 06:11:00,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:00,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:00,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:00,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:00,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:00,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:00,798 INFO L87 Difference]: Start difference. First operand 74551 states and 105196 transitions. Second operand 4 states. [2019-09-10 06:11:01,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:01,033 INFO L93 Difference]: Finished difference Result 69960 states and 98545 transitions. [2019-09-10 06:11:01,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:01,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-09-10 06:11:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:01,117 INFO L225 Difference]: With dead ends: 69960 [2019-09-10 06:11:01,118 INFO L226 Difference]: Without dead ends: 69960 [2019-09-10 06:11:01,119 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 06:11:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69960 states. [2019-09-10 06:11:02,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69960 to 69868. [2019-09-10 06:11:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69868 states. [2019-09-10 06:11:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69868 states to 69868 states and 98438 transitions. [2019-09-10 06:11:02,219 INFO L78 Accepts]: Start accepts. Automaton has 69868 states and 98438 transitions. Word has length 172 [2019-09-10 06:11:02,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:02,220 INFO L475 AbstractCegarLoop]: Abstraction has 69868 states and 98438 transitions. [2019-09-10 06:11:02,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 69868 states and 98438 transitions. [2019-09-10 06:11:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:11:02,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:02,236 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 06:11:02,236 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:02,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:02,236 INFO L82 PathProgramCache]: Analyzing trace with hash 920545503, now seen corresponding path program 1 times [2019-09-10 06:11:02,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:02,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:02,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:02,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:02,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:02,413 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 06:11:02,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:02,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:02,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:02,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:02,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:02,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:02,414 INFO L87 Difference]: Start difference. First operand 69868 states and 98438 transitions. Second operand 4 states. [2019-09-10 06:11:02,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:02,648 INFO L93 Difference]: Finished difference Result 70296 states and 98919 transitions. [2019-09-10 06:11:02,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:02,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-09-10 06:11:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:02,738 INFO L225 Difference]: With dead ends: 70296 [2019-09-10 06:11:02,739 INFO L226 Difference]: Without dead ends: 70296 [2019-09-10 06:11:02,739 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 06:11:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70296 states. [2019-09-10 06:11:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70296 to 70063. [2019-09-10 06:11:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70063 states. [2019-09-10 06:11:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70063 states to 70063 states and 98652 transitions. [2019-09-10 06:11:03,714 INFO L78 Accepts]: Start accepts. Automaton has 70063 states and 98652 transitions. Word has length 174 [2019-09-10 06:11:03,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:03,714 INFO L475 AbstractCegarLoop]: Abstraction has 70063 states and 98652 transitions. [2019-09-10 06:11:03,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 70063 states and 98652 transitions. [2019-09-10 06:11:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:11:03,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:03,731 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 06:11:03,731 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:03,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1952765221, now seen corresponding path program 1 times [2019-09-10 06:11:03,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:03,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:03,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:03,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:03,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:03,788 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 06:11:03,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:03,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:03,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:03,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:03,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:03,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:03,790 INFO L87 Difference]: Start difference. First operand 70063 states and 98652 transitions. Second operand 3 states. [2019-09-10 06:11:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:04,165 INFO L93 Difference]: Finished difference Result 139921 states and 197061 transitions. [2019-09-10 06:11:04,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:04,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-10 06:11:04,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:04,332 INFO L225 Difference]: With dead ends: 139921 [2019-09-10 06:11:04,333 INFO L226 Difference]: Without dead ends: 139921 [2019-09-10 06:11:04,333 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 06:11:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139921 states. [2019-09-10 06:11:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139921 to 70073. [2019-09-10 06:11:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70073 states. [2019-09-10 06:11:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70073 states to 70073 states and 98662 transitions. [2019-09-10 06:11:05,834 INFO L78 Accepts]: Start accepts. Automaton has 70073 states and 98662 transitions. Word has length 175 [2019-09-10 06:11:05,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:05,834 INFO L475 AbstractCegarLoop]: Abstraction has 70073 states and 98662 transitions. [2019-09-10 06:11:05,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 70073 states and 98662 transitions. [2019-09-10 06:11:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 06:11:05,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:05,851 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 06:11:05,852 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:05,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:05,852 INFO L82 PathProgramCache]: Analyzing trace with hash 246843552, now seen corresponding path program 1 times [2019-09-10 06:11:05,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:05,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:05,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:05,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:05,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:05,975 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 06:11:05,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:05,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:05,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:05,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:05,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:05,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:05,977 INFO L87 Difference]: Start difference. First operand 70073 states and 98662 transitions. Second operand 4 states. [2019-09-10 06:11:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:06,196 INFO L93 Difference]: Finished difference Result 70263 states and 98847 transitions. [2019-09-10 06:11:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:06,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-10 06:11:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:06,288 INFO L225 Difference]: With dead ends: 70263 [2019-09-10 06:11:06,288 INFO L226 Difference]: Without dead ends: 70063 [2019-09-10 06:11:06,288 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 06:11:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70063 states. [2019-09-10 06:11:07,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70063 to 70063. [2019-09-10 06:11:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70063 states. [2019-09-10 06:11:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70063 states to 70063 states and 98647 transitions. [2019-09-10 06:11:07,255 INFO L78 Accepts]: Start accepts. Automaton has 70063 states and 98647 transitions. Word has length 176 [2019-09-10 06:11:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:07,256 INFO L475 AbstractCegarLoop]: Abstraction has 70063 states and 98647 transitions. [2019-09-10 06:11:07,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 70063 states and 98647 transitions. [2019-09-10 06:11:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 06:11:07,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:07,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] [2019-09-10 06:11:07,274 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:07,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:07,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1598358574, now seen corresponding path program 1 times [2019-09-10 06:11:07,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:07,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:07,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:07,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:07,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:07,412 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 06:11:07,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:07,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:07,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:07,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:07,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:07,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:07,414 INFO L87 Difference]: Start difference. First operand 70063 states and 98647 transitions. Second operand 4 states. [2019-09-10 06:11:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:07,644 INFO L93 Difference]: Finished difference Result 61195 states and 85953 transitions. [2019-09-10 06:11:07,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:07,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-10 06:11:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:07,736 INFO L225 Difference]: With dead ends: 61195 [2019-09-10 06:11:07,737 INFO L226 Difference]: Without dead ends: 61195 [2019-09-10 06:11:07,737 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 06:11:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61195 states. [2019-09-10 06:11:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61195 to 60736. [2019-09-10 06:11:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60736 states. [2019-09-10 06:11:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60736 states to 60736 states and 85390 transitions. [2019-09-10 06:11:08,831 INFO L78 Accepts]: Start accepts. Automaton has 60736 states and 85390 transitions. Word has length 176 [2019-09-10 06:11:08,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:08,832 INFO L475 AbstractCegarLoop]: Abstraction has 60736 states and 85390 transitions. [2019-09-10 06:11:08,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:08,832 INFO L276 IsEmpty]: Start isEmpty. Operand 60736 states and 85390 transitions. [2019-09-10 06:11:08,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:11:08,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:08,846 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] [2019-09-10 06:11:08,847 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:08,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:08,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1729659236, now seen corresponding path program 1 times [2019-09-10 06:11:08,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:08,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:08,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:08,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:08,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:08,938 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 06:11:08,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:08,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:08,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:08,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:08,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:08,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:08,940 INFO L87 Difference]: Start difference. First operand 60736 states and 85390 transitions. Second operand 3 states. [2019-09-10 06:11:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:09,344 INFO L93 Difference]: Finished difference Result 70792 states and 100146 transitions. [2019-09-10 06:11:09,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:09,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-10 06:11:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:09,445 INFO L225 Difference]: With dead ends: 70792 [2019-09-10 06:11:09,445 INFO L226 Difference]: Without dead ends: 70792 [2019-09-10 06:11:09,446 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 06:11:09,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70792 states. [2019-09-10 06:11:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70792 to 70790. [2019-09-10 06:11:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70790 states. [2019-09-10 06:11:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70790 states to 70790 states and 100145 transitions. [2019-09-10 06:11:10,214 INFO L78 Accepts]: Start accepts. Automaton has 70790 states and 100145 transitions. Word has length 178 [2019-09-10 06:11:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:10,215 INFO L475 AbstractCegarLoop]: Abstraction has 70790 states and 100145 transitions. [2019-09-10 06:11:10,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 70790 states and 100145 transitions. [2019-09-10 06:11:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:11:10,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:10,230 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] [2019-09-10 06:11:10,231 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:10,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:10,231 INFO L82 PathProgramCache]: Analyzing trace with hash 629623711, now seen corresponding path program 1 times [2019-09-10 06:11:10,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:10,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:10,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:10,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:10,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:10,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:10,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:10,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:10,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:10,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:10,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:10,333 INFO L87 Difference]: Start difference. First operand 70790 states and 100145 transitions. Second operand 3 states. [2019-09-10 06:11:11,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:11,121 INFO L93 Difference]: Finished difference Result 138240 states and 193825 transitions. [2019-09-10 06:11:11,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:11,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-10 06:11:11,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:11,260 INFO L225 Difference]: With dead ends: 138240 [2019-09-10 06:11:11,260 INFO L226 Difference]: Without dead ends: 138240 [2019-09-10 06:11:11,260 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 06:11:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138240 states. [2019-09-10 06:11:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138240 to 138238. [2019-09-10 06:11:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138238 states. [2019-09-10 06:11:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138238 states to 138238 states and 193824 transitions. [2019-09-10 06:11:12,520 INFO L78 Accepts]: Start accepts. Automaton has 138238 states and 193824 transitions. Word has length 178 [2019-09-10 06:11:12,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:12,521 INFO L475 AbstractCegarLoop]: Abstraction has 138238 states and 193824 transitions. [2019-09-10 06:11:12,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:12,521 INFO L276 IsEmpty]: Start isEmpty. Operand 138238 states and 193824 transitions. [2019-09-10 06:11:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:11:12,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:12,549 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] [2019-09-10 06:11:12,549 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:12,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:12,549 INFO L82 PathProgramCache]: Analyzing trace with hash 877619674, now seen corresponding path program 1 times [2019-09-10 06:11:12,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:12,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:12,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:12,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:12,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:12,687 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 06:11:12,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:12,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:11:12,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:12,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:11:12,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:11:12,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:12,688 INFO L87 Difference]: Start difference. First operand 138238 states and 193824 transitions. Second operand 5 states. [2019-09-10 06:11:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:13,680 INFO L93 Difference]: Finished difference Result 108313 states and 152589 transitions. [2019-09-10 06:11:13,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:11:13,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-09-10 06:11:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:13,809 INFO L225 Difference]: With dead ends: 108313 [2019-09-10 06:11:13,809 INFO L226 Difference]: Without dead ends: 108313 [2019-09-10 06:11:13,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:11:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108313 states. [2019-09-10 06:11:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108313 to 108311. [2019-09-10 06:11:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108311 states. [2019-09-10 06:11:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108311 states to 108311 states and 152588 transitions. [2019-09-10 06:11:14,813 INFO L78 Accepts]: Start accepts. Automaton has 108311 states and 152588 transitions. Word has length 178 [2019-09-10 06:11:14,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:14,814 INFO L475 AbstractCegarLoop]: Abstraction has 108311 states and 152588 transitions. [2019-09-10 06:11:14,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:11:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 108311 states and 152588 transitions. [2019-09-10 06:11:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:11:14,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:14,835 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] [2019-09-10 06:11:14,835 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:14,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:14,835 INFO L82 PathProgramCache]: Analyzing trace with hash -497687846, now seen corresponding path program 1 times [2019-09-10 06:11:14,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:14,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:14,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:14,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:14,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:15,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 06:11:15,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:15,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:11:15,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:15,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:11:15,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:11:15,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:11:15,013 INFO L87 Difference]: Start difference. First operand 108311 states and 152588 transitions. Second operand 8 states. [2019-09-10 06:11:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:16,096 INFO L93 Difference]: Finished difference Result 327867 states and 470587 transitions. [2019-09-10 06:11:16,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:11:16,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-09-10 06:11:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:16,526 INFO L225 Difference]: With dead ends: 327867 [2019-09-10 06:11:16,527 INFO L226 Difference]: Without dead ends: 327867 [2019-09-10 06:11:16,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:11:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327867 states. [2019-09-10 06:11:23,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327867 to 315494. [2019-09-10 06:11:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315494 states. [2019-09-10 06:11:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315494 states to 315494 states and 454761 transitions. [2019-09-10 06:11:23,563 INFO L78 Accepts]: Start accepts. Automaton has 315494 states and 454761 transitions. Word has length 178 [2019-09-10 06:11:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:23,563 INFO L475 AbstractCegarLoop]: Abstraction has 315494 states and 454761 transitions. [2019-09-10 06:11:23,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:11:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 315494 states and 454761 transitions. [2019-09-10 06:11:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:11:23,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:23,604 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] [2019-09-10 06:11:23,604 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:23,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:23,604 INFO L82 PathProgramCache]: Analyzing trace with hash 398907811, now seen corresponding path program 1 times [2019-09-10 06:11:23,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:23,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:23,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:23,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:23,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:24,555 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 06:11:24,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:24,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:11:24,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:24,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:11:24,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:11:24,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:11:24,557 INFO L87 Difference]: Start difference. First operand 315494 states and 454761 transitions. Second operand 21 states. [2019-09-10 06:11:26,074 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 06:11:26,249 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-10 06:11:33,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:33,374 INFO L93 Difference]: Finished difference Result 413169 states and 594759 transitions. [2019-09-10 06:11:33,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 06:11:33,374 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 178 [2019-09-10 06:11:33,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:33,907 INFO L225 Difference]: With dead ends: 413169 [2019-09-10 06:11:33,907 INFO L226 Difference]: Without dead ends: 413169 [2019-09-10 06:11:33,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=432, Invalid=1638, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 06:11:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413169 states. [2019-09-10 06:11:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413169 to 324214. [2019-09-10 06:11:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324214 states. [2019-09-10 06:11:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324214 states to 324214 states and 464837 transitions. [2019-09-10 06:11:38,149 INFO L78 Accepts]: Start accepts. Automaton has 324214 states and 464837 transitions. Word has length 178 [2019-09-10 06:11:38,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:38,150 INFO L475 AbstractCegarLoop]: Abstraction has 324214 states and 464837 transitions. [2019-09-10 06:11:38,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:11:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 324214 states and 464837 transitions. [2019-09-10 06:11:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:11:43,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:43,540 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] [2019-09-10 06:11:43,541 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:43,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:43,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1242603885, now seen corresponding path program 1 times [2019-09-10 06:11:43,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:43,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:43,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:43,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:43,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:44,888 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 06:11:44,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:44,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:11:44,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:44,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:11:44,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:11:44,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:11:44,890 INFO L87 Difference]: Start difference. First operand 324214 states and 464837 transitions. Second operand 25 states. [2019-09-10 06:11:45,610 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:11:46,089 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 06:11:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:50,445 INFO L93 Difference]: Finished difference Result 482099 states and 697993 transitions. [2019-09-10 06:11:50,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:11:50,445 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2019-09-10 06:11:50,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:52,098 INFO L225 Difference]: With dead ends: 482099 [2019-09-10 06:11:52,098 INFO L226 Difference]: Without dead ends: 482051 [2019-09-10 06:11:52,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:11:52,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482051 states. [2019-09-10 06:12:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482051 to 326927. [2019-09-10 06:12:02,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326927 states. [2019-09-10 06:12:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326927 states to 326927 states and 467976 transitions. [2019-09-10 06:12:02,611 INFO L78 Accepts]: Start accepts. Automaton has 326927 states and 467976 transitions. Word has length 178 [2019-09-10 06:12:02,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:02,611 INFO L475 AbstractCegarLoop]: Abstraction has 326927 states and 467976 transitions. [2019-09-10 06:12:02,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:12:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 326927 states and 467976 transitions. [2019-09-10 06:12:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:12:02,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:02,657 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] [2019-09-10 06:12:02,657 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:02,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:02,658 INFO L82 PathProgramCache]: Analyzing trace with hash -791507543, now seen corresponding path program 1 times [2019-09-10 06:12:02,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:02,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:02,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:02,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:02,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:02,934 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 06:12:02,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:02,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:12:02,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:02,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:12:02,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:12:02,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:12:02,936 INFO L87 Difference]: Start difference. First operand 326927 states and 467976 transitions. Second operand 11 states. [2019-09-10 06:12:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:03,785 INFO L93 Difference]: Finished difference Result 297006 states and 431067 transitions. [2019-09-10 06:12:03,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:12:03,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 178 [2019-09-10 06:12:03,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:04,170 INFO L225 Difference]: With dead ends: 297006 [2019-09-10 06:12:04,170 INFO L226 Difference]: Without dead ends: 297006 [2019-09-10 06:12:04,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:12:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297006 states. [2019-09-10 06:12:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297006 to 188442. [2019-09-10 06:12:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188442 states. [2019-09-10 06:12:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188442 states to 188442 states and 268761 transitions. [2019-09-10 06:12:12,291 INFO L78 Accepts]: Start accepts. Automaton has 188442 states and 268761 transitions. Word has length 178 [2019-09-10 06:12:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:12,291 INFO L475 AbstractCegarLoop]: Abstraction has 188442 states and 268761 transitions. [2019-09-10 06:12:12,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:12:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 188442 states and 268761 transitions. [2019-09-10 06:12:12,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:12:12,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:12,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:12,319 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:12,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:12,319 INFO L82 PathProgramCache]: Analyzing trace with hash -543511580, now seen corresponding path program 1 times [2019-09-10 06:12:12,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:12,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:12,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:12,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:12,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:13,683 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 06:12:13,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:13,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:12:13,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:13,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:12:13,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:12:13,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:12:13,685 INFO L87 Difference]: Start difference. First operand 188442 states and 268761 transitions. Second operand 22 states. [2019-09-10 06:12:14,325 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 06:12:15,251 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-10 06:12:15,443 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-10 06:12:16,028 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 06:12:16,262 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 06:12:16,571 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 06:12:16,780 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-09-10 06:12:17,096 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 06:12:17,447 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-09-10 06:12:17,691 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-09-10 06:12:18,038 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-10 06:12:18,618 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:12:18,821 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:12:19,109 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:12:19,852 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:12:20,051 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-10 06:12:20,585 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 06:12:21,017 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 06:12:21,663 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-10 06:12:21,930 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-09-10 06:12:22,681 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-10 06:12:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:23,487 INFO L93 Difference]: Finished difference Result 334303 states and 481821 transitions. [2019-09-10 06:12:23,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 06:12:23,487 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2019-09-10 06:12:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:23,921 INFO L225 Difference]: With dead ends: 334303 [2019-09-10 06:12:23,921 INFO L226 Difference]: Without dead ends: 334303 [2019-09-10 06:12:23,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=698, Invalid=2272, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 06:12:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334303 states. [2019-09-10 06:12:27,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334303 to 189454. [2019-09-10 06:12:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189454 states. [2019-09-10 06:12:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189454 states to 189454 states and 269896 transitions. [2019-09-10 06:12:28,051 INFO L78 Accepts]: Start accepts. Automaton has 189454 states and 269896 transitions. Word has length 178 [2019-09-10 06:12:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:28,051 INFO L475 AbstractCegarLoop]: Abstraction has 189454 states and 269896 transitions. [2019-09-10 06:12:28,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:12:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 189454 states and 269896 transitions. [2019-09-10 06:12:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:12:28,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:28,079 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] [2019-09-10 06:12:28,079 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:28,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:28,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1674053606, now seen corresponding path program 1 times [2019-09-10 06:12:28,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:28,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:28,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:28,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:28,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:28,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 06:12:28,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:28,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:12:28,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:28,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:12:28,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:12:28,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:28,224 INFO L87 Difference]: Start difference. First operand 189454 states and 269896 transitions. Second operand 5 states. [2019-09-10 06:12:29,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:29,012 INFO L93 Difference]: Finished difference Result 293689 states and 424395 transitions. [2019-09-10 06:12:29,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:12:29,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-09-10 06:12:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:29,412 INFO L225 Difference]: With dead ends: 293689 [2019-09-10 06:12:29,412 INFO L226 Difference]: Without dead ends: 293689 [2019-09-10 06:12:29,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293689 states. [2019-09-10 06:12:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293689 to 202479. [2019-09-10 06:12:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202479 states. [2019-09-10 06:12:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202479 states to 202479 states and 289200 transitions. [2019-09-10 06:12:33,994 INFO L78 Accepts]: Start accepts. Automaton has 202479 states and 289200 transitions. Word has length 178 [2019-09-10 06:12:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:33,994 INFO L475 AbstractCegarLoop]: Abstraction has 202479 states and 289200 transitions. [2019-09-10 06:12:33,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:12:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 202479 states and 289200 transitions. [2019-09-10 06:12:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:12:34,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:34,020 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] [2019-09-10 06:12:34,020 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:34,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:34,020 INFO L82 PathProgramCache]: Analyzing trace with hash 874552556, now seen corresponding path program 1 times [2019-09-10 06:12:34,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:34,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:34,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:34,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:34,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:34,169 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 06:12:34,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:34,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:12:34,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:34,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:12:34,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:12:34,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:12:34,172 INFO L87 Difference]: Start difference. First operand 202479 states and 289200 transitions. Second operand 6 states. [2019-09-10 06:12:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:35,194 INFO L93 Difference]: Finished difference Result 328094 states and 475137 transitions. [2019-09-10 06:12:35,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:12:35,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-09-10 06:12:35,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:35,690 INFO L225 Difference]: With dead ends: 328094 [2019-09-10 06:12:35,690 INFO L226 Difference]: Without dead ends: 328094 [2019-09-10 06:12:35,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:12:35,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328094 states. [2019-09-10 06:12:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328094 to 220060. [2019-09-10 06:12:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220060 states. [2019-09-10 06:12:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220060 states to 220060 states and 315044 transitions. [2019-09-10 06:12:42,945 INFO L78 Accepts]: Start accepts. Automaton has 220060 states and 315044 transitions. Word has length 178 [2019-09-10 06:12:42,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:42,945 INFO L475 AbstractCegarLoop]: Abstraction has 220060 states and 315044 transitions. [2019-09-10 06:12:42,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:12:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 220060 states and 315044 transitions. [2019-09-10 06:12:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:12:42,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:42,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] [2019-09-10 06:12:42,971 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:42,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:42,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1718248630, now seen corresponding path program 1 times [2019-09-10 06:12:42,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:42,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:42,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:42,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:42,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:44,561 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 06:12:44,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:44,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:12:44,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:44,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:12:44,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:12:44,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:12:44,563 INFO L87 Difference]: Start difference. First operand 220060 states and 315044 transitions. Second operand 22 states. [2019-09-10 06:12:45,923 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 26 [2019-09-10 06:12:46,601 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 28 [2019-09-10 06:12:47,054 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 32 [2019-09-10 06:12:47,272 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 34 [2019-09-10 06:12:47,546 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 36 [2019-09-10 06:12:47,826 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 44 [2019-09-10 06:12:48,111 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 41 [2019-09-10 06:12:48,278 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 28 [2019-09-10 06:12:48,482 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 32 [2019-09-10 06:12:50,971 WARN L188 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 91 DAG size of output: 41 [2019-09-10 06:12:51,243 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 37 [2019-09-10 06:12:51,514 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 35 [2019-09-10 06:12:51,713 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 30 [2019-09-10 06:12:52,694 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-09-10 06:12:54,725 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 30 [2019-09-10 06:12:54,988 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2019-09-10 06:12:55,882 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2019-09-10 06:12:56,432 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 30 [2019-09-10 06:12:56,681 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 34 [2019-09-10 06:12:58,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:58,867 INFO L93 Difference]: Finished difference Result 396432 states and 570469 transitions. [2019-09-10 06:12:58,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 06:12:58,868 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2019-09-10 06:12:58,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:59,434 INFO L225 Difference]: With dead ends: 396432 [2019-09-10 06:12:59,434 INFO L226 Difference]: Without dead ends: 396432 [2019-09-10 06:12:59,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=804, Invalid=2388, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 06:12:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396432 states. [2019-09-10 06:13:02,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396432 to 221195. [2019-09-10 06:13:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221195 states. [2019-09-10 06:13:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221195 states to 221195 states and 316379 transitions. [2019-09-10 06:13:03,155 INFO L78 Accepts]: Start accepts. Automaton has 221195 states and 316379 transitions. Word has length 178 [2019-09-10 06:13:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:03,155 INFO L475 AbstractCegarLoop]: Abstraction has 221195 states and 316379 transitions. [2019-09-10 06:13:03,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:13:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 221195 states and 316379 transitions. [2019-09-10 06:13:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:13:03,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:03,185 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] [2019-09-10 06:13:03,185 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:03,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:03,186 INFO L82 PathProgramCache]: Analyzing trace with hash 618213105, now seen corresponding path program 1 times [2019-09-10 06:13:03,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:03,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:03,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:03,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:03,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:04,338 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 06:13:04,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:04,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:13:04,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:04,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:13:04,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:13:04,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:13:04,339 INFO L87 Difference]: Start difference. First operand 221195 states and 316379 transitions. Second operand 10 states. [2019-09-10 06:13:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:04,849 INFO L93 Difference]: Finished difference Result 169162 states and 240754 transitions. [2019-09-10 06:13:04,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:13:04,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 178 [2019-09-10 06:13:04,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:05,064 INFO L225 Difference]: With dead ends: 169162 [2019-09-10 06:13:05,065 INFO L226 Difference]: Without dead ends: 169162 [2019-09-10 06:13:05,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:13:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169162 states. [2019-09-10 06:13:07,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169162 to 123929. [2019-09-10 06:13:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123929 states. [2019-09-10 06:13:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123929 states to 123929 states and 173480 transitions. [2019-09-10 06:13:07,617 INFO L78 Accepts]: Start accepts. Automaton has 123929 states and 173480 transitions. Word has length 178 [2019-09-10 06:13:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:07,617 INFO L475 AbstractCegarLoop]: Abstraction has 123929 states and 173480 transitions. [2019-09-10 06:13:07,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:13:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 123929 states and 173480 transitions. [2019-09-10 06:13:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:13:07,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:07,641 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] [2019-09-10 06:13:07,641 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:07,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1590213073, now seen corresponding path program 1 times [2019-09-10 06:13:07,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:07,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:07,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:07,856 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 06:13:07,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:07,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:13:07,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:07,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:13:07,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:13:07,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:13:07,858 INFO L87 Difference]: Start difference. First operand 123929 states and 173480 transitions. Second operand 9 states. [2019-09-10 06:13:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:08,360 INFO L93 Difference]: Finished difference Result 123931 states and 173031 transitions. [2019-09-10 06:13:08,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:13:08,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2019-09-10 06:13:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:08,512 INFO L225 Difference]: With dead ends: 123931 [2019-09-10 06:13:08,512 INFO L226 Difference]: Without dead ends: 123931 [2019-09-10 06:13:08,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:13:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123931 states. [2019-09-10 06:13:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123931 to 71281. [2019-09-10 06:13:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71281 states. [2019-09-10 06:13:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71281 states to 71281 states and 95240 transitions. [2019-09-10 06:13:10,032 INFO L78 Accepts]: Start accepts. Automaton has 71281 states and 95240 transitions. Word has length 178 [2019-09-10 06:13:10,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:10,033 INFO L475 AbstractCegarLoop]: Abstraction has 71281 states and 95240 transitions. [2019-09-10 06:13:10,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:13:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 71281 states and 95240 transitions. [2019-09-10 06:13:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:13:10,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:10,056 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] [2019-09-10 06:13:10,056 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:10,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:10,057 INFO L82 PathProgramCache]: Analyzing trace with hash -186928982, now seen corresponding path program 1 times [2019-09-10 06:13:10,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:10,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:10,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:10,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:10,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:11,370 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 06:13:11,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:11,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:13:11,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:11,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:13:11,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:13:11,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:13:11,371 INFO L87 Difference]: Start difference. First operand 71281 states and 95240 transitions. Second operand 25 states. [2019-09-10 06:13:12,381 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 06:13:12,555 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:13:12,782 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 06:13:13,025 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 06:13:14,803 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2019-09-10 06:13:15,577 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-09-10 06:13:15,758 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-09-10 06:13:16,193 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-09-10 06:13:16,330 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 06:13:16,509 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 38 [2019-09-10 06:13:16,686 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 06:13:17,044 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-09-10 06:13:17,329 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 06:13:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:22,678 INFO L93 Difference]: Finished difference Result 121288 states and 165289 transitions. [2019-09-10 06:13:22,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-10 06:13:22,678 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2019-09-10 06:13:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:22,802 INFO L225 Difference]: With dead ends: 121288 [2019-09-10 06:13:22,802 INFO L226 Difference]: Without dead ends: 121288 [2019-09-10 06:13:22,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=983, Invalid=4567, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 06:13:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121288 states. [2019-09-10 06:13:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121288 to 72213. [2019-09-10 06:13:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72213 states. [2019-09-10 06:13:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72213 states to 72213 states and 96316 transitions. [2019-09-10 06:13:23,816 INFO L78 Accepts]: Start accepts. Automaton has 72213 states and 96316 transitions. Word has length 178 [2019-09-10 06:13:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:23,816 INFO L475 AbstractCegarLoop]: Abstraction has 72213 states and 96316 transitions. [2019-09-10 06:13:23,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:13:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 72213 states and 96316 transitions. [2019-09-10 06:13:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:13:23,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:23,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] [2019-09-10 06:13:23,838 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:23,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1319749199, now seen corresponding path program 1 times [2019-09-10 06:13:23,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:23,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:23,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:23,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:23,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:25,004 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 06:13:25,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:25,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:13:25,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:25,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:13:25,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:13:25,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:13:25,006 INFO L87 Difference]: Start difference. First operand 72213 states and 96316 transitions. Second operand 25 states. [2019-09-10 06:13:25,947 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2019-09-10 06:13:27,190 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 06:13:27,406 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 06:13:27,749 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-09-10 06:13:27,886 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-09-10 06:13:28,291 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2019-09-10 06:13:28,555 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-09-10 06:13:28,771 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-10 06:13:28,915 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-09-10 06:13:29,383 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-10 06:13:29,588 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:13:29,891 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 06:13:30,033 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-10 06:13:30,624 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:13:31,015 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 06:13:31,405 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 06:13:33,594 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-10 06:13:35,390 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 38 [2019-09-10 06:13:35,635 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-09-10 06:13:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:36,339 INFO L93 Difference]: Finished difference Result 140002 states and 192154 transitions. [2019-09-10 06:13:36,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 06:13:36,340 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2019-09-10 06:13:36,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:36,478 INFO L225 Difference]: With dead ends: 140002 [2019-09-10 06:13:36,478 INFO L226 Difference]: Without dead ends: 140002 [2019-09-10 06:13:36,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=755, Invalid=2551, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 06:13:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140002 states. [2019-09-10 06:13:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140002 to 73203. [2019-09-10 06:13:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73203 states. [2019-09-10 06:13:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73203 states to 73203 states and 97456 transitions. [2019-09-10 06:13:37,860 INFO L78 Accepts]: Start accepts. Automaton has 73203 states and 97456 transitions. Word has length 178 [2019-09-10 06:13:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:37,860 INFO L475 AbstractCegarLoop]: Abstraction has 73203 states and 97456 transitions. [2019-09-10 06:13:37,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:13:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 73203 states and 97456 transitions. [2019-09-10 06:13:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:13:37,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:37,884 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] [2019-09-10 06:13:37,885 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:37,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash -342230127, now seen corresponding path program 1 times [2019-09-10 06:13:37,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:37,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:37,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:38,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:38,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:13:38,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:38,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:13:38,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:13:38,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:13:38,152 INFO L87 Difference]: Start difference. First operand 73203 states and 97456 transitions. Second operand 13 states. [2019-09-10 06:13:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:39,729 INFO L93 Difference]: Finished difference Result 118554 states and 159165 transitions. [2019-09-10 06:13:39,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 06:13:39,729 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 178 [2019-09-10 06:13:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:39,844 INFO L225 Difference]: With dead ends: 118554 [2019-09-10 06:13:39,845 INFO L226 Difference]: Without dead ends: 118554 [2019-09-10 06:13:39,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:13:39,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118554 states. [2019-09-10 06:13:41,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118554 to 77670. [2019-09-10 06:13:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77670 states. [2019-09-10 06:13:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77670 states to 77670 states and 102622 transitions. [2019-09-10 06:13:41,181 INFO L78 Accepts]: Start accepts. Automaton has 77670 states and 102622 transitions. Word has length 178 [2019-09-10 06:13:41,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:41,181 INFO L475 AbstractCegarLoop]: Abstraction has 77670 states and 102622 transitions. [2019-09-10 06:13:41,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:13:41,182 INFO L276 IsEmpty]: Start isEmpty. Operand 77670 states and 102622 transitions. [2019-09-10 06:13:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:13:41,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:41,207 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] [2019-09-10 06:13:41,207 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:41,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:41,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1638968615, now seen corresponding path program 1 times [2019-09-10 06:13:41,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:41,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:41,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:41,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:41,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:42,522 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 06:13:42,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:42,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:13:42,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:42,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:13:42,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:13:42,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:13:42,524 INFO L87 Difference]: Start difference. First operand 77670 states and 102622 transitions. Second operand 22 states. [2019-09-10 06:13:43,690 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 06:13:44,043 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 06:13:44,240 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 06:13:44,399 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:13:44,779 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:13:45,036 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-10 06:13:45,884 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-10 06:13:46,083 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 06:13:46,488 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-09-10 06:13:46,644 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2019-09-10 06:13:46,802 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-09-10 06:13:47,350 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-09-10 06:13:47,965 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-09-10 06:13:48,149 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:13:48,347 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-09-10 06:13:48,565 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:13:48,887 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 06:13:49,438 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 06:13:51,241 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-09-10 06:13:52,094 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 42 [2019-09-10 06:13:52,340 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-09-10 06:13:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:53,025 INFO L93 Difference]: Finished difference Result 119386 states and 159113 transitions. [2019-09-10 06:13:53,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 06:13:53,026 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2019-09-10 06:13:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:53,142 INFO L225 Difference]: With dead ends: 119386 [2019-09-10 06:13:53,142 INFO L226 Difference]: Without dead ends: 119386 [2019-09-10 06:13:53,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=853, Invalid=3307, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 06:13:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119386 states. [2019-09-10 06:13:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119386 to 81206. [2019-09-10 06:13:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81206 states. [2019-09-10 06:13:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81206 states to 81206 states and 106651 transitions. [2019-09-10 06:13:54,069 INFO L78 Accepts]: Start accepts. Automaton has 81206 states and 106651 transitions. Word has length 178 [2019-09-10 06:13:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:54,069 INFO L475 AbstractCegarLoop]: Abstraction has 81206 states and 106651 transitions. [2019-09-10 06:13:54,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:13:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 81206 states and 106651 transitions. [2019-09-10 06:13:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:13:54,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:54,099 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] [2019-09-10 06:13:54,099 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:54,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:54,100 INFO L82 PathProgramCache]: Analyzing trace with hash -980929010, now seen corresponding path program 1 times [2019-09-10 06:13:54,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:54,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:54,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:54,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:54,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:54,535 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 06:13:54,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:54,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:13:54,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:54,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:13:54,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:13:54,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:13:54,536 INFO L87 Difference]: Start difference. First operand 81206 states and 106651 transitions. Second operand 16 states. [2019-09-10 06:13:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:57,521 INFO L93 Difference]: Finished difference Result 147198 states and 197162 transitions. [2019-09-10 06:13:57,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:13:57,522 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 178 [2019-09-10 06:13:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:57,657 INFO L225 Difference]: With dead ends: 147198 [2019-09-10 06:13:57,657 INFO L226 Difference]: Without dead ends: 147198 [2019-09-10 06:13:57,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=355, Invalid=905, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:13:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147198 states. [2019-09-10 06:13:58,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147198 to 87559. [2019-09-10 06:13:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87559 states. [2019-09-10 06:13:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87559 states to 87559 states and 113961 transitions. [2019-09-10 06:13:58,703 INFO L78 Accepts]: Start accepts. Automaton has 87559 states and 113961 transitions. Word has length 178 [2019-09-10 06:13:58,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:58,703 INFO L475 AbstractCegarLoop]: Abstraction has 87559 states and 113961 transitions. [2019-09-10 06:13:58,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:13:58,703 INFO L276 IsEmpty]: Start isEmpty. Operand 87559 states and 113961 transitions. [2019-09-10 06:13:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:13:58,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:58,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:58,736 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:58,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:58,736 INFO L82 PathProgramCache]: Analyzing trace with hash -582220131, now seen corresponding path program 1 times [2019-09-10 06:13:58,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:58,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:58,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:58,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:58,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:59,641 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 06:13:59,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:59,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:13:59,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:59,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:13:59,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:13:59,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:13:59,642 INFO L87 Difference]: Start difference. First operand 87559 states and 113961 transitions. Second operand 15 states. [2019-09-10 06:14:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:01,814 INFO L93 Difference]: Finished difference Result 133247 states and 175777 transitions. [2019-09-10 06:14:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:14:01,815 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 178 [2019-09-10 06:14:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:01,952 INFO L225 Difference]: With dead ends: 133247 [2019-09-10 06:14:01,952 INFO L226 Difference]: Without dead ends: 133247 [2019-09-10 06:14:01,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:14:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133247 states. [2019-09-10 06:14:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133247 to 96562. [2019-09-10 06:14:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96562 states. [2019-09-10 06:14:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96562 states to 96562 states and 124202 transitions. [2019-09-10 06:14:03,766 INFO L78 Accepts]: Start accepts. Automaton has 96562 states and 124202 transitions. Word has length 178 [2019-09-10 06:14:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:03,766 INFO L475 AbstractCegarLoop]: Abstraction has 96562 states and 124202 transitions. [2019-09-10 06:14:03,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:14:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 96562 states and 124202 transitions. [2019-09-10 06:14:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:14:03,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:03,810 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] [2019-09-10 06:14:03,810 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:03,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:03,810 INFO L82 PathProgramCache]: Analyzing trace with hash 762885331, now seen corresponding path program 1 times [2019-09-10 06:14:03,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:03,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:03,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:03,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:03,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:04,618 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-10 06:14:04,870 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 06:14:06,474 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 06:14:06,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:06,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:14:06,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:06,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:14:06,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:14:06,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:14:06,475 INFO L87 Difference]: Start difference. First operand 96562 states and 124202 transitions. Second operand 26 states. [2019-09-10 06:14:07,327 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-10 06:14:07,560 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2019-09-10 06:14:08,021 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-09-10 06:14:08,353 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 88 [2019-09-10 06:14:08,558 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:14:08,764 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 06:14:09,069 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 06:14:09,280 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:14:09,602 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:14:09,904 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-09-10 06:14:11,021 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-09-10 06:14:11,324 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 06:14:11,852 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-10 06:14:12,516 WARN L188 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 06:14:12,823 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 06:14:16,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:16,635 INFO L93 Difference]: Finished difference Result 122179 states and 156594 transitions. [2019-09-10 06:14:16,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:14:16,636 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 178 [2019-09-10 06:14:16,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:16,740 INFO L225 Difference]: With dead ends: 122179 [2019-09-10 06:14:16,741 INFO L226 Difference]: Without dead ends: 121250 [2019-09-10 06:14:16,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=415, Invalid=1565, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 06:14:16,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121250 states. [2019-09-10 06:14:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121250 to 97301. [2019-09-10 06:14:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97301 states. [2019-09-10 06:14:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97301 states to 97301 states and 125025 transitions. [2019-09-10 06:14:18,498 INFO L78 Accepts]: Start accepts. Automaton has 97301 states and 125025 transitions. Word has length 178 [2019-09-10 06:14:18,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:18,499 INFO L475 AbstractCegarLoop]: Abstraction has 97301 states and 125025 transitions. [2019-09-10 06:14:18,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:14:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 97301 states and 125025 transitions. [2019-09-10 06:14:18,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:14:18,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:18,547 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] [2019-09-10 06:14:18,547 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:18,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:18,547 INFO L82 PathProgramCache]: Analyzing trace with hash -49045981, now seen corresponding path program 1 times [2019-09-10 06:14:18,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:18,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:18,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:18,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:18,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:19,286 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 25 [2019-09-10 06:14:19,578 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 37 [2019-09-10 06:14:19,799 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2019-09-10 06:14:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:20,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:20,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 06:14:20,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:20,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 06:14:20,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 06:14:20,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:14:20,630 INFO L87 Difference]: Start difference. First operand 97301 states and 125025 transitions. Second operand 27 states. [2019-09-10 06:14:21,402 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 06:14:21,715 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 06:14:22,215 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-10 06:14:24,513 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 06:14:24,851 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 06:14:25,486 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 06:14:26,549 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 06:14:27,598 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 06:14:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:32,493 INFO L93 Difference]: Finished difference Result 148083 states and 194822 transitions. [2019-09-10 06:14:32,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 06:14:32,493 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 178 [2019-09-10 06:14:32,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:32,622 INFO L225 Difference]: With dead ends: 148083 [2019-09-10 06:14:32,622 INFO L226 Difference]: Without dead ends: 148083 [2019-09-10 06:14:32,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1115, Invalid=4891, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 06:14:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148083 states. [2019-09-10 06:14:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148083 to 99913. [2019-09-10 06:14:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99913 states. [2019-09-10 06:14:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99913 states to 99913 states and 128010 transitions. [2019-09-10 06:14:34,235 INFO L78 Accepts]: Start accepts. Automaton has 99913 states and 128010 transitions. Word has length 178 [2019-09-10 06:14:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:34,235 INFO L475 AbstractCegarLoop]: Abstraction has 99913 states and 128010 transitions. [2019-09-10 06:14:34,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 06:14:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 99913 states and 128010 transitions. [2019-09-10 06:14:34,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:14:34,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:34,278 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 06:14:34,279 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:34,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:34,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1947737587, now seen corresponding path program 1 times [2019-09-10 06:14:34,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:34,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:34,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:34,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:34,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:34,340 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 06:14:34,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:34,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:34,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:34,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:34,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:34,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:34,342 INFO L87 Difference]: Start difference. First operand 99913 states and 128010 transitions. Second operand 3 states. [2019-09-10 06:14:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:34,660 INFO L93 Difference]: Finished difference Result 103604 states and 135090 transitions. [2019-09-10 06:14:34,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:34,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 06:14:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:34,752 INFO L225 Difference]: With dead ends: 103604 [2019-09-10 06:14:34,752 INFO L226 Difference]: Without dead ends: 103604 [2019-09-10 06:14:34,753 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 06:14:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103604 states. [2019-09-10 06:14:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103604 to 88663. [2019-09-10 06:14:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88663 states. [2019-09-10 06:14:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88663 states to 88663 states and 114325 transitions. [2019-09-10 06:14:35,585 INFO L78 Accepts]: Start accepts. Automaton has 88663 states and 114325 transitions. Word has length 179 [2019-09-10 06:14:35,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:35,585 INFO L475 AbstractCegarLoop]: Abstraction has 88663 states and 114325 transitions. [2019-09-10 06:14:35,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 88663 states and 114325 transitions. [2019-09-10 06:14:35,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:14:35,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:35,619 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 06:14:35,619 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:35,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:35,620 INFO L82 PathProgramCache]: Analyzing trace with hash -139488842, now seen corresponding path program 1 times [2019-09-10 06:14:35,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:35,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:35,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:35,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:35,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:35,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 06:14:35,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:35,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:35,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:35,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:35,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:35,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:35,674 INFO L87 Difference]: Start difference. First operand 88663 states and 114325 transitions. Second operand 3 states. [2019-09-10 06:14:35,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:35,913 INFO L93 Difference]: Finished difference Result 85944 states and 110408 transitions. [2019-09-10 06:14:35,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:35,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 06:14:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:35,982 INFO L225 Difference]: With dead ends: 85944 [2019-09-10 06:14:35,982 INFO L226 Difference]: Without dead ends: 85944 [2019-09-10 06:14:35,982 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 06:14:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85944 states. [2019-09-10 06:14:37,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85944 to 85112. [2019-09-10 06:14:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85112 states. [2019-09-10 06:14:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85112 states to 85112 states and 109576 transitions. [2019-09-10 06:14:37,100 INFO L78 Accepts]: Start accepts. Automaton has 85112 states and 109576 transitions. Word has length 179 [2019-09-10 06:14:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:37,101 INFO L475 AbstractCegarLoop]: Abstraction has 85112 states and 109576 transitions. [2019-09-10 06:14:37,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 85112 states and 109576 transitions. [2019-09-10 06:14:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:14:37,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:37,133 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 06:14:37,133 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:37,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:37,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1082551273, now seen corresponding path program 1 times [2019-09-10 06:14:37,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:37,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:37,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:37,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:37,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:37,205 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 06:14:37,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:37,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:37,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:37,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:37,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:37,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:37,206 INFO L87 Difference]: Start difference. First operand 85112 states and 109576 transitions. Second operand 3 states. [2019-09-10 06:14:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:37,521 INFO L93 Difference]: Finished difference Result 80695 states and 103632 transitions. [2019-09-10 06:14:37,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:37,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 06:14:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:37,612 INFO L225 Difference]: With dead ends: 80695 [2019-09-10 06:14:37,612 INFO L226 Difference]: Without dead ends: 80695 [2019-09-10 06:14:37,613 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 06:14:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80695 states. [2019-09-10 06:14:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80695 to 74052. [2019-09-10 06:14:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74052 states. [2019-09-10 06:14:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74052 states to 74052 states and 94802 transitions. [2019-09-10 06:14:39,052 INFO L78 Accepts]: Start accepts. Automaton has 74052 states and 94802 transitions. Word has length 179 [2019-09-10 06:14:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:39,052 INFO L475 AbstractCegarLoop]: Abstraction has 74052 states and 94802 transitions. [2019-09-10 06:14:39,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 74052 states and 94802 transitions. [2019-09-10 06:14:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:14:39,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:39,077 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 06:14:39,077 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash -960074043, now seen corresponding path program 1 times [2019-09-10 06:14:39,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:39,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:39,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:39,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:39,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:39,164 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 06:14:39,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:39,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:39,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:39,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:39,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:39,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:39,165 INFO L87 Difference]: Start difference. First operand 74052 states and 94802 transitions. Second operand 3 states. [2019-09-10 06:14:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:39,301 INFO L93 Difference]: Finished difference Result 74551 states and 94917 transitions. [2019-09-10 06:14:39,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:39,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 06:14:39,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:39,360 INFO L225 Difference]: With dead ends: 74551 [2019-09-10 06:14:39,360 INFO L226 Difference]: Without dead ends: 73874 [2019-09-10 06:14:39,360 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 06:14:39,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73874 states. [2019-09-10 06:14:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73874 to 73795. [2019-09-10 06:14:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73795 states. [2019-09-10 06:14:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73795 states to 73795 states and 94118 transitions. [2019-09-10 06:14:39,967 INFO L78 Accepts]: Start accepts. Automaton has 73795 states and 94118 transitions. Word has length 179 [2019-09-10 06:14:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:39,967 INFO L475 AbstractCegarLoop]: Abstraction has 73795 states and 94118 transitions. [2019-09-10 06:14:39,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 73795 states and 94118 transitions. [2019-09-10 06:14:39,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:14:39,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:39,995 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 06:14:39,995 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:39,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:39,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1050432566, now seen corresponding path program 1 times [2019-09-10 06:14:39,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:39,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:39,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:39,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:39,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:40,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:40,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:40,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:40,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:40,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:40,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:40,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:40,048 INFO L87 Difference]: Start difference. First operand 73795 states and 94118 transitions. Second operand 3 states. [2019-09-10 06:14:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:40,270 INFO L93 Difference]: Finished difference Result 73260 states and 94440 transitions. [2019-09-10 06:14:40,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:40,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 06:14:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:40,334 INFO L225 Difference]: With dead ends: 73260 [2019-09-10 06:14:40,334 INFO L226 Difference]: Without dead ends: 72670 [2019-09-10 06:14:40,334 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 06:14:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72670 states. [2019-09-10 06:14:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72670 to 65303. [2019-09-10 06:14:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65303 states. [2019-09-10 06:14:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65303 states to 65303 states and 83959 transitions. [2019-09-10 06:14:41,340 INFO L78 Accepts]: Start accepts. Automaton has 65303 states and 83959 transitions. Word has length 179 [2019-09-10 06:14:41,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:41,341 INFO L475 AbstractCegarLoop]: Abstraction has 65303 states and 83959 transitions. [2019-09-10 06:14:41,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 65303 states and 83959 transitions. [2019-09-10 06:14:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:14:41,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:41,363 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 06:14:41,364 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:41,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:41,364 INFO L82 PathProgramCache]: Analyzing trace with hash -294131191, now seen corresponding path program 1 times [2019-09-10 06:14:41,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:41,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:41,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:41,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:41,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:41,422 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 06:14:41,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:41,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:41,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:41,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:41,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:41,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:41,424 INFO L87 Difference]: Start difference. First operand 65303 states and 83959 transitions. Second operand 3 states. [2019-09-10 06:14:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:41,640 INFO L93 Difference]: Finished difference Result 74868 states and 97204 transitions. [2019-09-10 06:14:41,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:41,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 06:14:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:41,704 INFO L225 Difference]: With dead ends: 74868 [2019-09-10 06:14:41,705 INFO L226 Difference]: Without dead ends: 74868 [2019-09-10 06:14:41,705 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 06:14:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74868 states. [2019-09-10 06:14:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74868 to 61306. [2019-09-10 06:14:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61306 states. [2019-09-10 06:14:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61306 states to 61306 states and 78886 transitions. [2019-09-10 06:14:42,243 INFO L78 Accepts]: Start accepts. Automaton has 61306 states and 78886 transitions. Word has length 179 [2019-09-10 06:14:42,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:42,243 INFO L475 AbstractCegarLoop]: Abstraction has 61306 states and 78886 transitions. [2019-09-10 06:14:42,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 61306 states and 78886 transitions. [2019-09-10 06:14:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:14:42,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:42,261 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 06:14:42,262 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:42,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:42,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1537258815, now seen corresponding path program 1 times [2019-09-10 06:14:42,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:42,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:42,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:42,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:42,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:42,327 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 06:14:42,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:42,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:42,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:42,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:42,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:42,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:42,329 INFO L87 Difference]: Start difference. First operand 61306 states and 78886 transitions. Second operand 3 states. [2019-09-10 06:14:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:42,476 INFO L93 Difference]: Finished difference Result 51115 states and 65113 transitions. [2019-09-10 06:14:42,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:42,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 06:14:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:42,521 INFO L225 Difference]: With dead ends: 51115 [2019-09-10 06:14:42,521 INFO L226 Difference]: Without dead ends: 51115 [2019-09-10 06:14:42,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 06:14:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51115 states. [2019-09-10 06:14:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51115 to 50469. [2019-09-10 06:14:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50469 states. [2019-09-10 06:14:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50469 states to 50469 states and 64467 transitions. [2019-09-10 06:14:42,927 INFO L78 Accepts]: Start accepts. Automaton has 50469 states and 64467 transitions. Word has length 179 [2019-09-10 06:14:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:42,927 INFO L475 AbstractCegarLoop]: Abstraction has 50469 states and 64467 transitions. [2019-09-10 06:14:42,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 50469 states and 64467 transitions. [2019-09-10 06:14:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 06:14:42,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:42,941 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 06:14:42,941 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:42,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash 622153266, now seen corresponding path program 1 times [2019-09-10 06:14:42,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:42,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:42,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:42,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:42,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:43,005 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 06:14:43,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:43,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:43,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:43,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:43,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:43,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:43,006 INFO L87 Difference]: Start difference. First operand 50469 states and 64467 transitions. Second operand 3 states. [2019-09-10 06:14:43,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:43,103 INFO L93 Difference]: Finished difference Result 47613 states and 60833 transitions. [2019-09-10 06:14:43,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:43,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 06:14:43,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:43,139 INFO L225 Difference]: With dead ends: 47613 [2019-09-10 06:14:43,140 INFO L226 Difference]: Without dead ends: 47613 [2019-09-10 06:14:43,140 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 06:14:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47613 states. [2019-09-10 06:14:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47613 to 47500. [2019-09-10 06:14:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47500 states. [2019-09-10 06:14:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47500 states to 47500 states and 60718 transitions. [2019-09-10 06:14:43,657 INFO L78 Accepts]: Start accepts. Automaton has 47500 states and 60718 transitions. Word has length 183 [2019-09-10 06:14:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:43,657 INFO L475 AbstractCegarLoop]: Abstraction has 47500 states and 60718 transitions. [2019-09-10 06:14:43,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 47500 states and 60718 transitions. [2019-09-10 06:14:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 06:14:43,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:43,669 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 06:14:43,670 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:43,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:43,670 INFO L82 PathProgramCache]: Analyzing trace with hash 385140671, now seen corresponding path program 1 times [2019-09-10 06:14:43,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:43,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:43,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:43,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:43,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:43,719 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 06:14:43,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:43,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:43,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:43,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:43,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:43,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:43,720 INFO L87 Difference]: Start difference. First operand 47500 states and 60718 transitions. Second operand 3 states. [2019-09-10 06:14:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:43,809 INFO L93 Difference]: Finished difference Result 44429 states and 56824 transitions. [2019-09-10 06:14:43,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:43,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 06:14:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:43,843 INFO L225 Difference]: With dead ends: 44429 [2019-09-10 06:14:43,843 INFO L226 Difference]: Without dead ends: 44429 [2019-09-10 06:14:43,843 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 06:14:43,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44429 states. [2019-09-10 06:14:44,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44429 to 44335. [2019-09-10 06:14:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44335 states. [2019-09-10 06:14:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44335 states to 44335 states and 56726 transitions. [2019-09-10 06:14:44,187 INFO L78 Accepts]: Start accepts. Automaton has 44335 states and 56726 transitions. Word has length 183 [2019-09-10 06:14:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:44,187 INFO L475 AbstractCegarLoop]: Abstraction has 44335 states and 56726 transitions. [2019-09-10 06:14:44,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 44335 states and 56726 transitions. [2019-09-10 06:14:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 06:14:44,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:44,199 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 06:14:44,199 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:44,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:44,199 INFO L82 PathProgramCache]: Analyzing trace with hash 844299991, now seen corresponding path program 1 times [2019-09-10 06:14:44,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:44,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:44,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:44,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:44,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:44,257 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 06:14:44,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:44,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:44,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:44,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:44,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:44,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:44,258 INFO L87 Difference]: Start difference. First operand 44335 states and 56726 transitions. Second operand 3 states. [2019-09-10 06:14:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:44,356 INFO L93 Difference]: Finished difference Result 43704 states and 55582 transitions. [2019-09-10 06:14:44,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:44,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 06:14:44,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:44,391 INFO L225 Difference]: With dead ends: 43704 [2019-09-10 06:14:44,391 INFO L226 Difference]: Without dead ends: 43704 [2019-09-10 06:14:44,392 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 06:14:44,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43704 states. [2019-09-10 06:14:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43704 to 43662. [2019-09-10 06:14:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43662 states. [2019-09-10 06:14:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43662 states to 43662 states and 55540 transitions. [2019-09-10 06:14:44,726 INFO L78 Accepts]: Start accepts. Automaton has 43662 states and 55540 transitions. Word has length 183 [2019-09-10 06:14:44,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:44,727 INFO L475 AbstractCegarLoop]: Abstraction has 43662 states and 55540 transitions. [2019-09-10 06:14:44,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:44,727 INFO L276 IsEmpty]: Start isEmpty. Operand 43662 states and 55540 transitions. [2019-09-10 06:14:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 06:14:44,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:44,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, 1, 1, 1, 1] [2019-09-10 06:14:44,737 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:44,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:44,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1675099224, now seen corresponding path program 1 times [2019-09-10 06:14:44,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:44,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:44,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:44,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:44,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:44,786 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 06:14:44,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:44,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:44,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:44,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:44,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:44,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:44,788 INFO L87 Difference]: Start difference. First operand 43662 states and 55540 transitions. Second operand 3 states. [2019-09-10 06:14:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:44,872 INFO L93 Difference]: Finished difference Result 42178 states and 53433 transitions. [2019-09-10 06:14:44,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:44,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 06:14:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:44,905 INFO L225 Difference]: With dead ends: 42178 [2019-09-10 06:14:44,905 INFO L226 Difference]: Without dead ends: 42172 [2019-09-10 06:14:44,905 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 06:14:44,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42172 states. [2019-09-10 06:14:45,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42172 to 42170. [2019-09-10 06:14:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42170 states. [2019-09-10 06:14:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42170 states to 42170 states and 53426 transitions. [2019-09-10 06:14:45,352 INFO L78 Accepts]: Start accepts. Automaton has 42170 states and 53426 transitions. Word has length 183 [2019-09-10 06:14:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:45,352 INFO L475 AbstractCegarLoop]: Abstraction has 42170 states and 53426 transitions. [2019-09-10 06:14:45,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 42170 states and 53426 transitions. [2019-09-10 06:14:45,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 06:14:45,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:45,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:45,362 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:45,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:45,362 INFO L82 PathProgramCache]: Analyzing trace with hash -185803181, now seen corresponding path program 1 times [2019-09-10 06:14:45,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:45,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:45,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:45,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:45,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:45,424 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 06:14:45,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:45,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:45,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:45,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:45,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:45,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:45,426 INFO L87 Difference]: Start difference. First operand 42170 states and 53426 transitions. Second operand 3 states. [2019-09-10 06:14:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:45,503 INFO L93 Difference]: Finished difference Result 38164 states and 48228 transitions. [2019-09-10 06:14:45,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:45,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 06:14:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:45,531 INFO L225 Difference]: With dead ends: 38164 [2019-09-10 06:14:45,531 INFO L226 Difference]: Without dead ends: 38164 [2019-09-10 06:14:45,532 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 06:14:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38164 states. [2019-09-10 06:14:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38164 to 38162. [2019-09-10 06:14:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38162 states. [2019-09-10 06:14:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38162 states to 38162 states and 48227 transitions. [2019-09-10 06:14:45,809 INFO L78 Accepts]: Start accepts. Automaton has 38162 states and 48227 transitions. Word has length 183 [2019-09-10 06:14:45,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:45,809 INFO L475 AbstractCegarLoop]: Abstraction has 38162 states and 48227 transitions. [2019-09-10 06:14:45,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 38162 states and 48227 transitions. [2019-09-10 06:14:45,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:14:45,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:45,818 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 06:14:45,818 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:45,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:45,818 INFO L82 PathProgramCache]: Analyzing trace with hash 412239684, now seen corresponding path program 1 times [2019-09-10 06:14:45,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:45,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:45,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:45,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:45,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:47,615 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 06:14:47,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:47,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 06:14:47,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:47,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 06:14:47,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 06:14:47,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:14:47,617 INFO L87 Difference]: Start difference. First operand 38162 states and 48227 transitions. Second operand 27 states. [2019-09-10 06:14:48,404 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:14:48,618 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 06:14:49,508 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 06:14:51,545 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 06:14:52,290 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 06:14:55,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:55,033 INFO L93 Difference]: Finished difference Result 57103 states and 74034 transitions. [2019-09-10 06:14:55,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:14:55,033 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 184 [2019-09-10 06:14:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:55,084 INFO L225 Difference]: With dead ends: 57103 [2019-09-10 06:14:55,084 INFO L226 Difference]: Without dead ends: 57103 [2019-09-10 06:14:55,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=493, Invalid=1859, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:14:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57103 states. [2019-09-10 06:14:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57103 to 36636. [2019-09-10 06:14:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36636 states. [2019-09-10 06:14:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36636 states to 36636 states and 46077 transitions. [2019-09-10 06:14:55,450 INFO L78 Accepts]: Start accepts. Automaton has 36636 states and 46077 transitions. Word has length 184 [2019-09-10 06:14:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:55,451 INFO L475 AbstractCegarLoop]: Abstraction has 36636 states and 46077 transitions. [2019-09-10 06:14:55,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 06:14:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 36636 states and 46077 transitions. [2019-09-10 06:14:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:14:55,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:55,459 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 06:14:55,459 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:55,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:55,460 INFO L82 PathProgramCache]: Analyzing trace with hash 860850563, now seen corresponding path program 1 times [2019-09-10 06:14:55,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:55,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:55,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:55,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:55,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:57,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 06:14:57,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:57,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:14:57,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:57,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:14:57,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:14:57,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:14:57,009 INFO L87 Difference]: Start difference. First operand 36636 states and 46077 transitions. Second operand 26 states. [2019-09-10 06:14:57,910 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-10 06:14:58,060 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 06:14:58,316 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 06:14:58,584 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 06:14:59,119 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-10 06:14:59,474 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-09-10 06:14:59,779 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:14:59,977 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:15:00,151 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-09-10 06:15:00,475 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 06:15:00,725 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 06:15:01,012 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 06:15:01,609 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:15:01,839 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 06:15:02,490 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 06:15:02,688 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 06:15:03,161 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-09-10 06:15:03,859 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-09-10 06:15:04,342 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-09-10 06:15:04,627 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 06:15:04,889 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 06:15:05,801 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-09-10 06:15:05,997 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:15:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:07,880 INFO L93 Difference]: Finished difference Result 49481 states and 63814 transitions. [2019-09-10 06:15:07,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:15:07,880 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 184 [2019-09-10 06:15:07,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:07,925 INFO L225 Difference]: With dead ends: 49481 [2019-09-10 06:15:07,925 INFO L226 Difference]: Without dead ends: 49481 [2019-09-10 06:15:07,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=566, Invalid=2190, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 06:15:07,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49481 states. [2019-09-10 06:15:08,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49481 to 36250. [2019-09-10 06:15:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36250 states. [2019-09-10 06:15:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36250 states to 36250 states and 45509 transitions. [2019-09-10 06:15:08,270 INFO L78 Accepts]: Start accepts. Automaton has 36250 states and 45509 transitions. Word has length 184 [2019-09-10 06:15:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:08,270 INFO L475 AbstractCegarLoop]: Abstraction has 36250 states and 45509 transitions. [2019-09-10 06:15:08,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:15:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 36250 states and 45509 transitions. [2019-09-10 06:15:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:15:08,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:08,279 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 06:15:08,279 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:08,280 INFO L82 PathProgramCache]: Analyzing trace with hash 859453805, now seen corresponding path program 1 times [2019-09-10 06:15:08,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:08,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:08,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:08,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:08,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:09,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:09,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:09,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:15:09,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:09,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:15:09,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:15:09,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:15:09,444 INFO L87 Difference]: Start difference. First operand 36250 states and 45509 transitions. Second operand 23 states. [2019-09-10 06:15:09,595 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:15:10,743 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 06:15:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:19,001 INFO L93 Difference]: Finished difference Result 42567 states and 53624 transitions. [2019-09-10 06:15:19,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 06:15:19,002 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 184 [2019-09-10 06:15:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:19,031 INFO L225 Difference]: With dead ends: 42567 [2019-09-10 06:15:19,032 INFO L226 Difference]: Without dead ends: 42567 [2019-09-10 06:15:19,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1464 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=915, Invalid=5247, Unknown=0, NotChecked=0, Total=6162 [2019-09-10 06:15:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42567 states. [2019-09-10 06:15:19,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42567 to 36558. [2019-09-10 06:15:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36558 states. [2019-09-10 06:15:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36558 states to 36558 states and 45833 transitions. [2019-09-10 06:15:19,309 INFO L78 Accepts]: Start accepts. Automaton has 36558 states and 45833 transitions. Word has length 184 [2019-09-10 06:15:19,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:19,310 INFO L475 AbstractCegarLoop]: Abstraction has 36558 states and 45833 transitions. [2019-09-10 06:15:19,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:15:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 36558 states and 45833 transitions. [2019-09-10 06:15:19,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:15:19,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:19,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:19,319 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:19,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:19,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2129754843, now seen corresponding path program 1 times [2019-09-10 06:15:19,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:19,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:19,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:19,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:19,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:20,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:20,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:15:20,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:20,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:15:20,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:15:20,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:15:20,253 INFO L87 Difference]: Start difference. First operand 36558 states and 45833 transitions. Second operand 16 states. [2019-09-10 06:15:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:21,834 INFO L93 Difference]: Finished difference Result 35204 states and 44016 transitions. [2019-09-10 06:15:21,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:15:21,835 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 184 [2019-09-10 06:15:21,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:21,861 INFO L225 Difference]: With dead ends: 35204 [2019-09-10 06:15:21,861 INFO L226 Difference]: Without dead ends: 34288 [2019-09-10 06:15:21,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:15:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34288 states. [2019-09-10 06:15:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34288 to 33464. [2019-09-10 06:15:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33464 states. [2019-09-10 06:15:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33464 states to 33464 states and 41964 transitions. [2019-09-10 06:15:22,112 INFO L78 Accepts]: Start accepts. Automaton has 33464 states and 41964 transitions. Word has length 184 [2019-09-10 06:15:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:22,112 INFO L475 AbstractCegarLoop]: Abstraction has 33464 states and 41964 transitions. [2019-09-10 06:15:22,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:15:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 33464 states and 41964 transitions. [2019-09-10 06:15:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:15:22,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:22,120 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 06:15:22,121 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:22,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:22,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1137358172, now seen corresponding path program 1 times [2019-09-10 06:15:22,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:22,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:22,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:22,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:22,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:23,261 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 06:15:23,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:23,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:15:23,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:23,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:15:23,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:15:23,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:15:23,262 INFO L87 Difference]: Start difference. First operand 33464 states and 41964 transitions. Second operand 22 states. [2019-09-10 06:15:24,174 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 06:15:24,328 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:15:24,519 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 06:15:24,858 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 06:15:25,061 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 06:15:25,249 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:15:25,475 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-10 06:15:25,734 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 06:15:26,090 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 06:15:26,374 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 06:15:26,644 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 06:15:26,824 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 06:15:27,092 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 06:15:29,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:29,889 INFO L93 Difference]: Finished difference Result 53746 states and 69892 transitions. [2019-09-10 06:15:29,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:15:29,890 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 184 [2019-09-10 06:15:29,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:29,938 INFO L225 Difference]: With dead ends: 53746 [2019-09-10 06:15:29,938 INFO L226 Difference]: Without dead ends: 53746 [2019-09-10 06:15:29,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=421, Invalid=1301, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:15:29,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53746 states. [2019-09-10 06:15:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53746 to 32511. [2019-09-10 06:15:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32511 states. [2019-09-10 06:15:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32511 states to 32511 states and 40807 transitions. [2019-09-10 06:15:30,289 INFO L78 Accepts]: Start accepts. Automaton has 32511 states and 40807 transitions. Word has length 184 [2019-09-10 06:15:30,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:30,289 INFO L475 AbstractCegarLoop]: Abstraction has 32511 states and 40807 transitions. [2019-09-10 06:15:30,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:15:30,289 INFO L276 IsEmpty]: Start isEmpty. Operand 32511 states and 40807 transitions. [2019-09-10 06:15:30,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:15:30,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:30,297 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 06:15:30,298 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:30,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:30,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2044986648, now seen corresponding path program 1 times [2019-09-10 06:15:30,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:30,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:30,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:30,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:30,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:31,655 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 06:15:31,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:31,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-09-10 06:15:31,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:31,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 06:15:31,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 06:15:31,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:15:31,657 INFO L87 Difference]: Start difference. First operand 32511 states and 40807 transitions. Second operand 29 states. [2019-09-10 06:15:31,872 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:15:33,447 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 06:15:34,965 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 06:15:35,215 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:15:35,492 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:15:35,728 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 06:15:36,262 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 06:15:36,599 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-10 06:15:37,289 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 06:15:37,708 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 06:15:38,148 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 06:15:38,305 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 06:15:38,553 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:15:39,167 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:15:39,484 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:15:39,966 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:15:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:41,785 INFO L93 Difference]: Finished difference Result 31833 states and 39825 transitions. [2019-09-10 06:15:41,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 06:15:41,786 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 184 [2019-09-10 06:15:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:41,810 INFO L225 Difference]: With dead ends: 31833 [2019-09-10 06:15:41,810 INFO L226 Difference]: Without dead ends: 31833 [2019-09-10 06:15:41,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=650, Invalid=3010, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 06:15:41,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31833 states. [2019-09-10 06:15:42,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31833 to 31178. [2019-09-10 06:15:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31178 states. [2019-09-10 06:15:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31178 states to 31178 states and 38958 transitions. [2019-09-10 06:15:42,043 INFO L78 Accepts]: Start accepts. Automaton has 31178 states and 38958 transitions. Word has length 184 [2019-09-10 06:15:42,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:42,044 INFO L475 AbstractCegarLoop]: Abstraction has 31178 states and 38958 transitions. [2019-09-10 06:15:42,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 06:15:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 31178 states and 38958 transitions. [2019-09-10 06:15:42,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:15:42,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:42,052 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 06:15:42,053 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:42,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:42,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1278388398, now seen corresponding path program 1 times [2019-09-10 06:15:42,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:42,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:42,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:42,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:42,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:42,736 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 06:15:42,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:42,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 06:15:42,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:42,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:15:42,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:15:42,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:15:42,737 INFO L87 Difference]: Start difference. First operand 31178 states and 38958 transitions. Second operand 20 states. [2019-09-10 06:15:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:46,183 INFO L93 Difference]: Finished difference Result 56744 states and 73808 transitions. [2019-09-10 06:15:46,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 06:15:46,184 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 184 [2019-09-10 06:15:46,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:46,235 INFO L225 Difference]: With dead ends: 56744 [2019-09-10 06:15:46,235 INFO L226 Difference]: Without dead ends: 56401 [2019-09-10 06:15:46,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=581, Invalid=2611, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 06:15:46,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56401 states. [2019-09-10 06:15:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56401 to 31117. [2019-09-10 06:15:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31117 states. [2019-09-10 06:15:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31117 states to 31117 states and 38880 transitions. [2019-09-10 06:15:46,585 INFO L78 Accepts]: Start accepts. Automaton has 31117 states and 38880 transitions. Word has length 184 [2019-09-10 06:15:46,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:46,585 INFO L475 AbstractCegarLoop]: Abstraction has 31117 states and 38880 transitions. [2019-09-10 06:15:46,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:15:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 31117 states and 38880 transitions. [2019-09-10 06:15:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:15:46,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:46,594 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 06:15:46,594 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:46,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:46,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1337854647, now seen corresponding path program 1 times [2019-09-10 06:15:46,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:46,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:46,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:46,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:46,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:47,933 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 06:15:47,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:47,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 06:15:47,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:47,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:15:47,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:15:47,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:15:47,934 INFO L87 Difference]: Start difference. First operand 31117 states and 38880 transitions. Second operand 24 states. [2019-09-10 06:15:48,529 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 06:15:48,723 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 06:15:49,039 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-10 06:15:49,280 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-09-10 06:15:49,594 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-09-10 06:15:49,895 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-09-10 06:15:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:53,449 INFO L93 Difference]: Finished difference Result 44616 states and 57620 transitions. [2019-09-10 06:15:53,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:15:53,450 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 184 [2019-09-10 06:15:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:53,487 INFO L225 Difference]: With dead ends: 44616 [2019-09-10 06:15:53,487 INFO L226 Difference]: Without dead ends: 44616 [2019-09-10 06:15:53,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=277, Invalid=1205, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:15:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44616 states. [2019-09-10 06:15:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44616 to 30227. [2019-09-10 06:15:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30227 states. [2019-09-10 06:15:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30227 states to 30227 states and 37698 transitions. [2019-09-10 06:15:53,771 INFO L78 Accepts]: Start accepts. Automaton has 30227 states and 37698 transitions. Word has length 184 [2019-09-10 06:15:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:53,771 INFO L475 AbstractCegarLoop]: Abstraction has 30227 states and 37698 transitions. [2019-09-10 06:15:53,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:15:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 30227 states and 37698 transitions. [2019-09-10 06:15:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:15:53,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:53,779 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 06:15:53,779 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:53,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:53,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1039382443, now seen corresponding path program 1 times [2019-09-10 06:15:53,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:53,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:53,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:53,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:53,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:54,733 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 06:15:54,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:54,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:15:54,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:54,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:15:54,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:15:54,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:15:54,734 INFO L87 Difference]: Start difference. First operand 30227 states and 37698 transitions. Second operand 21 states. [2019-09-10 06:15:55,792 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-10 06:15:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:59,371 INFO L93 Difference]: Finished difference Result 32790 states and 41159 transitions. [2019-09-10 06:15:59,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:15:59,371 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 184 [2019-09-10 06:15:59,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:59,396 INFO L225 Difference]: With dead ends: 32790 [2019-09-10 06:15:59,397 INFO L226 Difference]: Without dead ends: 32790 [2019-09-10 06:15:59,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=394, Invalid=1412, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:15:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32790 states. [2019-09-10 06:15:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32790 to 28710. [2019-09-10 06:15:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28710 states. [2019-09-10 06:15:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28710 states to 28710 states and 35794 transitions. [2019-09-10 06:15:59,730 INFO L78 Accepts]: Start accepts. Automaton has 28710 states and 35794 transitions. Word has length 184 [2019-09-10 06:15:59,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:59,730 INFO L475 AbstractCegarLoop]: Abstraction has 28710 states and 35794 transitions. [2019-09-10 06:15:59,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:15:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 28710 states and 35794 transitions. [2019-09-10 06:15:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:15:59,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:59,738 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 06:15:59,738 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:59,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:59,738 INFO L82 PathProgramCache]: Analyzing trace with hash 483727183, now seen corresponding path program 1 times [2019-09-10 06:15:59,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:59,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:59,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:59,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:59,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:00,327 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 06:16:00,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:00,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:16:00,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:00,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:16:00,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:16:00,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:16:00,329 INFO L87 Difference]: Start difference. First operand 28710 states and 35794 transitions. Second operand 19 states. [2019-09-10 06:16:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:02,949 INFO L93 Difference]: Finished difference Result 29778 states and 37061 transitions. [2019-09-10 06:16:02,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:16:02,950 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 184 [2019-09-10 06:16:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:02,972 INFO L225 Difference]: With dead ends: 29778 [2019-09-10 06:16:02,972 INFO L226 Difference]: Without dead ends: 29778 [2019-09-10 06:16:02,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:16:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29778 states. [2019-09-10 06:16:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29778 to 28315. [2019-09-10 06:16:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28315 states. [2019-09-10 06:16:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28315 states to 28315 states and 35137 transitions. [2019-09-10 06:16:03,189 INFO L78 Accepts]: Start accepts. Automaton has 28315 states and 35137 transitions. Word has length 184 [2019-09-10 06:16:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:03,189 INFO L475 AbstractCegarLoop]: Abstraction has 28315 states and 35137 transitions. [2019-09-10 06:16:03,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:16:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 28315 states and 35137 transitions. [2019-09-10 06:16:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:16:03,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:03,197 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:03,197 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:03,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:03,198 INFO L82 PathProgramCache]: Analyzing trace with hash -35885948, now seen corresponding path program 1 times [2019-09-10 06:16:03,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:03,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:03,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:03,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:03,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:04,114 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 41 [2019-09-10 06:16:04,938 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 06:16:04,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:04,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:16:04,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:04,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:16:04,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:16:04,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:16:04,939 INFO L87 Difference]: Start difference. First operand 28315 states and 35137 transitions. Second operand 26 states. [2019-09-10 06:16:05,905 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 06:16:06,228 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 06:16:06,598 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 06:16:07,047 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 06:16:07,350 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2019-09-10 06:16:07,564 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 06:16:07,962 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 06:16:08,184 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 06:16:08,592 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 06:16:09,879 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-09-10 06:16:10,053 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 06:16:10,459 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 06:16:11,379 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 06:16:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:12,897 INFO L93 Difference]: Finished difference Result 27737 states and 34305 transitions. [2019-09-10 06:16:12,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:16:12,897 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 184 [2019-09-10 06:16:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:12,917 INFO L225 Difference]: With dead ends: 27737 [2019-09-10 06:16:12,918 INFO L226 Difference]: Without dead ends: 27737 [2019-09-10 06:16:12,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=474, Invalid=1976, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:16:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27737 states. [2019-09-10 06:16:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27737 to 27725. [2019-09-10 06:16:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27725 states. [2019-09-10 06:16:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27725 states to 27725 states and 34295 transitions. [2019-09-10 06:16:13,121 INFO L78 Accepts]: Start accepts. Automaton has 27725 states and 34295 transitions. Word has length 184 [2019-09-10 06:16:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:13,121 INFO L475 AbstractCegarLoop]: Abstraction has 27725 states and 34295 transitions. [2019-09-10 06:16:13,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:16:13,121 INFO L276 IsEmpty]: Start isEmpty. Operand 27725 states and 34295 transitions. [2019-09-10 06:16:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:16:13,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:13,129 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 06:16:13,129 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:13,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash 412724931, now seen corresponding path program 1 times [2019-09-10 06:16:13,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:13,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:13,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:14,811 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 06:16:14,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:14,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:16:14,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:14,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:16:14,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:16:14,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:16:14,814 INFO L87 Difference]: Start difference. First operand 27725 states and 34295 transitions. Second operand 22 states. [2019-09-10 06:16:15,152 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 97 [2019-09-10 06:16:16,738 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 06:16:16,884 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-09-10 06:16:17,089 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-10 06:16:17,423 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 06:16:17,717 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-09-10 06:16:18,188 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-09-10 06:16:18,676 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2019-09-10 06:16:19,200 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 06:16:19,539 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 06:16:20,023 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 06:16:20,385 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-10 06:16:21,148 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 06:16:21,376 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-10 06:16:22,246 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2019-09-10 06:16:22,436 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2019-09-10 06:16:22,726 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2019-09-10 06:16:23,666 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2019-09-10 06:16:24,041 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2019-09-10 06:16:24,484 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2019-09-10 06:16:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:26,278 INFO L93 Difference]: Finished difference Result 32683 states and 40802 transitions. [2019-09-10 06:16:26,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:16:26,279 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 184 [2019-09-10 06:16:26,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:26,304 INFO L225 Difference]: With dead ends: 32683 [2019-09-10 06:16:26,304 INFO L226 Difference]: Without dead ends: 32683 [2019-09-10 06:16:26,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=446, Invalid=1446, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 06:16:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32683 states. [2019-09-10 06:16:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32683 to 27725. [2019-09-10 06:16:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27725 states. [2019-09-10 06:16:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27725 states to 27725 states and 34292 transitions. [2019-09-10 06:16:26,529 INFO L78 Accepts]: Start accepts. Automaton has 27725 states and 34292 transitions. Word has length 184 [2019-09-10 06:16:26,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:26,530 INFO L475 AbstractCegarLoop]: Abstraction has 27725 states and 34292 transitions. [2019-09-10 06:16:26,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:16:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 27725 states and 34292 transitions. [2019-09-10 06:16:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:16:26,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:26,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:26,538 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash -634445658, now seen corresponding path program 1 times [2019-09-10 06:16:26,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:26,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:26,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:26,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:26,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:27,313 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 06:16:27,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:27,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 06:16:27,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:27,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:16:27,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:16:27,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:16:27,314 INFO L87 Difference]: Start difference. First operand 27725 states and 34292 transitions. Second operand 20 states. [2019-09-10 06:16:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:31,365 INFO L93 Difference]: Finished difference Result 45988 states and 59509 transitions. [2019-09-10 06:16:31,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:16:31,365 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 184 [2019-09-10 06:16:31,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:31,403 INFO L225 Difference]: With dead ends: 45988 [2019-09-10 06:16:31,403 INFO L226 Difference]: Without dead ends: 45811 [2019-09-10 06:16:31,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=310, Invalid=1172, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:16:31,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45811 states. [2019-09-10 06:16:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45811 to 26850. [2019-09-10 06:16:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26850 states. [2019-09-10 06:16:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26850 states to 26850 states and 33152 transitions. [2019-09-10 06:16:31,676 INFO L78 Accepts]: Start accepts. Automaton has 26850 states and 33152 transitions. Word has length 184 [2019-09-10 06:16:31,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:31,677 INFO L475 AbstractCegarLoop]: Abstraction has 26850 states and 33152 transitions. [2019-09-10 06:16:31,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:16:31,677 INFO L276 IsEmpty]: Start isEmpty. Operand 26850 states and 33152 transitions. [2019-09-10 06:16:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:16:31,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:31,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] [2019-09-10 06:16:31,685 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:31,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:31,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1283489322, now seen corresponding path program 1 times [2019-09-10 06:16:31,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:31,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:31,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:31,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:31,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:31,800 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 06:16:31,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:31,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:16:31,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:31,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:16:31,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:16:31,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:16:31,801 INFO L87 Difference]: Start difference. First operand 26850 states and 33152 transitions. Second operand 6 states. [2019-09-10 06:16:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:32,018 INFO L93 Difference]: Finished difference Result 31822 states and 39854 transitions. [2019-09-10 06:16:32,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:16:32,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2019-09-10 06:16:32,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:32,042 INFO L225 Difference]: With dead ends: 31822 [2019-09-10 06:16:32,042 INFO L226 Difference]: Without dead ends: 31822 [2019-09-10 06:16:32,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:16:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31822 states. [2019-09-10 06:16:32,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31822 to 27743. [2019-09-10 06:16:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27743 states. [2019-09-10 06:16:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27743 states to 27743 states and 34236 transitions. [2019-09-10 06:16:32,262 INFO L78 Accepts]: Start accepts. Automaton has 27743 states and 34236 transitions. Word has length 184 [2019-09-10 06:16:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:32,263 INFO L475 AbstractCegarLoop]: Abstraction has 27743 states and 34236 transitions. [2019-09-10 06:16:32,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:16:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 27743 states and 34236 transitions. [2019-09-10 06:16:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:16:32,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:32,270 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 06:16:32,270 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:32,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:32,270 INFO L82 PathProgramCache]: Analyzing trace with hash 960150908, now seen corresponding path program 1 times [2019-09-10 06:16:32,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:32,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:32,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:32,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:32,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:32,421 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 06:16:32,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:32,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:16:32,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:32,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:16:32,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:16:32,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:16:32,422 INFO L87 Difference]: Start difference. First operand 27743 states and 34236 transitions. Second operand 7 states. [2019-09-10 06:16:32,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:32,693 INFO L93 Difference]: Finished difference Result 36611 states and 46306 transitions. [2019-09-10 06:16:32,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:16:32,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2019-09-10 06:16:32,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:32,722 INFO L225 Difference]: With dead ends: 36611 [2019-09-10 06:16:32,723 INFO L226 Difference]: Without dead ends: 36611 [2019-09-10 06:16:32,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:16:32,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36611 states. [2019-09-10 06:16:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36611 to 26603. [2019-09-10 06:16:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26603 states. [2019-09-10 06:16:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26603 states to 26603 states and 32622 transitions. [2019-09-10 06:16:32,965 INFO L78 Accepts]: Start accepts. Automaton has 26603 states and 32622 transitions. Word has length 184 [2019-09-10 06:16:32,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:32,965 INFO L475 AbstractCegarLoop]: Abstraction has 26603 states and 32622 transitions. [2019-09-10 06:16:32,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:16:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 26603 states and 32622 transitions. [2019-09-10 06:16:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:16:32,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:32,973 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 06:16:32,973 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:32,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:32,973 INFO L82 PathProgramCache]: Analyzing trace with hash -834696910, now seen corresponding path program 1 times [2019-09-10 06:16:32,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:32,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:32,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:32,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:32,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:33,318 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 06:16:33,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:33,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:16:33,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:33,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:16:33,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:16:33,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:16:33,319 INFO L87 Difference]: Start difference. First operand 26603 states and 32622 transitions. Second operand 16 states. [2019-09-10 06:16:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:35,147 INFO L93 Difference]: Finished difference Result 39420 states and 50124 transitions. [2019-09-10 06:16:35,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:16:35,147 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 184 [2019-09-10 06:16:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:35,185 INFO L225 Difference]: With dead ends: 39420 [2019-09-10 06:16:35,185 INFO L226 Difference]: Without dead ends: 39420 [2019-09-10 06:16:35,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=313, Invalid=809, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:16:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39420 states. [2019-09-10 06:16:35,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39420 to 26549. [2019-09-10 06:16:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26549 states. [2019-09-10 06:16:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26549 states to 26549 states and 32533 transitions. [2019-09-10 06:16:35,444 INFO L78 Accepts]: Start accepts. Automaton has 26549 states and 32533 transitions. Word has length 184 [2019-09-10 06:16:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:35,445 INFO L475 AbstractCegarLoop]: Abstraction has 26549 states and 32533 transitions. [2019-09-10 06:16:35,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:16:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 26549 states and 32533 transitions. [2019-09-10 06:16:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:16:35,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:35,452 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 06:16:35,452 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:35,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash 41591392, now seen corresponding path program 1 times [2019-09-10 06:16:35,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:35,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:35,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:35,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:35,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:35,914 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 06:16:35,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:35,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:16:35,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:35,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:16:35,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:16:35,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:16:35,915 INFO L87 Difference]: Start difference. First operand 26549 states and 32533 transitions. Second operand 21 states. [2019-09-10 06:16:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:43,292 INFO L93 Difference]: Finished difference Result 56114 states and 71920 transitions. [2019-09-10 06:16:43,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 06:16:43,292 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 184 [2019-09-10 06:16:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:43,349 INFO L225 Difference]: With dead ends: 56114 [2019-09-10 06:16:43,350 INFO L226 Difference]: Without dead ends: 56114 [2019-09-10 06:16:43,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=712, Invalid=3320, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 06:16:43,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56114 states. [2019-09-10 06:16:43,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56114 to 27356. [2019-09-10 06:16:43,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27356 states. [2019-09-10 06:16:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27356 states to 27356 states and 33351 transitions. [2019-09-10 06:16:43,807 INFO L78 Accepts]: Start accepts. Automaton has 27356 states and 33351 transitions. Word has length 184 [2019-09-10 06:16:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:43,808 INFO L475 AbstractCegarLoop]: Abstraction has 27356 states and 33351 transitions. [2019-09-10 06:16:43,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:16:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 27356 states and 33351 transitions. [2019-09-10 06:16:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:16:43,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:43,816 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 06:16:43,816 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:43,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1439868801, now seen corresponding path program 1 times [2019-09-10 06:16:43,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:43,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:43,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:43,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:43,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:44,068 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 06:16:44,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:44,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:16:44,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:44,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:16:44,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:16:44,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:16:44,069 INFO L87 Difference]: Start difference. First operand 27356 states and 33351 transitions. Second operand 14 states. [2019-09-10 06:16:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:45,490 INFO L93 Difference]: Finished difference Result 33383 states and 41449 transitions. [2019-09-10 06:16:45,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:16:45,491 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 184 [2019-09-10 06:16:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:45,516 INFO L225 Difference]: With dead ends: 33383 [2019-09-10 06:16:45,516 INFO L226 Difference]: Without dead ends: 33383 [2019-09-10 06:16:45,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=908, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:16:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33383 states. [2019-09-10 06:16:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33383 to 27511. [2019-09-10 06:16:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27511 states. [2019-09-10 06:16:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27511 states to 27511 states and 33502 transitions. [2019-09-10 06:16:45,749 INFO L78 Accepts]: Start accepts. Automaton has 27511 states and 33502 transitions. Word has length 184 [2019-09-10 06:16:45,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:45,750 INFO L475 AbstractCegarLoop]: Abstraction has 27511 states and 33502 transitions. [2019-09-10 06:16:45,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:16:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 27511 states and 33502 transitions. [2019-09-10 06:16:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:16:45,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:45,758 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 06:16:45,758 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:45,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:45,758 INFO L82 PathProgramCache]: Analyzing trace with hash -143613751, now seen corresponding path program 1 times [2019-09-10 06:16:45,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:45,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:45,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:45,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:45,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:45,898 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 06:16:45,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:45,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:16:45,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:45,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:16:45,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:16:45,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:16:45,899 INFO L87 Difference]: Start difference. First operand 27511 states and 33502 transitions. Second operand 7 states. [2019-09-10 06:16:46,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:46,150 INFO L93 Difference]: Finished difference Result 32217 states and 39875 transitions. [2019-09-10 06:16:46,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:16:46,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2019-09-10 06:16:46,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:46,175 INFO L225 Difference]: With dead ends: 32217 [2019-09-10 06:16:46,175 INFO L226 Difference]: Without dead ends: 32217 [2019-09-10 06:16:46,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:16:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32217 states. [2019-09-10 06:16:46,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32217 to 25774. [2019-09-10 06:16:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25774 states. [2019-09-10 06:16:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25774 states to 25774 states and 31057 transitions. [2019-09-10 06:16:46,400 INFO L78 Accepts]: Start accepts. Automaton has 25774 states and 31057 transitions. Word has length 184 [2019-09-10 06:16:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:46,400 INFO L475 AbstractCegarLoop]: Abstraction has 25774 states and 31057 transitions. [2019-09-10 06:16:46,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:16:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 25774 states and 31057 transitions. [2019-09-10 06:16:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:16:46,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:46,408 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 06:16:46,408 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:46,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:46,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1389409792, now seen corresponding path program 1 times [2019-09-10 06:16:46,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:46,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:46,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:46,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:46,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:46,896 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 06:16:46,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:46,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:16:46,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:46,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:16:46,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:16:46,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:16:46,898 INFO L87 Difference]: Start difference. First operand 25774 states and 31057 transitions. Second operand 21 states. [2019-09-10 06:16:48,911 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-09-10 06:16:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:53,685 INFO L93 Difference]: Finished difference Result 56584 states and 72176 transitions. [2019-09-10 06:16:53,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 06:16:53,686 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 184 [2019-09-10 06:16:53,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:53,735 INFO L225 Difference]: With dead ends: 56584 [2019-09-10 06:16:53,736 INFO L226 Difference]: Without dead ends: 56435 [2019-09-10 06:16:53,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=786, Invalid=3770, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 06:16:53,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56435 states. [2019-09-10 06:16:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56435 to 26512. [2019-09-10 06:16:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26512 states. [2019-09-10 06:16:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26512 states to 26512 states and 31821 transitions. [2019-09-10 06:16:54,068 INFO L78 Accepts]: Start accepts. Automaton has 26512 states and 31821 transitions. Word has length 184 [2019-09-10 06:16:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:54,068 INFO L475 AbstractCegarLoop]: Abstraction has 26512 states and 31821 transitions. [2019-09-10 06:16:54,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:16:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 26512 states and 31821 transitions. [2019-09-10 06:16:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:16:54,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:54,076 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 06:16:54,076 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:54,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1028018826, now seen corresponding path program 1 times [2019-09-10 06:16:54,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:54,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:54,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:54,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:54,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:54,548 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 06:16:54,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:54,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:16:54,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:54,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:16:54,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:16:54,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:16:54,549 INFO L87 Difference]: Start difference. First operand 26512 states and 31821 transitions. Second operand 21 states. [2019-09-10 06:16:54,685 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:16:58,406 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-09-10 06:17:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:00,633 INFO L93 Difference]: Finished difference Result 43871 states and 54876 transitions. [2019-09-10 06:17:00,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 06:17:00,634 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 184 [2019-09-10 06:17:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:00,666 INFO L225 Difference]: With dead ends: 43871 [2019-09-10 06:17:00,666 INFO L226 Difference]: Without dead ends: 43871 [2019-09-10 06:17:00,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=698, Invalid=2724, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 06:17:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43871 states. [2019-09-10 06:17:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43871 to 27415. [2019-09-10 06:17:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27415 states. [2019-09-10 06:17:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27415 states to 27415 states and 32750 transitions. [2019-09-10 06:17:00,942 INFO L78 Accepts]: Start accepts. Automaton has 27415 states and 32750 transitions. Word has length 184 [2019-09-10 06:17:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:00,942 INFO L475 AbstractCegarLoop]: Abstraction has 27415 states and 32750 transitions. [2019-09-10 06:17:00,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:17:00,942 INFO L276 IsEmpty]: Start isEmpty. Operand 27415 states and 32750 transitions. [2019-09-10 06:17:00,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:17:00,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:00,951 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 06:17:00,951 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:00,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:00,952 INFO L82 PathProgramCache]: Analyzing trace with hash 549324922, now seen corresponding path program 1 times [2019-09-10 06:17:00,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:00,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:00,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:00,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:00,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:01,261 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 06:17:01,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:01,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:17:01,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:01,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:17:01,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:17:01,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:17:01,263 INFO L87 Difference]: Start difference. First operand 27415 states and 32750 transitions. Second operand 17 states. [2019-09-10 06:17:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:03,393 INFO L93 Difference]: Finished difference Result 33609 states and 40373 transitions. [2019-09-10 06:17:03,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:17:03,394 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 184 [2019-09-10 06:17:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:03,418 INFO L225 Difference]: With dead ends: 33609 [2019-09-10 06:17:03,418 INFO L226 Difference]: Without dead ends: 33065 [2019-09-10 06:17:03,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:17:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33065 states. [2019-09-10 06:17:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33065 to 26943. [2019-09-10 06:17:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26943 states. [2019-09-10 06:17:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26943 states to 26943 states and 32236 transitions. [2019-09-10 06:17:03,646 INFO L78 Accepts]: Start accepts. Automaton has 26943 states and 32236 transitions. Word has length 184 [2019-09-10 06:17:03,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:03,646 INFO L475 AbstractCegarLoop]: Abstraction has 26943 states and 32236 transitions. [2019-09-10 06:17:03,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:17:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 26943 states and 32236 transitions. [2019-09-10 06:17:03,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:17:03,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:03,655 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 06:17:03,655 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:03,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:03,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1331802849, now seen corresponding path program 1 times [2019-09-10 06:17:03,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:03,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:03,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:03,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:03,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:04,699 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 06:17:04,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:04,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:17:04,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:04,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:17:04,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:17:04,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:17:04,700 INFO L87 Difference]: Start difference. First operand 26943 states and 32236 transitions. Second operand 25 states. [2019-09-10 06:17:04,883 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 06:17:05,739 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 06:17:06,252 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:17:06,602 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:17:06,732 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:17:06,998 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 06:17:07,144 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 06:17:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:10,488 INFO L93 Difference]: Finished difference Result 36546 states and 45365 transitions. [2019-09-10 06:17:10,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 06:17:10,488 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 184 [2019-09-10 06:17:10,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:10,518 INFO L225 Difference]: With dead ends: 36546 [2019-09-10 06:17:10,518 INFO L226 Difference]: Without dead ends: 36546 [2019-09-10 06:17:10,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=559, Invalid=2197, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 06:17:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36546 states. [2019-09-10 06:17:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36546 to 24948. [2019-09-10 06:17:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24948 states. [2019-09-10 06:17:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24948 states to 24948 states and 29570 transitions. [2019-09-10 06:17:10,752 INFO L78 Accepts]: Start accepts. Automaton has 24948 states and 29570 transitions. Word has length 184 [2019-09-10 06:17:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:10,752 INFO L475 AbstractCegarLoop]: Abstraction has 24948 states and 29570 transitions. [2019-09-10 06:17:10,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:17:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 24948 states and 29570 transitions. [2019-09-10 06:17:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:17:10,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:10,760 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 06:17:10,761 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:10,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:10,761 INFO L82 PathProgramCache]: Analyzing trace with hash 358975552, now seen corresponding path program 1 times [2019-09-10 06:17:10,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:10,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:10,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:10,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:10,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:11,359 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 06:17:11,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:11,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:17:11,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:11,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:17:11,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:17:11,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:17:11,361 INFO L87 Difference]: Start difference. First operand 24948 states and 29570 transitions. Second operand 19 states. [2019-09-10 06:17:11,503 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-09-10 06:17:12,388 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 06:17:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:14,285 INFO L93 Difference]: Finished difference Result 23560 states and 27792 transitions. [2019-09-10 06:17:14,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:17:14,286 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 184 [2019-09-10 06:17:14,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:14,302 INFO L225 Difference]: With dead ends: 23560 [2019-09-10 06:17:14,302 INFO L226 Difference]: Without dead ends: 23552 [2019-09-10 06:17:14,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=317, Invalid=1089, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:17:14,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23552 states. [2019-09-10 06:17:14,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23552 to 23542. [2019-09-10 06:17:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23542 states. [2019-09-10 06:17:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23542 states to 23542 states and 27776 transitions. [2019-09-10 06:17:14,466 INFO L78 Accepts]: Start accepts. Automaton has 23542 states and 27776 transitions. Word has length 184 [2019-09-10 06:17:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:14,467 INFO L475 AbstractCegarLoop]: Abstraction has 23542 states and 27776 transitions. [2019-09-10 06:17:14,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:17:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 23542 states and 27776 transitions. [2019-09-10 06:17:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:17:14,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:14,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:17:14,475 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:14,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:14,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1638041002, now seen corresponding path program 1 times [2019-09-10 06:17:14,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:14,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:14,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:14,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:15,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 06:17:15,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:15,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:17:15,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:15,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:17:15,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:17:15,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:17:15,133 INFO L87 Difference]: Start difference. First operand 23542 states and 27776 transitions. Second operand 21 states. [2019-09-10 06:17:15,351 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-09-10 06:17:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:25,200 INFO L93 Difference]: Finished difference Result 46347 states and 57968 transitions. [2019-09-10 06:17:25,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 06:17:25,201 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 184 [2019-09-10 06:17:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:25,239 INFO L225 Difference]: With dead ends: 46347 [2019-09-10 06:17:25,239 INFO L226 Difference]: Without dead ends: 46347 [2019-09-10 06:17:25,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1699 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1130, Invalid=4722, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 06:17:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46347 states. [2019-09-10 06:17:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46347 to 24355. [2019-09-10 06:17:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24355 states. [2019-09-10 06:17:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24355 states to 24355 states and 28619 transitions. [2019-09-10 06:17:25,520 INFO L78 Accepts]: Start accepts. Automaton has 24355 states and 28619 transitions. Word has length 184 [2019-09-10 06:17:25,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:25,520 INFO L475 AbstractCegarLoop]: Abstraction has 24355 states and 28619 transitions. [2019-09-10 06:17:25,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:17:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 24355 states and 28619 transitions. [2019-09-10 06:17:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:17:25,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:25,529 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 06:17:25,529 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:25,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:25,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1396652279, now seen corresponding path program 1 times [2019-09-10 06:17:25,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:25,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:25,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:25,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:25,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:25,880 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 06:17:25,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:25,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:17:25,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:25,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:17:25,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:17:25,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:17:25,881 INFO L87 Difference]: Start difference. First operand 24355 states and 28619 transitions. Second operand 17 states. [2019-09-10 06:17:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:29,059 INFO L93 Difference]: Finished difference Result 41962 states and 51096 transitions. [2019-09-10 06:17:29,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 06:17:29,059 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 184 [2019-09-10 06:17:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:29,092 INFO L225 Difference]: With dead ends: 41962 [2019-09-10 06:17:29,092 INFO L226 Difference]: Without dead ends: 41842 [2019-09-10 06:17:29,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=698, Invalid=2382, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 06:17:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41842 states. [2019-09-10 06:17:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41842 to 30242. [2019-09-10 06:17:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30242 states. [2019-09-10 06:17:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30242 states to 30242 states and 36250 transitions. [2019-09-10 06:17:29,366 INFO L78 Accepts]: Start accepts. Automaton has 30242 states and 36250 transitions. Word has length 184 [2019-09-10 06:17:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:29,366 INFO L475 AbstractCegarLoop]: Abstraction has 30242 states and 36250 transitions. [2019-09-10 06:17:29,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:17:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 30242 states and 36250 transitions. [2019-09-10 06:17:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:17:29,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:29,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] [2019-09-10 06:17:29,377 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:29,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:29,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1671012337, now seen corresponding path program 1 times [2019-09-10 06:17:29,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:29,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:29,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:29,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:29,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:29,948 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 06:17:29,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:29,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 06:17:29,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:29,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:17:29,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:17:29,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:17:29,949 INFO L87 Difference]: Start difference. First operand 30242 states and 36250 transitions. Second operand 24 states. [2019-09-10 06:17:30,112 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 06:17:31,052 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 06:17:31,221 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 06:17:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:35,553 INFO L93 Difference]: Finished difference Result 52409 states and 65841 transitions. [2019-09-10 06:17:35,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 06:17:35,553 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 184 [2019-09-10 06:17:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:35,598 INFO L225 Difference]: With dead ends: 52409 [2019-09-10 06:17:35,598 INFO L226 Difference]: Without dead ends: 52409 [2019-09-10 06:17:35,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=824, Invalid=2716, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:17:35,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52409 states. [2019-09-10 06:17:36,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52409 to 34002. [2019-09-10 06:17:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34002 states. [2019-09-10 06:17:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34002 states to 34002 states and 41061 transitions. [2019-09-10 06:17:36,074 INFO L78 Accepts]: Start accepts. Automaton has 34002 states and 41061 transitions. Word has length 184 [2019-09-10 06:17:36,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:36,074 INFO L475 AbstractCegarLoop]: Abstraction has 34002 states and 41061 transitions. [2019-09-10 06:17:36,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:17:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 34002 states and 41061 transitions. [2019-09-10 06:17:36,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:17:36,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:36,085 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 06:17:36,085 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:36,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:36,086 INFO L82 PathProgramCache]: Analyzing trace with hash -767614633, now seen corresponding path program 1 times [2019-09-10 06:17:36,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:36,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:36,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:36,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:36,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:36,551 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 06:17:36,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:36,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 06:17:36,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:36,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:17:36,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:17:36,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:17:36,553 INFO L87 Difference]: Start difference. First operand 34002 states and 41061 transitions. Second operand 20 states. [2019-09-10 06:17:36,704 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 06:17:37,741 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 06:17:37,899 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-10 06:17:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:40,830 INFO L93 Difference]: Finished difference Result 39851 states and 49426 transitions. [2019-09-10 06:17:40,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:17:40,830 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 184 [2019-09-10 06:17:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:40,864 INFO L225 Difference]: With dead ends: 39851 [2019-09-10 06:17:40,864 INFO L226 Difference]: Without dead ends: 39851 [2019-09-10 06:17:40,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=365, Invalid=1195, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:17:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39851 states. [2019-09-10 06:17:41,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39851 to 29688. [2019-09-10 06:17:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29688 states. [2019-09-10 06:17:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29688 states to 29688 states and 35669 transitions. [2019-09-10 06:17:41,144 INFO L78 Accepts]: Start accepts. Automaton has 29688 states and 35669 transitions. Word has length 184 [2019-09-10 06:17:41,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:41,145 INFO L475 AbstractCegarLoop]: Abstraction has 29688 states and 35669 transitions. [2019-09-10 06:17:41,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:17:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 29688 states and 35669 transitions. [2019-09-10 06:17:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:17:41,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:41,154 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 06:17:41,154 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:41,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:41,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1609495067, now seen corresponding path program 1 times [2019-09-10 06:17:41,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:41,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:41,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:41,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:41,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:41,542 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 06:17:41,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:41,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:17:41,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:41,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:17:41,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:17:41,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:17:41,544 INFO L87 Difference]: Start difference. First operand 29688 states and 35669 transitions. Second operand 18 states. [2019-09-10 06:17:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:43,997 INFO L93 Difference]: Finished difference Result 29230 states and 34719 transitions. [2019-09-10 06:17:43,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:17:43,997 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 184 [2019-09-10 06:17:43,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:44,016 INFO L225 Difference]: With dead ends: 29230 [2019-09-10 06:17:44,016 INFO L226 Difference]: Without dead ends: 29230 [2019-09-10 06:17:44,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:17:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29230 states. [2019-09-10 06:17:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29230 to 28887. [2019-09-10 06:17:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28887 states. [2019-09-10 06:17:44,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28887 states to 28887 states and 34357 transitions. [2019-09-10 06:17:44,228 INFO L78 Accepts]: Start accepts. Automaton has 28887 states and 34357 transitions. Word has length 184 [2019-09-10 06:17:44,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:44,228 INFO L475 AbstractCegarLoop]: Abstraction has 28887 states and 34357 transitions. [2019-09-10 06:17:44,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:17:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 28887 states and 34357 transitions. [2019-09-10 06:17:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:17:44,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:44,238 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 06:17:44,238 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:44,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:44,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1777720455, now seen corresponding path program 1 times [2019-09-10 06:17:44,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:44,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:44,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:44,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:44,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:44,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 06:17:44,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:44,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:17:44,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:44,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:17:44,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:17:44,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:17:44,765 INFO L87 Difference]: Start difference. First operand 28887 states and 34357 transitions. Second operand 19 states. [2019-09-10 06:17:46,888 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:17:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:49,454 INFO L93 Difference]: Finished difference Result 38178 states and 46514 transitions. [2019-09-10 06:17:49,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:17:49,454 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 184 [2019-09-10 06:17:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:49,484 INFO L225 Difference]: With dead ends: 38178 [2019-09-10 06:17:49,484 INFO L226 Difference]: Without dead ends: 38178 [2019-09-10 06:17:49,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=361, Invalid=1445, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:17:49,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38178 states. [2019-09-10 06:17:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38178 to 29230. [2019-09-10 06:17:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29230 states. [2019-09-10 06:17:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29230 states to 29230 states and 34702 transitions. [2019-09-10 06:17:49,738 INFO L78 Accepts]: Start accepts. Automaton has 29230 states and 34702 transitions. Word has length 184 [2019-09-10 06:17:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:49,738 INFO L475 AbstractCegarLoop]: Abstraction has 29230 states and 34702 transitions. [2019-09-10 06:17:49,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:17:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 29230 states and 34702 transitions. [2019-09-10 06:17:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:17:49,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:49,749 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:49,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:49,750 INFO L82 PathProgramCache]: Analyzing trace with hash -506535252, now seen corresponding path program 1 times [2019-09-10 06:17:49,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:49,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:49,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:50,179 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 06:17:50,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:50,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:17:50,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:50,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:17:50,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:17:50,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:17:50,181 INFO L87 Difference]: Start difference. First operand 29230 states and 34702 transitions. Second operand 21 states. [2019-09-10 06:17:51,465 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-09-10 06:17:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:56,933 INFO L93 Difference]: Finished difference Result 49668 states and 62046 transitions. [2019-09-10 06:17:56,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 06:17:56,934 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 184 [2019-09-10 06:17:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:56,975 INFO L225 Difference]: With dead ends: 49668 [2019-09-10 06:17:56,976 INFO L226 Difference]: Without dead ends: 49420 [2019-09-10 06:17:56,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=725, Invalid=3181, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 06:17:57,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49420 states. [2019-09-10 06:17:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49420 to 29027. [2019-09-10 06:17:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29027 states. [2019-09-10 06:17:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29027 states to 29027 states and 34452 transitions. [2019-09-10 06:17:57,305 INFO L78 Accepts]: Start accepts. Automaton has 29027 states and 34452 transitions. Word has length 184 [2019-09-10 06:17:57,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:57,305 INFO L475 AbstractCegarLoop]: Abstraction has 29027 states and 34452 transitions. [2019-09-10 06:17:57,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:17:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 29027 states and 34452 transitions. [2019-09-10 06:17:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:17:57,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:57,315 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 06:17:57,315 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:57,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:57,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1462396271, now seen corresponding path program 1 times [2019-09-10 06:17:57,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:57,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:57,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:57,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:57,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:58,200 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 06:17:58,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:58,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:17:58,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:58,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:17:58,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:17:58,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:17:58,201 INFO L87 Difference]: Start difference. First operand 29027 states and 34452 transitions. Second operand 22 states. [2019-09-10 06:17:58,441 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-09-10 06:17:58,672 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-10 06:17:59,560 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 06:17:59,841 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 06:18:00,059 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-09-10 06:18:00,362 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2019-09-10 06:18:00,676 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2019-09-10 06:18:01,335 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-09-10 06:18:01,735 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 06:18:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:05,989 INFO L93 Difference]: Finished difference Result 33897 states and 40216 transitions. [2019-09-10 06:18:05,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:18:05,990 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 184 [2019-09-10 06:18:05,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:06,014 INFO L225 Difference]: With dead ends: 33897 [2019-09-10 06:18:06,014 INFO L226 Difference]: Without dead ends: 33897 [2019-09-10 06:18:06,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=404, Invalid=1852, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:18:06,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33897 states. [2019-09-10 06:18:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33897 to 28968. [2019-09-10 06:18:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28968 states. [2019-09-10 06:18:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28968 states to 28968 states and 34390 transitions. [2019-09-10 06:18:06,253 INFO L78 Accepts]: Start accepts. Automaton has 28968 states and 34390 transitions. Word has length 184 [2019-09-10 06:18:06,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:06,253 INFO L475 AbstractCegarLoop]: Abstraction has 28968 states and 34390 transitions. [2019-09-10 06:18:06,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:18:06,253 INFO L276 IsEmpty]: Start isEmpty. Operand 28968 states and 34390 transitions. [2019-09-10 06:18:06,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:18:06,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:06,263 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 06:18:06,263 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:06,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:06,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1647038182, now seen corresponding path program 1 times [2019-09-10 06:18:06,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:06,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:06,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:06,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:06,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:06,870 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 06:18:06,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:06,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:18:06,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:06,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:18:06,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:18:06,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:18:06,872 INFO L87 Difference]: Start difference. First operand 28968 states and 34390 transitions. Second operand 18 states. [2019-09-10 06:18:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:09,050 INFO L93 Difference]: Finished difference Result 35653 states and 43776 transitions. [2019-09-10 06:18:09,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:18:09,050 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 184 [2019-09-10 06:18:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:09,079 INFO L225 Difference]: With dead ends: 35653 [2019-09-10 06:18:09,080 INFO L226 Difference]: Without dead ends: 35653 [2019-09-10 06:18:09,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:18:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35653 states. [2019-09-10 06:18:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35653 to 27116. [2019-09-10 06:18:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27116 states. [2019-09-10 06:18:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27116 states to 27116 states and 32237 transitions. [2019-09-10 06:18:09,337 INFO L78 Accepts]: Start accepts. Automaton has 27116 states and 32237 transitions. Word has length 184 [2019-09-10 06:18:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:09,337 INFO L475 AbstractCegarLoop]: Abstraction has 27116 states and 32237 transitions. [2019-09-10 06:18:09,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:18:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 27116 states and 32237 transitions. [2019-09-10 06:18:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:18:09,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:09,346 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 06:18:09,346 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:09,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:09,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2047326035, now seen corresponding path program 1 times [2019-09-10 06:18:09,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:09,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:09,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:09,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:09,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:10,173 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 06:18:10,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:10,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:18:10,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:10,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:18:10,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:18:10,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:18:10,174 INFO L87 Difference]: Start difference. First operand 27116 states and 32237 transitions. Second operand 17 states. [2019-09-10 06:18:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:11,558 INFO L93 Difference]: Finished difference Result 33228 states and 40432 transitions. [2019-09-10 06:18:11,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:18:11,558 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 184 [2019-09-10 06:18:11,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:11,583 INFO L225 Difference]: With dead ends: 33228 [2019-09-10 06:18:11,583 INFO L226 Difference]: Without dead ends: 33116 [2019-09-10 06:18:11,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:18:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33116 states. [2019-09-10 06:18:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33116 to 24766. [2019-09-10 06:18:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24766 states. [2019-09-10 06:18:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24766 states to 24766 states and 29036 transitions. [2019-09-10 06:18:11,805 INFO L78 Accepts]: Start accepts. Automaton has 24766 states and 29036 transitions. Word has length 184 [2019-09-10 06:18:11,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:11,806 INFO L475 AbstractCegarLoop]: Abstraction has 24766 states and 29036 transitions. [2019-09-10 06:18:11,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:18:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 24766 states and 29036 transitions. [2019-09-10 06:18:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:18:11,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:11,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] [2019-09-10 06:18:11,815 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:11,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1456554480, now seen corresponding path program 1 times [2019-09-10 06:18:11,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:11,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:11,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:11,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:11,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:12,474 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 06:18:12,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:12,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 06:18:12,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:12,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:18:12,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:18:12,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:18:12,476 INFO L87 Difference]: Start difference. First operand 24766 states and 29036 transitions. Second operand 20 states. [2019-09-10 06:18:15,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:15,922 INFO L93 Difference]: Finished difference Result 32130 states and 39080 transitions. [2019-09-10 06:18:15,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:18:15,923 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 184 [2019-09-10 06:18:15,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:15,946 INFO L225 Difference]: With dead ends: 32130 [2019-09-10 06:18:15,947 INFO L226 Difference]: Without dead ends: 32015 [2019-09-10 06:18:15,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=273, Invalid=1287, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:18:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32015 states. [2019-09-10 06:18:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32015 to 24822. [2019-09-10 06:18:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24822 states. [2019-09-10 06:18:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24822 states to 24822 states and 29090 transitions. [2019-09-10 06:18:16,167 INFO L78 Accepts]: Start accepts. Automaton has 24822 states and 29090 transitions. Word has length 184 [2019-09-10 06:18:16,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:16,167 INFO L475 AbstractCegarLoop]: Abstraction has 24822 states and 29090 transitions. [2019-09-10 06:18:16,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:18:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 24822 states and 29090 transitions. [2019-09-10 06:18:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:18:16,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:16,176 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 06:18:16,176 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:16,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:16,177 INFO L82 PathProgramCache]: Analyzing trace with hash 450804539, now seen corresponding path program 1 times [2019-09-10 06:18:16,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:16,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:16,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:16,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:16,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:18,106 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 06:18:18,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:18,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 06:18:18,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:18,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 06:18:18,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 06:18:18,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:18:18,107 INFO L87 Difference]: Start difference. First operand 24822 states and 29090 transitions. Second operand 28 states. [2019-09-10 06:18:18,729 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 06:18:19,091 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 06:18:19,309 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-09-10 06:18:19,575 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 06:18:19,829 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 06:18:20,033 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 06:18:20,479 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 06:18:20,786 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:18:20,963 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 06:18:21,645 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 06:18:21,864 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 06:18:22,432 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 06:18:22,712 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 06:18:22,964 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 06:18:23,704 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 06:18:24,014 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 06:18:24,439 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 06:18:24,651 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 06:18:26,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:26,312 INFO L93 Difference]: Finished difference Result 31605 states and 38211 transitions. [2019-09-10 06:18:26,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:18:26,312 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 184 [2019-09-10 06:18:26,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:26,337 INFO L225 Difference]: With dead ends: 31605 [2019-09-10 06:18:26,338 INFO L226 Difference]: Without dead ends: 31589 [2019-09-10 06:18:26,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=433, Invalid=2117, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 06:18:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31589 states. [2019-09-10 06:18:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31589 to 24369. [2019-09-10 06:18:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24369 states. [2019-09-10 06:18:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24369 states to 24369 states and 28457 transitions. [2019-09-10 06:18:26,545 INFO L78 Accepts]: Start accepts. Automaton has 24369 states and 28457 transitions. Word has length 184 [2019-09-10 06:18:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:26,545 INFO L475 AbstractCegarLoop]: Abstraction has 24369 states and 28457 transitions. [2019-09-10 06:18:26,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 06:18:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 24369 states and 28457 transitions. [2019-09-10 06:18:26,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:18:26,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:26,556 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 06:18:26,556 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:26,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:26,556 INFO L82 PathProgramCache]: Analyzing trace with hash 372307964, now seen corresponding path program 1 times [2019-09-10 06:18:26,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:26,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:26,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:26,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:26,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:27,170 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 06:18:27,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:27,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:18:27,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:27,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:18:27,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:18:27,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:18:27,171 INFO L87 Difference]: Start difference. First operand 24369 states and 28457 transitions. Second operand 16 states. [2019-09-10 06:18:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:28,899 INFO L93 Difference]: Finished difference Result 24216 states and 28193 transitions. [2019-09-10 06:18:28,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:18:28,899 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 184 [2019-09-10 06:18:28,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:28,915 INFO L225 Difference]: With dead ends: 24216 [2019-09-10 06:18:28,915 INFO L226 Difference]: Without dead ends: 24216 [2019-09-10 06:18:28,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:18:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24216 states. [2019-09-10 06:18:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24216 to 23952. [2019-09-10 06:18:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23952 states. [2019-09-10 06:18:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23952 states to 23952 states and 27927 transitions. [2019-09-10 06:18:29,084 INFO L78 Accepts]: Start accepts. Automaton has 23952 states and 27927 transitions. Word has length 184 [2019-09-10 06:18:29,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:29,084 INFO L475 AbstractCegarLoop]: Abstraction has 23952 states and 27927 transitions. [2019-09-10 06:18:29,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:18:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 23952 states and 27927 transitions. [2019-09-10 06:18:29,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:29,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:29,093 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 06:18:29,093 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:29,094 INFO L82 PathProgramCache]: Analyzing trace with hash -175250234, now seen corresponding path program 1 times [2019-09-10 06:18:29,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:29,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:29,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:29,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:29,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:29,164 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 06:18:29,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:29,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:29,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:29,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:29,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:29,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:29,165 INFO L87 Difference]: Start difference. First operand 23952 states and 27927 transitions. Second operand 3 states. [2019-09-10 06:18:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:29,271 INFO L93 Difference]: Finished difference Result 29784 states and 35008 transitions. [2019-09-10 06:18:29,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:29,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-10 06:18:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:29,293 INFO L225 Difference]: With dead ends: 29784 [2019-09-10 06:18:29,293 INFO L226 Difference]: Without dead ends: 29784 [2019-09-10 06:18:29,293 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 06:18:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29784 states. [2019-09-10 06:18:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29784 to 29782. [2019-09-10 06:18:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29782 states. [2019-09-10 06:18:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29782 states to 29782 states and 35007 transitions. [2019-09-10 06:18:29,496 INFO L78 Accepts]: Start accepts. Automaton has 29782 states and 35007 transitions. Word has length 186 [2019-09-10 06:18:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:29,496 INFO L475 AbstractCegarLoop]: Abstraction has 29782 states and 35007 transitions. [2019-09-10 06:18:29,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 29782 states and 35007 transitions. [2019-09-10 06:18:29,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 06:18:29,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:29,506 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:29,506 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:29,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:29,506 INFO L82 PathProgramCache]: Analyzing trace with hash 852339573, now seen corresponding path program 1 times [2019-09-10 06:18:29,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:29,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:29,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:29,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:29,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:29,613 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 06:18:29,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:29,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:18:29,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:29,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:18:29,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:18:29,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:18:29,615 INFO L87 Difference]: Start difference. First operand 29782 states and 35007 transitions. Second operand 6 states. [2019-09-10 06:18:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:29,801 INFO L93 Difference]: Finished difference Result 48883 states and 59901 transitions. [2019-09-10 06:18:29,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:18:29,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2019-09-10 06:18:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:29,853 INFO L225 Difference]: With dead ends: 48883 [2019-09-10 06:18:29,853 INFO L226 Difference]: Without dead ends: 48883 [2019-09-10 06:18:29,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:18:29,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48883 states. [2019-09-10 06:18:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48883 to 29968. [2019-09-10 06:18:30,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29968 states. [2019-09-10 06:18:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29968 states to 29968 states and 35193 transitions. [2019-09-10 06:18:30,175 INFO L78 Accepts]: Start accepts. Automaton has 29968 states and 35193 transitions. Word has length 187 [2019-09-10 06:18:30,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:30,175 INFO L475 AbstractCegarLoop]: Abstraction has 29968 states and 35193 transitions. [2019-09-10 06:18:30,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:18:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 29968 states and 35193 transitions. [2019-09-10 06:18:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 06:18:30,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:30,184 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 06:18:30,185 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:30,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:30,185 INFO L82 PathProgramCache]: Analyzing trace with hash 854186615, now seen corresponding path program 1 times [2019-09-10 06:18:30,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:30,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:30,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:30,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:30,302 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 06:18:30,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:30,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:18:30,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:30,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:18:30,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:18:30,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:30,303 INFO L87 Difference]: Start difference. First operand 29968 states and 35193 transitions. Second operand 5 states. [2019-09-10 06:18:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:30,402 INFO L93 Difference]: Finished difference Result 33300 states and 39484 transitions. [2019-09-10 06:18:30,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:18:30,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-09-10 06:18:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:30,427 INFO L225 Difference]: With dead ends: 33300 [2019-09-10 06:18:30,427 INFO L226 Difference]: Without dead ends: 33300 [2019-09-10 06:18:30,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33300 states. [2019-09-10 06:18:30,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33300 to 33232. [2019-09-10 06:18:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33232 states. [2019-09-10 06:18:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33232 states to 33232 states and 39417 transitions. [2019-09-10 06:18:30,664 INFO L78 Accepts]: Start accepts. Automaton has 33232 states and 39417 transitions. Word has length 187 [2019-09-10 06:18:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:30,665 INFO L475 AbstractCegarLoop]: Abstraction has 33232 states and 39417 transitions. [2019-09-10 06:18:30,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:18:30,665 INFO L276 IsEmpty]: Start isEmpty. Operand 33232 states and 39417 transitions. [2019-09-10 06:18:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 06:18:30,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:30,674 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:30,674 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:30,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:30,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1891140069, now seen corresponding path program 1 times [2019-09-10 06:18:30,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:30,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:30,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:30,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:30,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:30,786 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 06:18:30,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:30,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:18:30,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:30,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:18:30,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:18:30,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:30,787 INFO L87 Difference]: Start difference. First operand 33232 states and 39417 transitions. Second operand 5 states. [2019-09-10 06:18:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:30,938 INFO L93 Difference]: Finished difference Result 35158 states and 41886 transitions. [2019-09-10 06:18:30,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:18:30,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-09-10 06:18:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:30,965 INFO L225 Difference]: With dead ends: 35158 [2019-09-10 06:18:30,965 INFO L226 Difference]: Without dead ends: 35158 [2019-09-10 06:18:30,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35158 states. [2019-09-10 06:18:31,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35158 to 35138. [2019-09-10 06:18:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35138 states. [2019-09-10 06:18:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35138 states to 35138 states and 41867 transitions. [2019-09-10 06:18:31,351 INFO L78 Accepts]: Start accepts. Automaton has 35138 states and 41867 transitions. Word has length 187 [2019-09-10 06:18:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:31,351 INFO L475 AbstractCegarLoop]: Abstraction has 35138 states and 41867 transitions. [2019-09-10 06:18:31,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:18:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 35138 states and 41867 transitions. [2019-09-10 06:18:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 06:18:31,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:31,360 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 06:18:31,361 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:31,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:31,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1907801976, now seen corresponding path program 1 times [2019-09-10 06:18:31,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:31,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:31,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:31,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:31,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:31,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:31,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:18:31,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:31,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:18:31,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:18:31,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:31,484 INFO L87 Difference]: Start difference. First operand 35138 states and 41867 transitions. Second operand 5 states. [2019-09-10 06:18:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:31,608 INFO L93 Difference]: Finished difference Result 37082 states and 44354 transitions. [2019-09-10 06:18:31,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:18:31,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-09-10 06:18:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:31,639 INFO L225 Difference]: With dead ends: 37082 [2019-09-10 06:18:31,639 INFO L226 Difference]: Without dead ends: 37082 [2019-09-10 06:18:31,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:31,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37082 states. [2019-09-10 06:18:31,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37082 to 37044. [2019-09-10 06:18:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37044 states. [2019-09-10 06:18:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37044 states to 37044 states and 44317 transitions. [2019-09-10 06:18:31,912 INFO L78 Accepts]: Start accepts. Automaton has 37044 states and 44317 transitions. Word has length 187 [2019-09-10 06:18:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:31,912 INFO L475 AbstractCegarLoop]: Abstraction has 37044 states and 44317 transitions. [2019-09-10 06:18:31,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:18:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand 37044 states and 44317 transitions. [2019-09-10 06:18:31,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:18:31,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:31,922 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 06:18:31,922 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:31,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:31,922 INFO L82 PathProgramCache]: Analyzing trace with hash -452532777, now seen corresponding path program 1 times [2019-09-10 06:18:31,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:31,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:31,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:31,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:31,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:32,178 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 06:18:32,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:32,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:18:32,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:32,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:18:32,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:18:32,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:18:32,179 INFO L87 Difference]: Start difference. First operand 37044 states and 44317 transitions. Second operand 15 states. [2019-09-10 06:18:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:34,181 INFO L93 Difference]: Finished difference Result 53969 states and 65966 transitions. [2019-09-10 06:18:34,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:18:34,181 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2019-09-10 06:18:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:34,227 INFO L225 Difference]: With dead ends: 53969 [2019-09-10 06:18:34,227 INFO L226 Difference]: Without dead ends: 53969 [2019-09-10 06:18:34,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:18:34,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53969 states. [2019-09-10 06:18:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53969 to 36746. [2019-09-10 06:18:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36746 states. [2019-09-10 06:18:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36746 states to 36746 states and 43963 transitions. [2019-09-10 06:18:34,553 INFO L78 Accepts]: Start accepts. Automaton has 36746 states and 43963 transitions. Word has length 190 [2019-09-10 06:18:34,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:34,553 INFO L475 AbstractCegarLoop]: Abstraction has 36746 states and 43963 transitions. [2019-09-10 06:18:34,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:18:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 36746 states and 43963 transitions. [2019-09-10 06:18:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:18:34,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:34,562 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:34,563 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:34,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:34,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1535969845, now seen corresponding path program 1 times [2019-09-10 06:18:34,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:34,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:34,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:34,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:34,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:34,834 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 06:18:34,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:34,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:18:34,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:34,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:18:34,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:18:34,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:18:34,835 INFO L87 Difference]: Start difference. First operand 36746 states and 43963 transitions. Second operand 16 states. [2019-09-10 06:18:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:36,824 INFO L93 Difference]: Finished difference Result 48512 states and 59031 transitions. [2019-09-10 06:18:36,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:18:36,824 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 190 [2019-09-10 06:18:36,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:36,863 INFO L225 Difference]: With dead ends: 48512 [2019-09-10 06:18:36,863 INFO L226 Difference]: Without dead ends: 48512 [2019-09-10 06:18:36,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:18:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48512 states. [2019-09-10 06:18:37,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48512 to 36215. [2019-09-10 06:18:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36215 states. [2019-09-10 06:18:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36215 states to 36215 states and 43225 transitions. [2019-09-10 06:18:37,290 INFO L78 Accepts]: Start accepts. Automaton has 36215 states and 43225 transitions. Word has length 190 [2019-09-10 06:18:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:37,290 INFO L475 AbstractCegarLoop]: Abstraction has 36215 states and 43225 transitions. [2019-09-10 06:18:37,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:18:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 36215 states and 43225 transitions. [2019-09-10 06:18:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:18:37,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:37,300 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 06:18:37,300 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:37,300 INFO L82 PathProgramCache]: Analyzing trace with hash 927647261, now seen corresponding path program 1 times [2019-09-10 06:18:37,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:37,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:37,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:37,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:37,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:37,538 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 06:18:37,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:37,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:18:37,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:37,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:18:37,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:18:37,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:18:37,540 INFO L87 Difference]: Start difference. First operand 36215 states and 43225 transitions. Second operand 14 states. [2019-09-10 06:18:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:38,784 INFO L93 Difference]: Finished difference Result 34980 states and 41940 transitions. [2019-09-10 06:18:38,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:18:38,785 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 190 [2019-09-10 06:18:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:38,811 INFO L225 Difference]: With dead ends: 34980 [2019-09-10 06:18:38,811 INFO L226 Difference]: Without dead ends: 34980 [2019-09-10 06:18:38,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:18:38,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34980 states. [2019-09-10 06:18:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34980 to 34512. [2019-09-10 06:18:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34512 states. [2019-09-10 06:18:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34512 states to 34512 states and 41467 transitions. [2019-09-10 06:18:39,051 INFO L78 Accepts]: Start accepts. Automaton has 34512 states and 41467 transitions. Word has length 190 [2019-09-10 06:18:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:39,052 INFO L475 AbstractCegarLoop]: Abstraction has 34512 states and 41467 transitions. [2019-09-10 06:18:39,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:18:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 34512 states and 41467 transitions. [2019-09-10 06:18:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:18:39,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:39,061 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 06:18:39,061 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:39,061 INFO L82 PathProgramCache]: Analyzing trace with hash 717614273, now seen corresponding path program 1 times [2019-09-10 06:18:39,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:39,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:39,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:39,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:39,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:39,371 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 06:18:39,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:39,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:18:39,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:39,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:18:39,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:18:39,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:18:39,372 INFO L87 Difference]: Start difference. First operand 34512 states and 41467 transitions. Second operand 16 states. [2019-09-10 06:18:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:41,497 INFO L93 Difference]: Finished difference Result 43929 states and 53502 transitions. [2019-09-10 06:18:41,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:18:41,497 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 190 [2019-09-10 06:18:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:41,532 INFO L225 Difference]: With dead ends: 43929 [2019-09-10 06:18:41,532 INFO L226 Difference]: Without dead ends: 43929 [2019-09-10 06:18:41,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:18:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43929 states. [2019-09-10 06:18:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43929 to 34185. [2019-09-10 06:18:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34185 states. [2019-09-10 06:18:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34185 states to 34185 states and 41049 transitions. [2019-09-10 06:18:41,812 INFO L78 Accepts]: Start accepts. Automaton has 34185 states and 41049 transitions. Word has length 190 [2019-09-10 06:18:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:41,812 INFO L475 AbstractCegarLoop]: Abstraction has 34185 states and 41049 transitions. [2019-09-10 06:18:41,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:18:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 34185 states and 41049 transitions. [2019-09-10 06:18:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:18:41,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:41,820 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 06:18:41,821 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:41,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:41,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1869117619, now seen corresponding path program 1 times [2019-09-10 06:18:41,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:41,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:41,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:42,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 06:18:42,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:42,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:18:42,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:42,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:18:42,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:18:42,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:18:42,133 INFO L87 Difference]: Start difference. First operand 34185 states and 41049 transitions. Second operand 16 states. [2019-09-10 06:18:42,973 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-09-10 06:18:46,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:46,022 INFO L93 Difference]: Finished difference Result 61265 states and 75853 transitions. [2019-09-10 06:18:46,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 06:18:46,023 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 190 [2019-09-10 06:18:46,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:46,077 INFO L225 Difference]: With dead ends: 61265 [2019-09-10 06:18:46,077 INFO L226 Difference]: Without dead ends: 61265 [2019-09-10 06:18:46,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=802, Invalid=2980, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 06:18:46,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61265 states. [2019-09-10 06:18:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61265 to 34694. [2019-09-10 06:18:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34694 states. [2019-09-10 06:18:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34694 states to 34694 states and 41569 transitions. [2019-09-10 06:18:46,432 INFO L78 Accepts]: Start accepts. Automaton has 34694 states and 41569 transitions. Word has length 190 [2019-09-10 06:18:46,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:46,432 INFO L475 AbstractCegarLoop]: Abstraction has 34694 states and 41569 transitions. [2019-09-10 06:18:46,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:18:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 34694 states and 41569 transitions. [2019-09-10 06:18:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:18:46,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:46,440 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 06:18:46,440 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:46,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:46,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1446314724, now seen corresponding path program 1 times [2019-09-10 06:18:46,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:46,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:46,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:46,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:46,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:46,786 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 06:18:46,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:46,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:18:46,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:46,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:18:46,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:18:46,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:18:46,787 INFO L87 Difference]: Start difference. First operand 34694 states and 41569 transitions. Second operand 17 states. [2019-09-10 06:18:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:48,675 INFO L93 Difference]: Finished difference Result 34830 states and 41700 transitions. [2019-09-10 06:18:48,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:18:48,676 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 190 [2019-09-10 06:18:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:48,702 INFO L225 Difference]: With dead ends: 34830 [2019-09-10 06:18:48,702 INFO L226 Difference]: Without dead ends: 34632 [2019-09-10 06:18:48,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=980, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:18:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34632 states. [2019-09-10 06:18:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34632 to 34536. [2019-09-10 06:18:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34536 states. [2019-09-10 06:18:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34536 states to 34536 states and 41405 transitions. [2019-09-10 06:18:48,943 INFO L78 Accepts]: Start accepts. Automaton has 34536 states and 41405 transitions. Word has length 190 [2019-09-10 06:18:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:48,943 INFO L475 AbstractCegarLoop]: Abstraction has 34536 states and 41405 transitions. [2019-09-10 06:18:48,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:18:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 34536 states and 41405 transitions. [2019-09-10 06:18:48,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:18:48,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:48,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] [2019-09-10 06:18:48,952 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:48,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:48,952 INFO L82 PathProgramCache]: Analyzing trace with hash 712752826, now seen corresponding path program 1 times [2019-09-10 06:18:48,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:48,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:48,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:48,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:48,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:49,389 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 06:18:49,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:49,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:18:49,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:49,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:18:49,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:18:49,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:18:49,391 INFO L87 Difference]: Start difference. First operand 34536 states and 41405 transitions. Second operand 15 states. [2019-09-10 06:18:51,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:51,790 INFO L93 Difference]: Finished difference Result 41308 states and 50061 transitions. [2019-09-10 06:18:51,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:18:51,790 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2019-09-10 06:18:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:51,821 INFO L225 Difference]: With dead ends: 41308 [2019-09-10 06:18:51,821 INFO L226 Difference]: Without dead ends: 41308 [2019-09-10 06:18:51,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=356, Invalid=976, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:18:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41308 states. [2019-09-10 06:18:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41308 to 31162. [2019-09-10 06:18:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31162 states. [2019-09-10 06:18:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31162 states to 31162 states and 37084 transitions. [2019-09-10 06:18:52,068 INFO L78 Accepts]: Start accepts. Automaton has 31162 states and 37084 transitions. Word has length 190 [2019-09-10 06:18:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:52,068 INFO L475 AbstractCegarLoop]: Abstraction has 31162 states and 37084 transitions. [2019-09-10 06:18:52,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:18:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 31162 states and 37084 transitions. [2019-09-10 06:18:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:18:52,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:52,076 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 06:18:52,076 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:52,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:52,077 INFO L82 PathProgramCache]: Analyzing trace with hash 974624798, now seen corresponding path program 1 times [2019-09-10 06:18:52,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:52,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:52,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:52,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:52,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:18:52,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:52,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:18:52,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:18:52,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:18:52,445 INFO L87 Difference]: Start difference. First operand 31162 states and 37084 transitions. Second operand 15 states. [2019-09-10 06:18:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:56,690 INFO L93 Difference]: Finished difference Result 63967 states and 79474 transitions. [2019-09-10 06:18:56,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-10 06:18:56,690 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2019-09-10 06:18:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:56,748 INFO L225 Difference]: With dead ends: 63967 [2019-09-10 06:18:56,748 INFO L226 Difference]: Without dead ends: 63960 [2019-09-10 06:18:56,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=973, Invalid=3583, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 06:18:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63960 states. [2019-09-10 06:18:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63960 to 30374. [2019-09-10 06:18:57,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30374 states. [2019-09-10 06:18:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30374 states to 30374 states and 36247 transitions. [2019-09-10 06:18:57,099 INFO L78 Accepts]: Start accepts. Automaton has 30374 states and 36247 transitions. Word has length 190 [2019-09-10 06:18:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:57,099 INFO L475 AbstractCegarLoop]: Abstraction has 30374 states and 36247 transitions. [2019-09-10 06:18:57,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:18:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 30374 states and 36247 transitions. [2019-09-10 06:18:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:18:57,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:57,106 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 06:18:57,106 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:57,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:57,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1954159751, now seen corresponding path program 1 times [2019-09-10 06:18:57,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:57,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:57,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:57,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:57,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:57,363 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 06:18:57,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:57,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:18:57,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:57,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:18:57,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:18:57,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:18:57,364 INFO L87 Difference]: Start difference. First operand 30374 states and 36247 transitions. Second operand 14 states. [2019-09-10 06:18:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:58,597 INFO L93 Difference]: Finished difference Result 25638 states and 30355 transitions. [2019-09-10 06:18:58,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:18:58,597 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 190 [2019-09-10 06:18:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:58,616 INFO L225 Difference]: With dead ends: 25638 [2019-09-10 06:18:58,616 INFO L226 Difference]: Without dead ends: 25638 [2019-09-10 06:18:58,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:18:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25638 states. [2019-09-10 06:18:58,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25638 to 25505. [2019-09-10 06:18:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25505 states. [2019-09-10 06:18:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25505 states to 25505 states and 30222 transitions. [2019-09-10 06:18:58,882 INFO L78 Accepts]: Start accepts. Automaton has 25505 states and 30222 transitions. Word has length 190 [2019-09-10 06:18:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:58,882 INFO L475 AbstractCegarLoop]: Abstraction has 25505 states and 30222 transitions. [2019-09-10 06:18:58,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:18:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 25505 states and 30222 transitions. [2019-09-10 06:18:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:18:58,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:58,888 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 06:18:58,889 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:58,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:58,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1372909647, now seen corresponding path program 1 times [2019-09-10 06:18:58,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:58,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:58,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:58,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:58,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:59,131 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 06:18:59,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:59,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:18:59,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:59,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:18:59,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:18:59,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:18:59,132 INFO L87 Difference]: Start difference. First operand 25505 states and 30222 transitions. Second operand 15 states. [2019-09-10 06:19:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:03,081 INFO L93 Difference]: Finished difference Result 55478 states and 68939 transitions. [2019-09-10 06:19:03,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 06:19:03,081 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2019-09-10 06:19:03,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:03,131 INFO L225 Difference]: With dead ends: 55478 [2019-09-10 06:19:03,131 INFO L226 Difference]: Without dead ends: 55478 [2019-09-10 06:19:03,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=869, Invalid=3163, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 06:19:03,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55478 states. [2019-09-10 06:19:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55478 to 25550. [2019-09-10 06:19:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25550 states. [2019-09-10 06:19:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25550 states to 25550 states and 30248 transitions. [2019-09-10 06:19:03,441 INFO L78 Accepts]: Start accepts. Automaton has 25550 states and 30248 transitions. Word has length 190 [2019-09-10 06:19:03,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:03,442 INFO L475 AbstractCegarLoop]: Abstraction has 25550 states and 30248 transitions. [2019-09-10 06:19:03,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:19:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 25550 states and 30248 transitions. [2019-09-10 06:19:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:19:03,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:03,449 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 06:19:03,449 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:03,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:03,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1846327928, now seen corresponding path program 1 times [2019-09-10 06:19:03,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:03,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:03,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:03,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:03,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:03,909 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 06:19:03,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:03,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:19:03,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:03,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:19:03,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:19:03,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:19:03,910 INFO L87 Difference]: Start difference. First operand 25550 states and 30248 transitions. Second operand 23 states. [2019-09-10 06:19:07,597 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-09-10 06:19:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:10,510 INFO L93 Difference]: Finished difference Result 28848 states and 34399 transitions. [2019-09-10 06:19:10,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 06:19:10,511 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 190 [2019-09-10 06:19:10,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:10,533 INFO L225 Difference]: With dead ends: 28848 [2019-09-10 06:19:10,533 INFO L226 Difference]: Without dead ends: 28848 [2019-09-10 06:19:10,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=935, Invalid=3895, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 06:19:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28848 states. [2019-09-10 06:19:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28848 to 25791. [2019-09-10 06:19:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25791 states. [2019-09-10 06:19:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25791 states to 25791 states and 30496 transitions. [2019-09-10 06:19:10,716 INFO L78 Accepts]: Start accepts. Automaton has 25791 states and 30496 transitions. Word has length 190 [2019-09-10 06:19:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:10,716 INFO L475 AbstractCegarLoop]: Abstraction has 25791 states and 30496 transitions. [2019-09-10 06:19:10,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:19:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 25791 states and 30496 transitions. [2019-09-10 06:19:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:19:10,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:10,722 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 06:19:10,722 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash -942930224, now seen corresponding path program 1 times [2019-09-10 06:19:10,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:10,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:10,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:10,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:10,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:11,182 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 06:19:11,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:11,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 06:19:11,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:11,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:19:11,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:19:11,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:19:11,184 INFO L87 Difference]: Start difference. First operand 25791 states and 30496 transitions. Second operand 20 states. [2019-09-10 06:19:12,377 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 06:19:12,649 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:19:12,794 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 06:19:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:16,988 INFO L93 Difference]: Finished difference Result 57707 states and 71204 transitions. [2019-09-10 06:19:16,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 06:19:16,988 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 190 [2019-09-10 06:19:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:17,041 INFO L225 Difference]: With dead ends: 57707 [2019-09-10 06:19:17,041 INFO L226 Difference]: Without dead ends: 57707 [2019-09-10 06:19:17,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=962, Invalid=4150, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 06:19:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57707 states. [2019-09-10 06:19:17,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57707 to 25379. [2019-09-10 06:19:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25379 states. [2019-09-10 06:19:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25379 states to 25379 states and 30067 transitions. [2019-09-10 06:19:17,553 INFO L78 Accepts]: Start accepts. Automaton has 25379 states and 30067 transitions. Word has length 190 [2019-09-10 06:19:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:17,554 INFO L475 AbstractCegarLoop]: Abstraction has 25379 states and 30067 transitions. [2019-09-10 06:19:17,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:19:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 25379 states and 30067 transitions. [2019-09-10 06:19:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:19:17,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:17,560 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 06:19:17,560 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:17,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash 927575420, now seen corresponding path program 1 times [2019-09-10 06:19:17,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:17,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:17,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:17,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:17,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:18,105 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 06:19:18,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:18,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 06:19:18,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:18,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:19:18,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:19:18,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:19:18,107 INFO L87 Difference]: Start difference. First operand 25379 states and 30067 transitions. Second operand 20 states. [2019-09-10 06:19:18,257 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 06:19:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:22,575 INFO L93 Difference]: Finished difference Result 49352 states and 60767 transitions. [2019-09-10 06:19:22,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 06:19:22,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 190 [2019-09-10 06:19:22,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:22,618 INFO L225 Difference]: With dead ends: 49352 [2019-09-10 06:19:22,618 INFO L226 Difference]: Without dead ends: 49352 [2019-09-10 06:19:22,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=528, Invalid=2778, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 06:19:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49352 states. [2019-09-10 06:19:22,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49352 to 25102. [2019-09-10 06:19:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25102 states. [2019-09-10 06:19:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25102 states to 25102 states and 29701 transitions. [2019-09-10 06:19:22,881 INFO L78 Accepts]: Start accepts. Automaton has 25102 states and 29701 transitions. Word has length 190 [2019-09-10 06:19:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:22,882 INFO L475 AbstractCegarLoop]: Abstraction has 25102 states and 29701 transitions. [2019-09-10 06:19:22,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:19:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 25102 states and 29701 transitions. [2019-09-10 06:19:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:19:22,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:22,888 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 06:19:22,888 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:22,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1554146547, now seen corresponding path program 1 times [2019-09-10 06:19:22,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:22,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:22,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:22,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:22,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:23,220 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 06:19:23,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:23,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:19:23,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:23,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:19:23,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:19:23,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:19:23,221 INFO L87 Difference]: Start difference. First operand 25102 states and 29701 transitions. Second operand 17 states. [2019-09-10 06:19:26,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:26,842 INFO L93 Difference]: Finished difference Result 35869 states and 43063 transitions. [2019-09-10 06:19:26,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 06:19:26,842 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 190 [2019-09-10 06:19:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:26,870 INFO L225 Difference]: With dead ends: 35869 [2019-09-10 06:19:26,870 INFO L226 Difference]: Without dead ends: 35809 [2019-09-10 06:19:26,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=770, Invalid=2652, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 06:19:26,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35809 states. [2019-09-10 06:19:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35809 to 28461. [2019-09-10 06:19:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-09-10 06:19:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 34180 transitions. [2019-09-10 06:19:27,221 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 34180 transitions. Word has length 190 [2019-09-10 06:19:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:27,221 INFO L475 AbstractCegarLoop]: Abstraction has 28461 states and 34180 transitions. [2019-09-10 06:19:27,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:19:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 34180 transitions. [2019-09-10 06:19:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 06:19:27,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:27,228 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 06:19:27,229 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:27,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:27,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1837423045, now seen corresponding path program 1 times [2019-09-10 06:19:27,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:27,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:27,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:27,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:27,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:27,660 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 06:19:27,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:27,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:19:27,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:27,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:19:27,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:19:27,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:19:27,661 INFO L87 Difference]: Start difference. First operand 28461 states and 34180 transitions. Second operand 15 states. [2019-09-10 06:19:28,526 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 06:19:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:30,540 INFO L93 Difference]: Finished difference Result 41395 states and 50524 transitions. [2019-09-10 06:19:30,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:19:30,541 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2019-09-10 06:19:30,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:30,574 INFO L225 Difference]: With dead ends: 41395 [2019-09-10 06:19:30,574 INFO L226 Difference]: Without dead ends: 41369 [2019-09-10 06:19:30,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=267, Invalid=789, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:19:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41369 states. [2019-09-10 06:19:30,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41369 to 24917. [2019-09-10 06:19:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24917 states. [2019-09-10 06:19:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24917 states to 24917 states and 29799 transitions. [2019-09-10 06:19:30,816 INFO L78 Accepts]: Start accepts. Automaton has 24917 states and 29799 transitions. Word has length 190 [2019-09-10 06:19:30,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:30,817 INFO L475 AbstractCegarLoop]: Abstraction has 24917 states and 29799 transitions. [2019-09-10 06:19:30,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:19:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 24917 states and 29799 transitions. [2019-09-10 06:19:30,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 06:19:30,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:30,825 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:30,825 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:30,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:30,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1831209638, now seen corresponding path program 1 times [2019-09-10 06:19:30,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:30,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:30,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:30,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:30,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:30,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:30,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:30,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:30,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:30,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:30,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:30,881 INFO L87 Difference]: Start difference. First operand 24917 states and 29799 transitions. Second operand 3 states. [2019-09-10 06:19:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:30,984 INFO L93 Difference]: Finished difference Result 38459 states and 46974 transitions. [2019-09-10 06:19:30,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:30,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-09-10 06:19:30,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:31,015 INFO L225 Difference]: With dead ends: 38459 [2019-09-10 06:19:31,016 INFO L226 Difference]: Without dead ends: 38459 [2019-09-10 06:19:31,016 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 06:19:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38459 states. [2019-09-10 06:19:31,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38459 to 38337. [2019-09-10 06:19:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38337 states. [2019-09-10 06:19:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38337 states to 38337 states and 46853 transitions. [2019-09-10 06:19:31,316 INFO L78 Accepts]: Start accepts. Automaton has 38337 states and 46853 transitions. Word has length 203 [2019-09-10 06:19:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:31,316 INFO L475 AbstractCegarLoop]: Abstraction has 38337 states and 46853 transitions. [2019-09-10 06:19:31,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 38337 states and 46853 transitions. [2019-09-10 06:19:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 06:19:31,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:31,325 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:31,325 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:31,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash -665901771, now seen corresponding path program 1 times [2019-09-10 06:19:31,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:31,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:31,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:31,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:31,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:31,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:31,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:31,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:31,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:31,380 INFO L87 Difference]: Start difference. First operand 38337 states and 46853 transitions. Second operand 3 states. [2019-09-10 06:19:31,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:31,518 INFO L93 Difference]: Finished difference Result 65707 states and 81778 transitions. [2019-09-10 06:19:31,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:31,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-10 06:19:31,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:31,580 INFO L225 Difference]: With dead ends: 65707 [2019-09-10 06:19:31,580 INFO L226 Difference]: Without dead ends: 65707 [2019-09-10 06:19:31,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 06:19:31,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65707 states. [2019-09-10 06:19:32,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65707 to 65201. [2019-09-10 06:19:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65201 states. [2019-09-10 06:19:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65201 states to 65201 states and 81273 transitions. [2019-09-10 06:19:32,381 INFO L78 Accepts]: Start accepts. Automaton has 65201 states and 81273 transitions. Word has length 204 [2019-09-10 06:19:32,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:32,381 INFO L475 AbstractCegarLoop]: Abstraction has 65201 states and 81273 transitions. [2019-09-10 06:19:32,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 65201 states and 81273 transitions. [2019-09-10 06:19:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-10 06:19:32,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:32,391 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:32,391 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:32,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:32,392 INFO L82 PathProgramCache]: Analyzing trace with hash -625645409, now seen corresponding path program 1 times [2019-09-10 06:19:32,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:32,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:32,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:32,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:32,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:32,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:32,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:32,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:32,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:32,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:32,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:32,447 INFO L87 Difference]: Start difference. First operand 65201 states and 81273 transitions. Second operand 3 states. [2019-09-10 06:19:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:32,713 INFO L93 Difference]: Finished difference Result 119723 states and 151194 transitions. [2019-09-10 06:19:32,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:32,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-10 06:19:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:32,846 INFO L225 Difference]: With dead ends: 119723 [2019-09-10 06:19:32,846 INFO L226 Difference]: Without dead ends: 119723 [2019-09-10 06:19:32,846 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 06:19:32,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119723 states. [2019-09-10 06:19:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119723 to 118713. [2019-09-10 06:19:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118713 states. [2019-09-10 06:19:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118713 states to 118713 states and 150185 transitions. [2019-09-10 06:19:33,789 INFO L78 Accepts]: Start accepts. Automaton has 118713 states and 150185 transitions. Word has length 205 [2019-09-10 06:19:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:33,790 INFO L475 AbstractCegarLoop]: Abstraction has 118713 states and 150185 transitions. [2019-09-10 06:19:33,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 118713 states and 150185 transitions. [2019-09-10 06:19:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 06:19:33,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:33,801 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:33,802 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:33,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:33,802 INFO L82 PathProgramCache]: Analyzing trace with hash 453015929, now seen corresponding path program 1 times [2019-09-10 06:19:33,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:33,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:33,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:33,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:33,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:33,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:33,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:19:33,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:33,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:19:33,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:19:33,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:19:33,924 INFO L87 Difference]: Start difference. First operand 118713 states and 150185 transitions. Second operand 8 states. [2019-09-10 06:19:34,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:34,555 INFO L93 Difference]: Finished difference Result 134303 states and 168831 transitions. [2019-09-10 06:19:34,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:19:34,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 207 [2019-09-10 06:19:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:34,697 INFO L225 Difference]: With dead ends: 134303 [2019-09-10 06:19:34,697 INFO L226 Difference]: Without dead ends: 134303 [2019-09-10 06:19:34,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:19:34,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134303 states. [2019-09-10 06:19:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134303 to 99297. [2019-09-10 06:19:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99297 states. [2019-09-10 06:19:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99297 states to 99297 states and 124889 transitions. [2019-09-10 06:19:37,766 INFO L78 Accepts]: Start accepts. Automaton has 99297 states and 124889 transitions. Word has length 207 [2019-09-10 06:19:37,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:37,766 INFO L475 AbstractCegarLoop]: Abstraction has 99297 states and 124889 transitions. [2019-09-10 06:19:37,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:19:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 99297 states and 124889 transitions. [2019-09-10 06:19:37,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 06:19:37,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:37,777 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:37,777 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:37,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:37,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1281966644, now seen corresponding path program 1 times [2019-09-10 06:19:37,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:37,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:37,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:37,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:37,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:37,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:19:37,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:37,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:19:37,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:19:37,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:19:37,838 INFO L87 Difference]: Start difference. First operand 99297 states and 124889 transitions. Second operand 4 states. [2019-09-10 06:19:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:38,149 INFO L93 Difference]: Finished difference Result 127111 states and 159679 transitions. [2019-09-10 06:19:38,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:19:38,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-09-10 06:19:38,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:38,288 INFO L225 Difference]: With dead ends: 127111 [2019-09-10 06:19:38,289 INFO L226 Difference]: Without dead ends: 127111 [2019-09-10 06:19:38,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 06:19:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127111 states. [2019-09-10 06:19:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127111 to 81921. [2019-09-10 06:19:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81921 states. [2019-09-10 06:19:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81921 states to 81921 states and 102281 transitions. [2019-09-10 06:19:39,095 INFO L78 Accepts]: Start accepts. Automaton has 81921 states and 102281 transitions. Word has length 207 [2019-09-10 06:19:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:39,096 INFO L475 AbstractCegarLoop]: Abstraction has 81921 states and 102281 transitions. [2019-09-10 06:19:39,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:19:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 81921 states and 102281 transitions. [2019-09-10 06:19:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 06:19:39,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:39,108 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:39,108 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:39,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:39,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1893410583, now seen corresponding path program 1 times [2019-09-10 06:19:39,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:39,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:39,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:39,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:39,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:39,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:39,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:19:39,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:39,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:19:39,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:19:39,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:19:39,267 INFO L87 Difference]: Start difference. First operand 81921 states and 102281 transitions. Second operand 9 states. [2019-09-10 06:19:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:40,644 INFO L93 Difference]: Finished difference Result 278357 states and 350222 transitions. [2019-09-10 06:19:40,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:19:40,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2019-09-10 06:19:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:41,726 INFO L225 Difference]: With dead ends: 278357 [2019-09-10 06:19:41,726 INFO L226 Difference]: Without dead ends: 278357 [2019-09-10 06:19:41,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:19:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278357 states. [2019-09-10 06:19:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278357 to 213757. [2019-09-10 06:19:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213757 states. [2019-09-10 06:19:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213757 states to 213757 states and 270518 transitions. [2019-09-10 06:19:43,600 INFO L78 Accepts]: Start accepts. Automaton has 213757 states and 270518 transitions. Word has length 207 [2019-09-10 06:19:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:43,600 INFO L475 AbstractCegarLoop]: Abstraction has 213757 states and 270518 transitions. [2019-09-10 06:19:43,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:19:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 213757 states and 270518 transitions. [2019-09-10 06:19:43,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 06:19:43,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:43,612 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:43,612 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:43,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:43,612 INFO L82 PathProgramCache]: Analyzing trace with hash 122523658, now seen corresponding path program 1 times [2019-09-10 06:19:43,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:43,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:43,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:43,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:43,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:46,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:46,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:19:46,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:46,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:19:46,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:19:46,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:19:46,775 INFO L87 Difference]: Start difference. First operand 213757 states and 270518 transitions. Second operand 9 states. [2019-09-10 06:19:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:48,698 INFO L93 Difference]: Finished difference Result 547294 states and 694451 transitions. [2019-09-10 06:19:48,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:19:48,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2019-09-10 06:19:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:49,446 INFO L225 Difference]: With dead ends: 547294 [2019-09-10 06:19:49,447 INFO L226 Difference]: Without dead ends: 547294 [2019-09-10 06:19:49,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:19:49,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547294 states. [2019-09-10 06:19:54,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547294 to 452821. [2019-09-10 06:19:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452821 states. [2019-09-10 06:19:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452821 states to 452821 states and 576251 transitions. [2019-09-10 06:19:55,004 INFO L78 Accepts]: Start accepts. Automaton has 452821 states and 576251 transitions. Word has length 207 [2019-09-10 06:19:55,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:55,004 INFO L475 AbstractCegarLoop]: Abstraction has 452821 states and 576251 transitions. [2019-09-10 06:19:55,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:19:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 452821 states and 576251 transitions. [2019-09-10 06:19:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 06:19:55,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:55,017 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:55,017 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:55,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:55,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1823500478, now seen corresponding path program 1 times [2019-09-10 06:19:55,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:55,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:55,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:55,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:55,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:55,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:55,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:19:55,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:55,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:19:55,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:19:55,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:19:55,170 INFO L87 Difference]: Start difference. First operand 452821 states and 576251 transitions. Second operand 9 states. [2019-09-10 06:20:09,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:09,798 INFO L93 Difference]: Finished difference Result 1382083 states and 1748370 transitions. [2019-09-10 06:20:09,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:20:09,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 208 [2019-09-10 06:20:09,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:11,727 INFO L225 Difference]: With dead ends: 1382083 [2019-09-10 06:20:11,727 INFO L226 Difference]: Without dead ends: 1382083 [2019-09-10 06:20:11,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:20:12,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382083 states. [2019-09-10 06:20:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382083 to 1101881. [2019-09-10 06:20:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101881 states. [2019-09-10 06:20:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101881 states to 1101881 states and 1407497 transitions. [2019-09-10 06:20:57,370 INFO L78 Accepts]: Start accepts. Automaton has 1101881 states and 1407497 transitions. Word has length 208 [2019-09-10 06:20:57,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:57,371 INFO L475 AbstractCegarLoop]: Abstraction has 1101881 states and 1407497 transitions. [2019-09-10 06:20:57,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:20:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1101881 states and 1407497 transitions. [2019-09-10 06:20:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 06:20:57,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:57,383 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:20:57,383 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:57,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:57,384 INFO L82 PathProgramCache]: Analyzing trace with hash -548172146, now seen corresponding path program 1 times [2019-09-10 06:20:57,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:57,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:57,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:57,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:57,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:57,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:57,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:20:57,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:57,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:20:57,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:20:57,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:57,447 INFO L87 Difference]: Start difference. First operand 1101881 states and 1407497 transitions. Second operand 4 states. [2019-09-10 06:21:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:02,569 INFO L93 Difference]: Finished difference Result 1399187 states and 1779433 transitions. [2019-09-10 06:21:02,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:21:02,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-09-10 06:21:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:15,241 INFO L225 Difference]: With dead ends: 1399187 [2019-09-10 06:21:15,241 INFO L226 Difference]: Without dead ends: 1399187 [2019-09-10 06:21:15,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 06:21:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399187 states. [2019-09-10 06:21:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399187 to 1005538. [2019-09-10 06:21:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005538 states. [2019-09-10 06:21:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005538 states to 1005538 states and 1283392 transitions. [2019-09-10 06:21:42,333 INFO L78 Accepts]: Start accepts. Automaton has 1005538 states and 1283392 transitions. Word has length 208 [2019-09-10 06:21:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:42,333 INFO L475 AbstractCegarLoop]: Abstraction has 1005538 states and 1283392 transitions. [2019-09-10 06:21:42,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:21:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1005538 states and 1283392 transitions. [2019-09-10 06:21:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 06:21:42,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:42,346 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:21:42,346 INFO L418 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:42,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:42,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1054110973, now seen corresponding path program 1 times [2019-09-10 06:21:42,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:42,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:42,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:42,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:42,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:42,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:42,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:21:42,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:42,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:21:42,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:21:42,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:21:42,427 INFO L87 Difference]: Start difference. First operand 1005538 states and 1283392 transitions. Second operand 4 states.