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.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:11:37,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:11:37,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:11:37,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:11:37,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:11:37,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:11:37,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:11:37,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:11:37,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:11:37,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:11:37,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:11:37,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:11:37,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:11:37,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:11:37,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:11:37,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:11:37,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:11:37,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:11:37,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:11:37,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:11:37,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:11:37,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:11:37,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:11:37,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:11:37,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:11:37,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:11:37,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:11:37,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:11:37,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:11:37,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:11:37,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:11:37,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:11:37,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:11:37,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:11:37,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:11:37,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:11:37,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:11:37,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:11:37,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:11:37,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:11:37,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:11:37,680 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:11:37,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:11:37,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:11:37,719 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:11:37,720 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:11:37,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:11:37,721 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:11:37,721 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:11:37,721 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:11:37,721 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:11:37,721 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:11:37,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:11:37,724 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:11:37,724 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:11:37,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:11:37,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:11:37,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:11:37,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:11:37,727 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:11:37,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:11:37,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:11:37,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:11:37,728 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:11:37,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:11:37,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:11:37,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:11:37,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:11:37,729 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:11:37,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:11:37,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:11:37,729 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:11:37,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:11:37,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:11:37,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:11:37,798 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:11:37,798 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:11:37,799 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:11:37,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2858016f5/98f3d5016a0849baaff4c4d244378926/FLAG3347f4224 [2019-09-10 06:11:38,377 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:11:38,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:11:38,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2858016f5/98f3d5016a0849baaff4c4d244378926/FLAG3347f4224 [2019-09-10 06:11:38,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2858016f5/98f3d5016a0849baaff4c4d244378926 [2019-09-10 06:11:38,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:11:38,641 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:11:38,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:11:38,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:11:38,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:11:38,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:11:38" (1/1) ... [2019-09-10 06:11:38,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f829b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:38, skipping insertion in model container [2019-09-10 06:11:38,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:11:38" (1/1) ... [2019-09-10 06:11:38,659 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:11:38,745 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:11:39,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:11:39,374 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:11:39,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:11:39,850 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:11:39,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:39 WrapperNode [2019-09-10 06:11:39,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:11:39,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:11:39,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:11:39,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:11:39,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:39" (1/1) ... [2019-09-10 06:11:39,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:39" (1/1) ... [2019-09-10 06:11:39,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:39" (1/1) ... [2019-09-10 06:11:39,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:39" (1/1) ... [2019-09-10 06:11:39,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:39" (1/1) ... [2019-09-10 06:11:39,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:39" (1/1) ... [2019-09-10 06:11:39,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:39" (1/1) ... [2019-09-10 06:11:39,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:11:39,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:11:39,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:11:39,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:11:39,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:39" (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:11:40,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:11:40,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:11:40,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:11:40,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:11:40,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:11:40,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:11:40,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:11:40,070 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:11:40,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:11:40,070 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:11:40,070 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:11:40,070 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:11:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:11:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:11:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:11:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:11:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:11:40,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:11:40,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:11:41,774 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:11:41,774 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:11:41,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:11:41 BoogieIcfgContainer [2019-09-10 06:11:41,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:11:41,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:11:41,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:11:41,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:11:41,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:11:38" (1/3) ... [2019-09-10 06:11:41,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:11:41, skipping insertion in model container [2019-09-10 06:11:41,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:11:39" (2/3) ... [2019-09-10 06:11:41,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:11:41, skipping insertion in model container [2019-09-10 06:11:41,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:11:41" (3/3) ... [2019-09-10 06:11:41,795 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:11:41,807 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:11:41,832 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-09-10 06:11:41,853 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-09-10 06:11:41,887 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:11:41,887 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:11:41,887 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:11:41,887 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:11:41,888 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:11:41,888 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:11:41,888 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:11:41,888 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:11:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states. [2019-09-10 06:11:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 06:11:41,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:41,975 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] [2019-09-10 06:11:41,977 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1100628629, now seen corresponding path program 1 times [2019-09-10 06:11:41,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:42,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:42,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:42,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:42,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:42,650 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:42,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:42,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:42,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:42,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:42,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:42,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:42,677 INFO L87 Difference]: Start difference. First operand 393 states. Second operand 3 states. [2019-09-10 06:11:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:42,893 INFO L93 Difference]: Finished difference Result 576 states and 1013 transitions. [2019-09-10 06:11:42,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:42,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-09-10 06:11:42,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:42,919 INFO L225 Difference]: With dead ends: 576 [2019-09-10 06:11:42,920 INFO L226 Difference]: Without dead ends: 568 [2019-09-10 06:11:42,921 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:42,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-10 06:11:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2019-09-10 06:11:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-09-10 06:11:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 826 transitions. [2019-09-10 06:11:43,004 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 826 transitions. Word has length 145 [2019-09-10 06:11:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:43,005 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 826 transitions. [2019-09-10 06:11:43,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 826 transitions. [2019-09-10 06:11:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 06:11:43,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:43,009 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] [2019-09-10 06:11:43,010 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:43,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:43,010 INFO L82 PathProgramCache]: Analyzing trace with hash -39383595, now seen corresponding path program 1 times [2019-09-10 06:11:43,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:43,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:43,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:43,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:43,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:43,239 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:43,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:43,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:43,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:43,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:43,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:43,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:43,244 INFO L87 Difference]: Start difference. First operand 566 states and 826 transitions. Second operand 3 states. [2019-09-10 06:11:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:43,417 INFO L93 Difference]: Finished difference Result 940 states and 1396 transitions. [2019-09-10 06:11:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:43,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-09-10 06:11:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:43,425 INFO L225 Difference]: With dead ends: 940 [2019-09-10 06:11:43,425 INFO L226 Difference]: Without dead ends: 940 [2019-09-10 06:11:43,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-09-10 06:11:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 938. [2019-09-10 06:11:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2019-09-10 06:11:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1395 transitions. [2019-09-10 06:11:43,508 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1395 transitions. Word has length 145 [2019-09-10 06:11:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:43,509 INFO L475 AbstractCegarLoop]: Abstraction has 938 states and 1395 transitions. [2019-09-10 06:11:43,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1395 transitions. [2019-09-10 06:11:43,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 06:11:43,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:43,515 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] [2019-09-10 06:11:43,515 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:43,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:43,516 INFO L82 PathProgramCache]: Analyzing trace with hash -39722219, now seen corresponding path program 1 times [2019-09-10 06:11:43,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:43,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:43,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:43,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:43,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:43,820 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:43,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:43,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:43,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:43,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:43,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:43,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:43,825 INFO L87 Difference]: Start difference. First operand 938 states and 1395 transitions. Second operand 4 states. [2019-09-10 06:11:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:43,945 INFO L93 Difference]: Finished difference Result 1815 states and 2668 transitions. [2019-09-10 06:11:43,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:43,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-10 06:11:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:43,959 INFO L225 Difference]: With dead ends: 1815 [2019-09-10 06:11:43,959 INFO L226 Difference]: Without dead ends: 1815 [2019-09-10 06:11:43,959 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:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-09-10 06:11:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1773. [2019-09-10 06:11:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-09-10 06:11:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2622 transitions. [2019-09-10 06:11:44,018 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2622 transitions. Word has length 145 [2019-09-10 06:11:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:44,019 INFO L475 AbstractCegarLoop]: Abstraction has 1773 states and 2622 transitions. [2019-09-10 06:11:44,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2622 transitions. [2019-09-10 06:11:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 06:11:44,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:44,024 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] [2019-09-10 06:11:44,024 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:44,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:44,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1124234717, now seen corresponding path program 1 times [2019-09-10 06:11:44,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:44,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:44,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:44,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:44,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:44,108 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,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:44,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:44,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:44,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:44,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:44,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:44,111 INFO L87 Difference]: Start difference. First operand 1773 states and 2622 transitions. Second operand 3 states. [2019-09-10 06:11:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:44,183 INFO L93 Difference]: Finished difference Result 3532 states and 5223 transitions. [2019-09-10 06:11:44,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:44,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-10 06:11:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:44,202 INFO L225 Difference]: With dead ends: 3532 [2019-09-10 06:11:44,203 INFO L226 Difference]: Without dead ends: 3532 [2019-09-10 06:11:44,203 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:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3532 states. [2019-09-10 06:11:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3532 to 1775. [2019-09-10 06:11:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2019-09-10 06:11:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2624 transitions. [2019-09-10 06:11:44,275 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2624 transitions. Word has length 146 [2019-09-10 06:11:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:44,275 INFO L475 AbstractCegarLoop]: Abstraction has 1775 states and 2624 transitions. [2019-09-10 06:11:44,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2624 transitions. [2019-09-10 06:11:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 06:11:44,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:44,281 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:44,281 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:44,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:44,282 INFO L82 PathProgramCache]: Analyzing trace with hash 954016116, now seen corresponding path program 1 times [2019-09-10 06:11:44,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:44,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:44,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:44,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:44,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:44,511 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,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:44,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:44,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:44,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:44,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:44,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:44,514 INFO L87 Difference]: Start difference. First operand 1775 states and 2624 transitions. Second operand 4 states. [2019-09-10 06:11:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:44,565 INFO L93 Difference]: Finished difference Result 1833 states and 2706 transitions. [2019-09-10 06:11:44,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:44,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-09-10 06:11:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:44,574 INFO L225 Difference]: With dead ends: 1833 [2019-09-10 06:11:44,575 INFO L226 Difference]: Without dead ends: 1773 [2019-09-10 06:11:44,575 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:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-10 06:11:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2019-09-10 06:11:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-09-10 06:11:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2620 transitions. [2019-09-10 06:11:44,622 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2620 transitions. Word has length 147 [2019-09-10 06:11:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:44,623 INFO L475 AbstractCegarLoop]: Abstraction has 1773 states and 2620 transitions. [2019-09-10 06:11:44,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2620 transitions. [2019-09-10 06:11:44,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 06:11:44,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:44,627 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:44,628 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:44,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:44,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1883184417, now seen corresponding path program 1 times [2019-09-10 06:11:44,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:44,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:44,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:44,742 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,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:44,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:44,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:44,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:44,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:44,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:44,744 INFO L87 Difference]: Start difference. First operand 1773 states and 2620 transitions. Second operand 3 states. [2019-09-10 06:11:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:44,824 INFO L93 Difference]: Finished difference Result 2649 states and 3848 transitions. [2019-09-10 06:11:44,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:44,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-09-10 06:11:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:44,839 INFO L225 Difference]: With dead ends: 2649 [2019-09-10 06:11:44,839 INFO L226 Difference]: Without dead ends: 2649 [2019-09-10 06:11:44,839 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:44,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2019-09-10 06:11:44,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2607. [2019-09-10 06:11:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2019-09-10 06:11:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3802 transitions. [2019-09-10 06:11:44,945 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3802 transitions. Word has length 147 [2019-09-10 06:11:44,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:44,946 INFO L475 AbstractCegarLoop]: Abstraction has 2607 states and 3802 transitions. [2019-09-10 06:11:44,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:44,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3802 transitions. [2019-09-10 06:11:44,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 06:11:44,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:44,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:44,953 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:44,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:44,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1722499153, now seen corresponding path program 1 times [2019-09-10 06:11:44,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:44,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:44,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:44,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:44,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:45,171 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:45,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:45,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:45,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:45,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:45,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:45,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:45,173 INFO L87 Difference]: Start difference. First operand 2607 states and 3802 transitions. Second operand 3 states. [2019-09-10 06:11:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:45,533 INFO L93 Difference]: Finished difference Result 5004 states and 7262 transitions. [2019-09-10 06:11:45,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:45,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-10 06:11:45,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:45,559 INFO L225 Difference]: With dead ends: 5004 [2019-09-10 06:11:45,559 INFO L226 Difference]: Without dead ends: 5004 [2019-09-10 06:11:45,560 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:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5004 states. [2019-09-10 06:11:45,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5004 to 4962. [2019-09-10 06:11:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4962 states. [2019-09-10 06:11:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4962 states to 4962 states and 7216 transitions. [2019-09-10 06:11:45,746 INFO L78 Accepts]: Start accepts. Automaton has 4962 states and 7216 transitions. Word has length 153 [2019-09-10 06:11:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:45,746 INFO L475 AbstractCegarLoop]: Abstraction has 4962 states and 7216 transitions. [2019-09-10 06:11:45,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 4962 states and 7216 transitions. [2019-09-10 06:11:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 06:11:45,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:45,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:45,757 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:45,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:45,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1165348778, now seen corresponding path program 1 times [2019-09-10 06:11:45,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:45,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:45,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:45,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:45,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:46,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:46,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:11:46,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:46,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:11:46,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:11:46,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:46,086 INFO L87 Difference]: Start difference. First operand 4962 states and 7216 transitions. Second operand 5 states. [2019-09-10 06:11:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:46,525 INFO L93 Difference]: Finished difference Result 7252 states and 10816 transitions. [2019-09-10 06:11:46,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:11:46,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-10 06:11:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:46,560 INFO L225 Difference]: With dead ends: 7252 [2019-09-10 06:11:46,560 INFO L226 Difference]: Without dead ends: 7232 [2019-09-10 06:11:46,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:46,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7232 states. [2019-09-10 06:11:46,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7232 to 7230. [2019-09-10 06:11:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2019-09-10 06:11:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 10791 transitions. [2019-09-10 06:11:46,743 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 10791 transitions. Word has length 153 [2019-09-10 06:11:46,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:46,744 INFO L475 AbstractCegarLoop]: Abstraction has 7230 states and 10791 transitions. [2019-09-10 06:11:46,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:11:46,744 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 10791 transitions. [2019-09-10 06:11:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 06:11:46,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:46,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:46,755 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash 75057812, now seen corresponding path program 1 times [2019-09-10 06:11:46,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:46,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:46,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:46,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:46,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:47,627 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:47,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:47,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:11:47,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:47,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:11:47,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:11:47,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:11:47,630 INFO L87 Difference]: Start difference. First operand 7230 states and 10791 transitions. Second operand 16 states. [2019-09-10 06:11:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:50,592 INFO L93 Difference]: Finished difference Result 15571 states and 23634 transitions. [2019-09-10 06:11:50,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:11:50,593 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 153 [2019-09-10 06:11:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:50,638 INFO L225 Difference]: With dead ends: 15571 [2019-09-10 06:11:50,639 INFO L226 Difference]: Without dead ends: 15571 [2019-09-10 06:11:50,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:11:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15571 states. [2019-09-10 06:11:50,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15571 to 8010. [2019-09-10 06:11:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8010 states. [2019-09-10 06:11:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8010 states to 8010 states and 11798 transitions. [2019-09-10 06:11:50,831 INFO L78 Accepts]: Start accepts. Automaton has 8010 states and 11798 transitions. Word has length 153 [2019-09-10 06:11:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:50,832 INFO L475 AbstractCegarLoop]: Abstraction has 8010 states and 11798 transitions. [2019-09-10 06:11:50,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:11:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states and 11798 transitions. [2019-09-10 06:11:50,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 06:11:50,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:50,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:50,844 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:50,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1758097192, now seen corresponding path program 1 times [2019-09-10 06:11:50,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:50,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:50,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:50,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:50,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:51,046 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:51,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:51,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:51,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:51,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:51,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:51,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:51,049 INFO L87 Difference]: Start difference. First operand 8010 states and 11798 transitions. Second operand 4 states. [2019-09-10 06:11:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:51,189 INFO L93 Difference]: Finished difference Result 13211 states and 19202 transitions. [2019-09-10 06:11:51,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:51,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-10 06:11:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:51,222 INFO L225 Difference]: With dead ends: 13211 [2019-09-10 06:11:51,222 INFO L226 Difference]: Without dead ends: 13203 [2019-09-10 06:11:51,223 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:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13203 states. [2019-09-10 06:11:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13203 to 13173. [2019-09-10 06:11:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13173 states. [2019-09-10 06:11:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13173 states to 13173 states and 19164 transitions. [2019-09-10 06:11:51,510 INFO L78 Accepts]: Start accepts. Automaton has 13173 states and 19164 transitions. Word has length 153 [2019-09-10 06:11:51,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:51,510 INFO L475 AbstractCegarLoop]: Abstraction has 13173 states and 19164 transitions. [2019-09-10 06:11:51,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:51,511 INFO L276 IsEmpty]: Start isEmpty. Operand 13173 states and 19164 transitions. [2019-09-10 06:11:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 06:11:51,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:51,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] [2019-09-10 06:11:51,530 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:51,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1857061442, now seen corresponding path program 1 times [2019-09-10 06:11:51,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:51,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:51,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:51,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:51,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:51,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:11:51,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:51,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:51,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:51,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:51,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:51,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:51,643 INFO L87 Difference]: Start difference. First operand 13173 states and 19164 transitions. Second operand 3 states. [2019-09-10 06:11:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:51,763 INFO L93 Difference]: Finished difference Result 23025 states and 33036 transitions. [2019-09-10 06:11:51,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:51,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-10 06:11:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:51,816 INFO L225 Difference]: With dead ends: 23025 [2019-09-10 06:11:51,816 INFO L226 Difference]: Without dead ends: 23025 [2019-09-10 06:11:51,817 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:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23025 states. [2019-09-10 06:11:52,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23025 to 22999. [2019-09-10 06:11:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22999 states. [2019-09-10 06:11:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22999 states to 22999 states and 33014 transitions. [2019-09-10 06:11:52,238 INFO L78 Accepts]: Start accepts. Automaton has 22999 states and 33014 transitions. Word has length 155 [2019-09-10 06:11:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:52,239 INFO L475 AbstractCegarLoop]: Abstraction has 22999 states and 33014 transitions. [2019-09-10 06:11:52,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 22999 states and 33014 transitions. [2019-09-10 06:11:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 06:11:52,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:52,268 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:52,269 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:52,269 INFO L82 PathProgramCache]: Analyzing trace with hash 407563333, now seen corresponding path program 1 times [2019-09-10 06:11:52,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:52,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:52,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:52,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:52,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:52,415 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:52,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:52,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:52,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:52,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:52,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:52,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:52,418 INFO L87 Difference]: Start difference. First operand 22999 states and 33014 transitions. Second operand 4 states. [2019-09-10 06:11:52,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:52,497 INFO L93 Difference]: Finished difference Result 20523 states and 29423 transitions. [2019-09-10 06:11:52,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:52,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-10 06:11:52,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:52,541 INFO L225 Difference]: With dead ends: 20523 [2019-09-10 06:11:52,541 INFO L226 Difference]: Without dead ends: 20475 [2019-09-10 06:11:52,541 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:52,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20475 states. [2019-09-10 06:11:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20475 to 20475. [2019-09-10 06:11:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20475 states. [2019-09-10 06:11:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20475 states to 20475 states and 29360 transitions. [2019-09-10 06:11:52,881 INFO L78 Accepts]: Start accepts. Automaton has 20475 states and 29360 transitions. Word has length 155 [2019-09-10 06:11:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:52,881 INFO L475 AbstractCegarLoop]: Abstraction has 20475 states and 29360 transitions. [2019-09-10 06:11:52,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:52,881 INFO L276 IsEmpty]: Start isEmpty. Operand 20475 states and 29360 transitions. [2019-09-10 06:11:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 06:11:52,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:52,908 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] [2019-09-10 06:11:52,908 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:52,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:52,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1059667643, now seen corresponding path program 1 times [2019-09-10 06:11:52,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:52,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:52,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:52,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:52,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:53,111 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:53,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:53,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:53,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:53,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:53,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:53,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:53,113 INFO L87 Difference]: Start difference. First operand 20475 states and 29360 transitions. Second operand 4 states. [2019-09-10 06:11:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:53,520 INFO L93 Difference]: Finished difference Result 39519 states and 55905 transitions. [2019-09-10 06:11:53,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:53,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-10 06:11:53,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:53,621 INFO L225 Difference]: With dead ends: 39519 [2019-09-10 06:11:53,622 INFO L226 Difference]: Without dead ends: 39519 [2019-09-10 06:11:53,622 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:53,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39519 states. [2019-09-10 06:11:54,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39519 to 39453. [2019-09-10 06:11:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39453 states. [2019-09-10 06:11:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39453 states to 39453 states and 55833 transitions. [2019-09-10 06:11:54,266 INFO L78 Accepts]: Start accepts. Automaton has 39453 states and 55833 transitions. Word has length 161 [2019-09-10 06:11:54,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:54,267 INFO L475 AbstractCegarLoop]: Abstraction has 39453 states and 55833 transitions. [2019-09-10 06:11:54,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 39453 states and 55833 transitions. [2019-09-10 06:11:54,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 06:11:54,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:54,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:54,308 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:54,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:54,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1694101877, now seen corresponding path program 1 times [2019-09-10 06:11:54,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:54,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:54,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:54,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:54,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:54,373 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:54,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:54,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:54,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:54,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:54,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:54,375 INFO L87 Difference]: Start difference. First operand 39453 states and 55833 transitions. Second operand 3 states. [2019-09-10 06:11:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:55,279 INFO L93 Difference]: Finished difference Result 78817 states and 111551 transitions. [2019-09-10 06:11:55,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:55,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-09-10 06:11:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:55,443 INFO L225 Difference]: With dead ends: 78817 [2019-09-10 06:11:55,443 INFO L226 Difference]: Without dead ends: 78817 [2019-09-10 06:11:55,445 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:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78817 states. [2019-09-10 06:11:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78817 to 39459. [2019-09-10 06:11:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39459 states. [2019-09-10 06:11:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39459 states to 39459 states and 55839 transitions. [2019-09-10 06:11:56,575 INFO L78 Accepts]: Start accepts. Automaton has 39459 states and 55839 transitions. Word has length 162 [2019-09-10 06:11:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:56,576 INFO L475 AbstractCegarLoop]: Abstraction has 39459 states and 55839 transitions. [2019-09-10 06:11:56,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 39459 states and 55839 transitions. [2019-09-10 06:11:56,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 06:11:56,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:56,593 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] [2019-09-10 06:11:56,594 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:56,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:56,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1785958291, now seen corresponding path program 1 times [2019-09-10 06:11:56,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:56,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:56,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:56,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:56,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:56,705 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:56,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:56,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:56,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:56,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:56,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:56,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:56,707 INFO L87 Difference]: Start difference. First operand 39459 states and 55839 transitions. Second operand 3 states. [2019-09-10 06:11:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:56,880 INFO L93 Difference]: Finished difference Result 65146 states and 90146 transitions. [2019-09-10 06:11:56,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:56,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-10 06:11:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:56,994 INFO L225 Difference]: With dead ends: 65146 [2019-09-10 06:11:56,994 INFO L226 Difference]: Without dead ends: 65146 [2019-09-10 06:11:56,995 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:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65146 states. [2019-09-10 06:11:58,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65146 to 65080. [2019-09-10 06:11:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65080 states. [2019-09-10 06:11:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65080 states to 65080 states and 90074 transitions. [2019-09-10 06:11:58,796 INFO L78 Accepts]: Start accepts. Automaton has 65080 states and 90074 transitions. Word has length 163 [2019-09-10 06:11:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:58,796 INFO L475 AbstractCegarLoop]: Abstraction has 65080 states and 90074 transitions. [2019-09-10 06:11:58,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 65080 states and 90074 transitions. [2019-09-10 06:11:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 06:11:58,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:58,832 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] [2019-09-10 06:11:58,832 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:58,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:58,832 INFO L82 PathProgramCache]: Analyzing trace with hash 383913008, now seen corresponding path program 1 times [2019-09-10 06:11:58,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:58,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:58,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:58,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:58,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:58,987 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:58,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:58,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:58,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:58,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:58,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:58,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:58,992 INFO L87 Difference]: Start difference. First operand 65080 states and 90074 transitions. Second operand 4 states. [2019-09-10 06:11:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:59,158 INFO L93 Difference]: Finished difference Result 58683 states and 81543 transitions. [2019-09-10 06:11:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:59,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-10 06:11:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:59,233 INFO L225 Difference]: With dead ends: 58683 [2019-09-10 06:11:59,233 INFO L226 Difference]: Without dead ends: 58492 [2019-09-10 06:11:59,234 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:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58492 states. [2019-09-10 06:12:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58492 to 58492. [2019-09-10 06:12:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58492 states. [2019-09-10 06:12:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58492 states to 58492 states and 81315 transitions. [2019-09-10 06:12:01,450 INFO L78 Accepts]: Start accepts. Automaton has 58492 states and 81315 transitions. Word has length 163 [2019-09-10 06:12:01,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:01,451 INFO L475 AbstractCegarLoop]: Abstraction has 58492 states and 81315 transitions. [2019-09-10 06:12:01,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 58492 states and 81315 transitions. [2019-09-10 06:12:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 06:12:01,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:01,483 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] [2019-09-10 06:12:01,484 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:01,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:01,484 INFO L82 PathProgramCache]: Analyzing trace with hash -326098423, now seen corresponding path program 1 times [2019-09-10 06:12:01,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:01,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:01,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:01,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:01,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:01,567 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:01,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:01,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:01,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:01,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:01,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:01,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:01,569 INFO L87 Difference]: Start difference. First operand 58492 states and 81315 transitions. Second operand 3 states. [2019-09-10 06:12:02,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:02,001 INFO L93 Difference]: Finished difference Result 75252 states and 106825 transitions. [2019-09-10 06:12:02,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:02,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-10 06:12:02,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:02,085 INFO L225 Difference]: With dead ends: 75252 [2019-09-10 06:12:02,085 INFO L226 Difference]: Without dead ends: 75252 [2019-09-10 06:12:02,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75252 states. [2019-09-10 06:12:03,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75252 to 67292. [2019-09-10 06:12:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67292 states. [2019-09-10 06:12:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67292 states to 67292 states and 94675 transitions. [2019-09-10 06:12:03,133 INFO L78 Accepts]: Start accepts. Automaton has 67292 states and 94675 transitions. Word has length 169 [2019-09-10 06:12:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:03,133 INFO L475 AbstractCegarLoop]: Abstraction has 67292 states and 94675 transitions. [2019-09-10 06:12:03,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 67292 states and 94675 transitions. [2019-09-10 06:12:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 06:12:03,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:03,160 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] [2019-09-10 06:12:03,161 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:03,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:03,161 INFO L82 PathProgramCache]: Analyzing trace with hash 864545294, now seen corresponding path program 1 times [2019-09-10 06:12:03,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:03,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:03,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:03,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:03,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:03,280 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:03,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:03,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:03,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:03,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:03,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:03,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:03,283 INFO L87 Difference]: Start difference. First operand 67292 states and 94675 transitions. Second operand 3 states. [2019-09-10 06:12:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:03,881 INFO L93 Difference]: Finished difference Result 120765 states and 169356 transitions. [2019-09-10 06:12:03,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:03,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-10 06:12:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:04,045 INFO L225 Difference]: With dead ends: 120765 [2019-09-10 06:12:04,045 INFO L226 Difference]: Without dead ends: 120765 [2019-09-10 06:12:04,045 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:12:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120765 states. [2019-09-10 06:12:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120765 to 119971. [2019-09-10 06:12:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119971 states. [2019-09-10 06:12:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119971 states to 119971 states and 168388 transitions. [2019-09-10 06:12:05,874 INFO L78 Accepts]: Start accepts. Automaton has 119971 states and 168388 transitions. Word has length 169 [2019-09-10 06:12:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:05,875 INFO L475 AbstractCegarLoop]: Abstraction has 119971 states and 168388 transitions. [2019-09-10 06:12:05,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 119971 states and 168388 transitions. [2019-09-10 06:12:05,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 06:12:05,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:05,921 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] [2019-09-10 06:12:05,921 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:05,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:05,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2142966253, now seen corresponding path program 1 times [2019-09-10 06:12:05,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:05,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:05,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:05,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:05,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:06,060 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:06,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:06,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:12:06,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:06,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:12:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:12:06,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:06,061 INFO L87 Difference]: Start difference. First operand 119971 states and 168388 transitions. Second operand 5 states. [2019-09-10 06:12:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:06,438 INFO L93 Difference]: Finished difference Result 67292 states and 93548 transitions. [2019-09-10 06:12:06,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:12:06,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-09-10 06:12:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:06,501 INFO L225 Difference]: With dead ends: 67292 [2019-09-10 06:12:06,501 INFO L226 Difference]: Without dead ends: 67292 [2019-09-10 06:12:06,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:12:06,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67292 states. [2019-09-10 06:12:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67292 to 67292. [2019-09-10 06:12:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67292 states. [2019-09-10 06:12:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67292 states to 67292 states and 93548 transitions. [2019-09-10 06:12:09,106 INFO L78 Accepts]: Start accepts. Automaton has 67292 states and 93548 transitions. Word has length 169 [2019-09-10 06:12:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:09,106 INFO L475 AbstractCegarLoop]: Abstraction has 67292 states and 93548 transitions. [2019-09-10 06:12:09,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:12:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 67292 states and 93548 transitions. [2019-09-10 06:12:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 06:12:09,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:09,130 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] [2019-09-10 06:12:09,131 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:09,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:09,131 INFO L82 PathProgramCache]: Analyzing trace with hash -195703767, now seen corresponding path program 1 times [2019-09-10 06:12:09,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:09,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:09,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:09,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:09,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:09,278 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:09,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:09,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:09,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:09,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:09,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:09,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:09,280 INFO L87 Difference]: Start difference. First operand 67292 states and 93548 transitions. Second operand 4 states. [2019-09-10 06:12:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:09,499 INFO L93 Difference]: Finished difference Result 59904 states and 81571 transitions. [2019-09-10 06:12:09,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:09,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-10 06:12:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:09,553 INFO L225 Difference]: With dead ends: 59904 [2019-09-10 06:12:09,553 INFO L226 Difference]: Without dead ends: 59904 [2019-09-10 06:12:09,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:09,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59904 states. [2019-09-10 06:12:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59904 to 59902. [2019-09-10 06:12:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59902 states. [2019-09-10 06:12:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59902 states to 59902 states and 81570 transitions. [2019-09-10 06:12:10,461 INFO L78 Accepts]: Start accepts. Automaton has 59902 states and 81570 transitions. Word has length 169 [2019-09-10 06:12:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:10,462 INFO L475 AbstractCegarLoop]: Abstraction has 59902 states and 81570 transitions. [2019-09-10 06:12:10,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 59902 states and 81570 transitions. [2019-09-10 06:12:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 06:12:10,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:10,488 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] [2019-09-10 06:12:10,488 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:10,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1638829781, now seen corresponding path program 1 times [2019-09-10 06:12:10,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:10,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:10,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:10,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:10,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:10,692 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:10,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:10,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:12:10,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:10,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:12:10,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:12:10,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:12:10,694 INFO L87 Difference]: Start difference. First operand 59902 states and 81570 transitions. Second operand 8 states. [2019-09-10 06:12:10,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:10,972 INFO L93 Difference]: Finished difference Result 56428 states and 75849 transitions. [2019-09-10 06:12:10,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:10,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 169 [2019-09-10 06:12:10,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:11,029 INFO L225 Difference]: With dead ends: 56428 [2019-09-10 06:12:11,030 INFO L226 Difference]: Without dead ends: 56428 [2019-09-10 06:12:11,030 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:12:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56428 states. [2019-09-10 06:12:11,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56428 to 56426. [2019-09-10 06:12:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56426 states. [2019-09-10 06:12:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56426 states to 56426 states and 75848 transitions. [2019-09-10 06:12:11,598 INFO L78 Accepts]: Start accepts. Automaton has 56426 states and 75848 transitions. Word has length 169 [2019-09-10 06:12:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:11,598 INFO L475 AbstractCegarLoop]: Abstraction has 56426 states and 75848 transitions. [2019-09-10 06:12:11,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:12:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand 56426 states and 75848 transitions. [2019-09-10 06:12:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 06:12:11,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:11,625 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] [2019-09-10 06:12:11,625 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:11,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:11,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1581151803, now seen corresponding path program 1 times [2019-09-10 06:12:11,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:11,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:11,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:11,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:11,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:11,899 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:11,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:11,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:12:11,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:11,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:12:11,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:12:11,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:12:11,901 INFO L87 Difference]: Start difference. First operand 56426 states and 75848 transitions. Second operand 9 states. [2019-09-10 06:12:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:13,193 INFO L93 Difference]: Finished difference Result 49650 states and 65112 transitions. [2019-09-10 06:12:13,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:13,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 169 [2019-09-10 06:12:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:13,240 INFO L225 Difference]: With dead ends: 49650 [2019-09-10 06:12:13,240 INFO L226 Difference]: Without dead ends: 49650 [2019-09-10 06:12:13,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:12:13,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49650 states. [2019-09-10 06:12:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49650 to 49648. [2019-09-10 06:12:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49648 states. [2019-09-10 06:12:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49648 states to 49648 states and 65111 transitions. [2019-09-10 06:12:13,691 INFO L78 Accepts]: Start accepts. Automaton has 49648 states and 65111 transitions. Word has length 169 [2019-09-10 06:12:13,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:13,692 INFO L475 AbstractCegarLoop]: Abstraction has 49648 states and 65111 transitions. [2019-09-10 06:12:13,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:12:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 49648 states and 65111 transitions. [2019-09-10 06:12:13,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 06:12:13,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:13,717 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] [2019-09-10 06:12:13,717 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:13,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:13,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1344755562, now seen corresponding path program 1 times [2019-09-10 06:12:13,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:13,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:13,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:13,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:13,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:13,877 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,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:13,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:13,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:13,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:13,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:13,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:13,879 INFO L87 Difference]: Start difference. First operand 49648 states and 65111 transitions. Second operand 4 states. [2019-09-10 06:12:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:14,046 INFO L93 Difference]: Finished difference Result 44053 states and 57585 transitions. [2019-09-10 06:12:14,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:14,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-10 06:12:14,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:14,089 INFO L225 Difference]: With dead ends: 44053 [2019-09-10 06:12:14,090 INFO L226 Difference]: Without dead ends: 44053 [2019-09-10 06:12:14,090 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:12:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44053 states. [2019-09-10 06:12:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44053 to 43957. [2019-09-10 06:12:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43957 states. [2019-09-10 06:12:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43957 states to 43957 states and 57482 transitions. [2019-09-10 06:12:14,511 INFO L78 Accepts]: Start accepts. Automaton has 43957 states and 57482 transitions. Word has length 169 [2019-09-10 06:12:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:14,511 INFO L475 AbstractCegarLoop]: Abstraction has 43957 states and 57482 transitions. [2019-09-10 06:12:14,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 43957 states and 57482 transitions. [2019-09-10 06:12:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 06:12:14,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:14,533 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] [2019-09-10 06:12:14,534 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:14,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:14,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1494505164, now seen corresponding path program 1 times [2019-09-10 06:12:14,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:14,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:14,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:14,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:14,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:14,696 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:14,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:14,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:14,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:14,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:14,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:14,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:14,701 INFO L87 Difference]: Start difference. First operand 43957 states and 57482 transitions. Second operand 4 states. [2019-09-10 06:12:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:14,856 INFO L93 Difference]: Finished difference Result 44243 states and 57791 transitions. [2019-09-10 06:12:14,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:14,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-09-10 06:12:14,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:14,906 INFO L225 Difference]: With dead ends: 44243 [2019-09-10 06:12:14,906 INFO L226 Difference]: Without dead ends: 44243 [2019-09-10 06:12:14,907 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:12:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44243 states. [2019-09-10 06:12:15,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44243 to 44086. [2019-09-10 06:12:15,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44086 states. [2019-09-10 06:12:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44086 states to 44086 states and 57615 transitions. [2019-09-10 06:12:15,609 INFO L78 Accepts]: Start accepts. Automaton has 44086 states and 57615 transitions. Word has length 171 [2019-09-10 06:12:15,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:15,609 INFO L475 AbstractCegarLoop]: Abstraction has 44086 states and 57615 transitions. [2019-09-10 06:12:15,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 44086 states and 57615 transitions. [2019-09-10 06:12:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 06:12:15,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:15,634 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:12:15,634 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:15,634 INFO L82 PathProgramCache]: Analyzing trace with hash -624098332, now seen corresponding path program 1 times [2019-09-10 06:12:15,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:15,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:15,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:15,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:15,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:12:15,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:15,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:15,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:15,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:15,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:15,700 INFO L87 Difference]: Start difference. First operand 44086 states and 57615 transitions. Second operand 3 states. [2019-09-10 06:12:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:15,914 INFO L93 Difference]: Finished difference Result 87970 states and 114990 transitions. [2019-09-10 06:12:15,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:15,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-10 06:12:15,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:16,028 INFO L225 Difference]: With dead ends: 87970 [2019-09-10 06:12:16,029 INFO L226 Difference]: Without dead ends: 87970 [2019-09-10 06:12:16,029 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:12:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87970 states. [2019-09-10 06:12:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87970 to 44096. [2019-09-10 06:12:16,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44096 states. [2019-09-10 06:12:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44096 states to 44096 states and 57625 transitions. [2019-09-10 06:12:16,744 INFO L78 Accepts]: Start accepts. Automaton has 44096 states and 57625 transitions. Word has length 172 [2019-09-10 06:12:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:16,744 INFO L475 AbstractCegarLoop]: Abstraction has 44096 states and 57625 transitions. [2019-09-10 06:12:16,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 44096 states and 57625 transitions. [2019-09-10 06:12:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:12:16,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:16,769 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] [2019-09-10 06:12:16,769 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:16,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash -53214933, now seen corresponding path program 1 times [2019-09-10 06:12:16,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:16,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:16,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:16,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:16,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:16,900 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:16,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:16,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:16,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:16,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:16,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:16,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:16,902 INFO L87 Difference]: Start difference. First operand 44096 states and 57625 transitions. Second operand 4 states. [2019-09-10 06:12:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:17,048 INFO L93 Difference]: Finished difference Result 44286 states and 57810 transitions. [2019-09-10 06:12:17,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:17,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-10 06:12:17,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:17,112 INFO L225 Difference]: With dead ends: 44286 [2019-09-10 06:12:17,112 INFO L226 Difference]: Without dead ends: 44086 [2019-09-10 06:12:17,113 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:12:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44086 states. [2019-09-10 06:12:17,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44086 to 44086. [2019-09-10 06:12:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44086 states. [2019-09-10 06:12:17,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44086 states to 44086 states and 57610 transitions. [2019-09-10 06:12:17,982 INFO L78 Accepts]: Start accepts. Automaton has 44086 states and 57610 transitions. Word has length 173 [2019-09-10 06:12:17,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:17,982 INFO L475 AbstractCegarLoop]: Abstraction has 44086 states and 57610 transitions. [2019-09-10 06:12:17,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:17,982 INFO L276 IsEmpty]: Start isEmpty. Operand 44086 states and 57610 transitions. [2019-09-10 06:12:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:12:18,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:18,005 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] [2019-09-10 06:12:18,005 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:18,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:18,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1336923536, now seen corresponding path program 1 times [2019-09-10 06:12:18,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:18,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:18,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:18,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:18,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:18,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:12:18,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:18,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:18,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:18,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:18,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:18,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:18,166 INFO L87 Difference]: Start difference. First operand 44086 states and 57610 transitions. Second operand 4 states. [2019-09-10 06:12:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:18,330 INFO L93 Difference]: Finished difference Result 38508 states and 50230 transitions. [2019-09-10 06:12:18,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:18,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-10 06:12:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:18,380 INFO L225 Difference]: With dead ends: 38508 [2019-09-10 06:12:18,380 INFO L226 Difference]: Without dead ends: 38508 [2019-09-10 06:12:18,381 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:12:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38508 states. [2019-09-10 06:12:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38508 to 38187. [2019-09-10 06:12:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38187 states. [2019-09-10 06:12:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38187 states to 38187 states and 49853 transitions. [2019-09-10 06:12:18,778 INFO L78 Accepts]: Start accepts. Automaton has 38187 states and 49853 transitions. Word has length 173 [2019-09-10 06:12:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:18,778 INFO L475 AbstractCegarLoop]: Abstraction has 38187 states and 49853 transitions. [2019-09-10 06:12:18,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 38187 states and 49853 transitions. [2019-09-10 06:12:18,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:12:18,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:18,798 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:12:18,798 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:18,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:18,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1139907566, now seen corresponding path program 1 times [2019-09-10 06:12:18,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:18,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:18,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:18,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:18,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:18,894 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:18,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:18,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:18,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:18,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:18,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:18,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:18,896 INFO L87 Difference]: Start difference. First operand 38187 states and 49853 transitions. Second operand 3 states. [2019-09-10 06:12:19,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:19,319 INFO L93 Difference]: Finished difference Result 69793 states and 90999 transitions. [2019-09-10 06:12:19,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:19,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-10 06:12:19,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:19,418 INFO L225 Difference]: With dead ends: 69793 [2019-09-10 06:12:19,419 INFO L226 Difference]: Without dead ends: 69793 [2019-09-10 06:12:19,419 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:12:19,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69793 states. [2019-09-10 06:12:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69793 to 68767. [2019-09-10 06:12:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68767 states. [2019-09-10 06:12:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68767 states to 68767 states and 89752 transitions. [2019-09-10 06:12:20,441 INFO L78 Accepts]: Start accepts. Automaton has 68767 states and 89752 transitions. Word has length 175 [2019-09-10 06:12:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:20,441 INFO L475 AbstractCegarLoop]: Abstraction has 68767 states and 89752 transitions. [2019-09-10 06:12:20,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 68767 states and 89752 transitions. [2019-09-10 06:12:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:12:20,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:20,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] [2019-09-10 06:12:20,475 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:20,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:20,475 INFO L82 PathProgramCache]: Analyzing trace with hash -973145431, now seen corresponding path program 1 times [2019-09-10 06:12:20,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:20,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:20,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:20,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:20,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:20,649 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:20,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:20,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:12:20,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:20,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:12:20,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:12:20,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:12:20,651 INFO L87 Difference]: Start difference. First operand 68767 states and 89752 transitions. Second operand 6 states. [2019-09-10 06:12:21,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:21,205 INFO L93 Difference]: Finished difference Result 81002 states and 111465 transitions. [2019-09-10 06:12:21,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:12:21,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-09-10 06:12:21,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:21,290 INFO L225 Difference]: With dead ends: 81002 [2019-09-10 06:12:21,290 INFO L226 Difference]: Without dead ends: 81002 [2019-09-10 06:12:21,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:12:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81002 states. [2019-09-10 06:12:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81002 to 63783. [2019-09-10 06:12:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63783 states. [2019-09-10 06:12:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63783 states to 63783 states and 85349 transitions. [2019-09-10 06:12:22,039 INFO L78 Accepts]: Start accepts. Automaton has 63783 states and 85349 transitions. Word has length 175 [2019-09-10 06:12:22,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:22,039 INFO L475 AbstractCegarLoop]: Abstraction has 63783 states and 85349 transitions. [2019-09-10 06:12:22,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:12:22,039 INFO L276 IsEmpty]: Start isEmpty. Operand 63783 states and 85349 transitions. [2019-09-10 06:12:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:12:22,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:22,064 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:12:22,064 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:22,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:22,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1441334035, now seen corresponding path program 1 times [2019-09-10 06:12:22,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:22,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:22,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:22,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:22,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:22,493 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:22,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:22,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:12:22,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:22,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:12:22,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:12:22,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:12:22,496 INFO L87 Difference]: Start difference. First operand 63783 states and 85349 transitions. Second operand 13 states. [2019-09-10 06:12:25,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:25,131 INFO L93 Difference]: Finished difference Result 87205 states and 115847 transitions. [2019-09-10 06:12:25,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 06:12:25,131 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 175 [2019-09-10 06:12:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:25,240 INFO L225 Difference]: With dead ends: 87205 [2019-09-10 06:12:25,240 INFO L226 Difference]: Without dead ends: 87205 [2019-09-10 06:12:25,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:12:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87205 states. [2019-09-10 06:12:25,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87205 to 67284. [2019-09-10 06:12:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67284 states. [2019-09-10 06:12:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67284 states to 67284 states and 89361 transitions. [2019-09-10 06:12:26,006 INFO L78 Accepts]: Start accepts. Automaton has 67284 states and 89361 transitions. Word has length 175 [2019-09-10 06:12:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:26,007 INFO L475 AbstractCegarLoop]: Abstraction has 67284 states and 89361 transitions. [2019-09-10 06:12:26,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:12:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 67284 states and 89361 transitions. [2019-09-10 06:12:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:12:26,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:26,033 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:12:26,033 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:26,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:26,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1446751773, now seen corresponding path program 1 times [2019-09-10 06:12:26,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:26,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:26,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:26,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:26,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:27,203 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:27,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:27,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:12:27,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:27,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:12:27,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:12:27,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:12:27,206 INFO L87 Difference]: Start difference. First operand 67284 states and 89361 transitions. Second operand 22 states. [2019-09-10 06:12:27,892 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-09-10 06:12:28,057 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-09-10 06:12:28,386 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 06:12:28,633 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 06:12:28,910 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 06:12:29,227 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 06:12:29,559 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:12:29,884 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:12:30,181 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 06:12:30,633 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 06:12:30,888 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 06:12:31,270 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 06:12:31,603 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:12:32,418 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 06:12:32,654 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 06:12:32,992 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 06:12:33,261 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 06:12:33,623 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 06:12:33,934 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 06:12:34,240 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 06:12:34,507 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-10 06:12:34,776 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 06:12:35,113 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 06:12:35,513 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 06:12:35,859 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 06:12:36,153 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 06:12:36,567 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 06:12:38,787 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 06:12:39,066 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2019-09-10 06:12:39,324 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2019-09-10 06:12:39,509 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 06:12:39,712 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 06:12:39,902 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 06:12:40,412 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-09-10 06:12:40,766 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 06:12:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:41,660 INFO L93 Difference]: Finished difference Result 142102 states and 198445 transitions. [2019-09-10 06:12:41,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-10 06:12:41,660 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 175 [2019-09-10 06:12:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:41,826 INFO L225 Difference]: With dead ends: 142102 [2019-09-10 06:12:41,826 INFO L226 Difference]: Without dead ends: 142102 [2019-09-10 06:12:41,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1047, Invalid=4355, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 06:12:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142102 states. [2019-09-10 06:12:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142102 to 68764. [2019-09-10 06:12:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68764 states. [2019-09-10 06:12:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68764 states to 68764 states and 91057 transitions. [2019-09-10 06:12:43,317 INFO L78 Accepts]: Start accepts. Automaton has 68764 states and 91057 transitions. Word has length 175 [2019-09-10 06:12:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:43,317 INFO L475 AbstractCegarLoop]: Abstraction has 68764 states and 91057 transitions. [2019-09-10 06:12:43,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:12:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 68764 states and 91057 transitions. [2019-09-10 06:12:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:12:43,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:43,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] [2019-09-10 06:12:43,347 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:43,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:43,347 INFO L82 PathProgramCache]: Analyzing trace with hash 109000414, now seen corresponding path program 1 times [2019-09-10 06:12:43,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:43,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:43,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:43,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:43,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:43,593 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:43,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:43,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:12:43,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:43,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:12:43,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:12:43,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:12:43,596 INFO L87 Difference]: Start difference. First operand 68764 states and 91057 transitions. Second operand 10 states. [2019-09-10 06:12:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:43,943 INFO L93 Difference]: Finished difference Result 51784 states and 67989 transitions. [2019-09-10 06:12:43,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:12:43,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 175 [2019-09-10 06:12:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:43,989 INFO L225 Difference]: With dead ends: 51784 [2019-09-10 06:12:43,989 INFO L226 Difference]: Without dead ends: 51784 [2019-09-10 06:12:43,990 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:12:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51784 states. [2019-09-10 06:12:44,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51784 to 40079. [2019-09-10 06:12:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40079 states. [2019-09-10 06:12:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40079 states to 40079 states and 51089 transitions. [2019-09-10 06:12:44,395 INFO L78 Accepts]: Start accepts. Automaton has 40079 states and 51089 transitions. Word has length 175 [2019-09-10 06:12:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:44,396 INFO L475 AbstractCegarLoop]: Abstraction has 40079 states and 51089 transitions. [2019-09-10 06:12:44,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:12:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 40079 states and 51089 transitions. [2019-09-10 06:12:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:12:44,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:44,415 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:12:44,415 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:44,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:44,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1693381390, now seen corresponding path program 1 times [2019-09-10 06:12:44,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:44,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:44,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:44,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:44,782 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,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:44,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:12:44,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:44,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:12:44,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:12:44,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:12:44,784 INFO L87 Difference]: Start difference. First operand 40079 states and 51089 transitions. Second operand 16 states. [2019-09-10 06:12:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:47,226 INFO L93 Difference]: Finished difference Result 64584 states and 84848 transitions. [2019-09-10 06:12:47,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:12:47,227 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 175 [2019-09-10 06:12:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:47,300 INFO L225 Difference]: With dead ends: 64584 [2019-09-10 06:12:47,300 INFO L226 Difference]: Without dead ends: 64584 [2019-09-10 06:12:47,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=355, Invalid=905, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:12:47,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64584 states. [2019-09-10 06:12:48,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64584 to 43341. [2019-09-10 06:12:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43341 states. [2019-09-10 06:12:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43341 states to 43341 states and 54831 transitions. [2019-09-10 06:12:48,068 INFO L78 Accepts]: Start accepts. Automaton has 43341 states and 54831 transitions. Word has length 175 [2019-09-10 06:12:48,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:48,068 INFO L475 AbstractCegarLoop]: Abstraction has 43341 states and 54831 transitions. [2019-09-10 06:12:48,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:12:48,068 INFO L276 IsEmpty]: Start isEmpty. Operand 43341 states and 54831 transitions. [2019-09-10 06:12:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:12:48,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:48,092 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:12:48,092 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:48,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:48,093 INFO L82 PathProgramCache]: Analyzing trace with hash -443994410, now seen corresponding path program 1 times [2019-09-10 06:12:48,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:48,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:48,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:48,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:48,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:49,446 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:49,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:49,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:12:49,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:49,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:12:49,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:12:49,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:12:49,452 INFO L87 Difference]: Start difference. First operand 43341 states and 54831 transitions. Second operand 21 states. [2019-09-10 06:12:50,558 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 06:12:50,762 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 06:12:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:54,053 INFO L93 Difference]: Finished difference Result 44642 states and 56347 transitions. [2019-09-10 06:12:54,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:12:54,053 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 175 [2019-09-10 06:12:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:54,096 INFO L225 Difference]: With dead ends: 44642 [2019-09-10 06:12:54,097 INFO L226 Difference]: Without dead ends: 44642 [2019-09-10 06:12:54,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=336, Invalid=1070, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:12:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44642 states. [2019-09-10 06:12:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44642 to 43445. [2019-09-10 06:12:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43445 states. [2019-09-10 06:12:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43445 states to 43445 states and 54959 transitions. [2019-09-10 06:12:54,525 INFO L78 Accepts]: Start accepts. Automaton has 43445 states and 54959 transitions. Word has length 175 [2019-09-10 06:12:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:54,526 INFO L475 AbstractCegarLoop]: Abstraction has 43445 states and 54959 transitions. [2019-09-10 06:12:54,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:12:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 43445 states and 54959 transitions. [2019-09-10 06:12:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:12:54,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:54,551 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:12:54,551 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:54,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1360149389, now seen corresponding path program 1 times [2019-09-10 06:12:54,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:54,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:54,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:54,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:54,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:56,461 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:56,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:56,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:12:56,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:56,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:12:56,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:12:56,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:12:56,462 INFO L87 Difference]: Start difference. First operand 43445 states and 54959 transitions. Second operand 25 states. [2019-09-10 06:12:57,309 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 06:12:57,657 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 06:12:57,966 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-10 06:12:58,305 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-09-10 06:12:58,639 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 06:12:58,916 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 06:12:59,154 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 06:12:59,347 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:12:59,529 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 06:12:59,719 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:13:00,084 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:13:00,305 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-09-10 06:13:00,627 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2019-09-10 06:13:02,076 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 06:13:02,407 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-09-10 06:13:02,727 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2019-09-10 06:13:03,266 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 35 [2019-09-10 06:13:03,665 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2019-09-10 06:13:04,152 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 35 [2019-09-10 06:13:05,685 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2019-09-10 06:13:05,830 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:13:06,244 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-09-10 06:13:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:07,044 INFO L93 Difference]: Finished difference Result 67841 states and 89907 transitions. [2019-09-10 06:13:07,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 06:13:07,045 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 175 [2019-09-10 06:13:07,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:07,110 INFO L225 Difference]: With dead ends: 67841 [2019-09-10 06:13:07,110 INFO L226 Difference]: Without dead ends: 67841 [2019-09-10 06:13:07,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=595, Invalid=2711, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 06:13:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67841 states. [2019-09-10 06:13:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67841 to 44350. [2019-09-10 06:13:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44350 states. [2019-09-10 06:13:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44350 states to 44350 states and 56004 transitions. [2019-09-10 06:13:07,660 INFO L78 Accepts]: Start accepts. Automaton has 44350 states and 56004 transitions. Word has length 175 [2019-09-10 06:13:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:07,660 INFO L475 AbstractCegarLoop]: Abstraction has 44350 states and 56004 transitions. [2019-09-10 06:13:07,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:13:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 44350 states and 56004 transitions. [2019-09-10 06:13:07,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:13:07,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:07,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] [2019-09-10 06:13:07,685 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:07,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:07,685 INFO L82 PathProgramCache]: Analyzing trace with hash 821764910, now seen corresponding path program 1 times [2019-09-10 06:13:07,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:07,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:07,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:07,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:07,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:07,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:07,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:07,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:13:07,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:07,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:13:07,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:13:07,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:13:07,916 INFO L87 Difference]: Start difference. First operand 44350 states and 56004 transitions. Second operand 11 states. [2019-09-10 06:13:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:08,347 INFO L93 Difference]: Finished difference Result 36400 states and 45326 transitions. [2019-09-10 06:13:08,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:13:08,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2019-09-10 06:13:08,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:08,378 INFO L225 Difference]: With dead ends: 36400 [2019-09-10 06:13:08,378 INFO L226 Difference]: Without dead ends: 36400 [2019-09-10 06:13:08,378 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:13:08,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36400 states. [2019-09-10 06:13:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36400 to 31990. [2019-09-10 06:13:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31990 states. [2019-09-10 06:13:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31990 states to 31990 states and 38828 transitions. [2019-09-10 06:13:08,661 INFO L78 Accepts]: Start accepts. Automaton has 31990 states and 38828 transitions. Word has length 175 [2019-09-10 06:13:08,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:08,662 INFO L475 AbstractCegarLoop]: Abstraction has 31990 states and 38828 transitions. [2019-09-10 06:13:08,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:13:08,662 INFO L276 IsEmpty]: Start isEmpty. Operand 31990 states and 38828 transitions. [2019-09-10 06:13:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:13:08,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:08,681 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:13:08,681 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:08,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:08,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1997349711, now seen corresponding path program 1 times [2019-09-10 06:13:08,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:08,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:08,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:08,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:08,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:10,236 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:10,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:10,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 06:13:10,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:10,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:13:10,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:13:10,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:13:10,238 INFO L87 Difference]: Start difference. First operand 31990 states and 38828 transitions. Second operand 24 states. [2019-09-10 06:13:10,850 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:13:11,237 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:13:11,496 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:13:11,723 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-10 06:13:11,868 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-10 06:13:12,572 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2019-09-10 06:13:13,062 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 06:13:13,363 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 06:13:13,762 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 06:13:14,155 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-10 06:13:14,503 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 06:13:14,789 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 06:13:15,007 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2019-09-10 06:13:15,425 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 06:13:15,752 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 06:13:16,143 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 06:13:16,416 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 06:13:16,640 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 06:13:16,913 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:13:17,072 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 06:13:17,288 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:13:17,722 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 06:13:18,094 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 06:13:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:19,317 INFO L93 Difference]: Finished difference Result 46232 states and 57063 transitions. [2019-09-10 06:13:19,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 06:13:19,317 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2019-09-10 06:13:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:19,363 INFO L225 Difference]: With dead ends: 46232 [2019-09-10 06:13:19,363 INFO L226 Difference]: Without dead ends: 46232 [2019-09-10 06:13:19,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=628, Invalid=1822, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:13:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46232 states. [2019-09-10 06:13:19,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46232 to 33909. [2019-09-10 06:13:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33909 states. [2019-09-10 06:13:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33909 states to 33909 states and 41034 transitions. [2019-09-10 06:13:19,890 INFO L78 Accepts]: Start accepts. Automaton has 33909 states and 41034 transitions. Word has length 175 [2019-09-10 06:13:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:19,891 INFO L475 AbstractCegarLoop]: Abstraction has 33909 states and 41034 transitions. [2019-09-10 06:13:19,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:13:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 33909 states and 41034 transitions. [2019-09-10 06:13:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:13:19,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:19,915 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:13:19,915 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:19,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:19,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1996733064, now seen corresponding path program 1 times [2019-09-10 06:13:19,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:19,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:19,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:19,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:19,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:21,100 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:21,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:21,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:13:21,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:21,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:13:21,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:13:21,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:13:21,102 INFO L87 Difference]: Start difference. First operand 33909 states and 41034 transitions. Second operand 26 states. [2019-09-10 06:13:22,423 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-09-10 06:13:22,610 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 06:13:23,078 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-09-10 06:13:23,259 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-10 06:13:23,486 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 06:13:23,647 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 06:13:23,846 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 06:13:24,139 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 06:13:24,334 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-09-10 06:13:24,659 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-09-10 06:13:24,821 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 06:13:25,006 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 06:13:25,151 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-10 06:13:26,195 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 06:13:26,482 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 06:13:26,682 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 06:13:26,900 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-09-10 06:13:27,344 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-09-10 06:13:27,611 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-09-10 06:13:27,851 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2019-09-10 06:13:28,044 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-09-10 06:13:28,583 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-09-10 06:13:28,910 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-09-10 06:13:29,173 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 61 [2019-09-10 06:13:29,459 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 65 [2019-09-10 06:13:29,736 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2019-09-10 06:13:29,955 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-09-10 06:13:30,198 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-09-10 06:13:30,438 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2019-09-10 06:13:30,633 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-09-10 06:13:30,859 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2019-09-10 06:13:31,135 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2019-09-10 06:13:31,463 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-09-10 06:13:31,734 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:13:32,189 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 06:13:32,398 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 06:13:32,616 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 06:13:32,884 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 06:13:33,103 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:13:33,295 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 06:13:33,498 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 06:13:33,862 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2019-09-10 06:13:34,177 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 06:13:34,417 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-10 06:13:34,772 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-09-10 06:13:34,971 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 06:13:35,157 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:13:35,365 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 06:13:35,634 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 06:13:35,922 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-10 06:13:36,224 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 06:13:36,539 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 06:13:36,852 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 06:13:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:37,934 INFO L93 Difference]: Finished difference Result 61534 states and 74389 transitions. [2019-09-10 06:13:37,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 06:13:37,935 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 175 [2019-09-10 06:13:37,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:37,983 INFO L225 Difference]: With dead ends: 61534 [2019-09-10 06:13:37,983 INFO L226 Difference]: Without dead ends: 61534 [2019-09-10 06:13:37,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1784, Invalid=6226, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 06:13:38,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61534 states. [2019-09-10 06:13:38,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61534 to 36601. [2019-09-10 06:13:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36601 states. [2019-09-10 06:13:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36601 states to 36601 states and 44130 transitions. [2019-09-10 06:13:38,466 INFO L78 Accepts]: Start accepts. Automaton has 36601 states and 44130 transitions. Word has length 175 [2019-09-10 06:13:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:38,466 INFO L475 AbstractCegarLoop]: Abstraction has 36601 states and 44130 transitions. [2019-09-10 06:13:38,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:13:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 36601 states and 44130 transitions. [2019-09-10 06:13:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:13:38,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:38,491 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:13:38,491 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:38,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:38,491 INFO L82 PathProgramCache]: Analyzing trace with hash -702412220, now seen corresponding path program 1 times [2019-09-10 06:13:38,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:38,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:38,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:38,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:38,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:39,303 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 06:13:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:40,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:40,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:13:40,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:40,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:13:40,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:13:40,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:13:40,398 INFO L87 Difference]: Start difference. First operand 36601 states and 44130 transitions. Second operand 26 states. [2019-09-10 06:13:41,276 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 06:13:41,568 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 06:13:41,881 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-10 06:13:42,429 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-10 06:13:42,789 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 06:13:42,984 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 06:13:43,173 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 06:13:43,395 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 06:13:43,766 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 06:13:44,197 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 06:13:44,723 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-10 06:13:45,984 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 06:13:46,181 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2019-09-10 06:13:46,435 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-09-10 06:13:47,566 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-09-10 06:13:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:49,841 INFO L93 Difference]: Finished difference Result 51951 states and 64111 transitions. [2019-09-10 06:13:49,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 06:13:49,841 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 175 [2019-09-10 06:13:49,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:49,893 INFO L225 Difference]: With dead ends: 51951 [2019-09-10 06:13:49,894 INFO L226 Difference]: Without dead ends: 51951 [2019-09-10 06:13:49,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=483, Invalid=2487, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 06:13:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51951 states. [2019-09-10 06:13:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51951 to 38629. [2019-09-10 06:13:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38629 states. [2019-09-10 06:13:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38629 states to 38629 states and 46493 transitions. [2019-09-10 06:13:50,328 INFO L78 Accepts]: Start accepts. Automaton has 38629 states and 46493 transitions. Word has length 175 [2019-09-10 06:13:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:50,328 INFO L475 AbstractCegarLoop]: Abstraction has 38629 states and 46493 transitions. [2019-09-10 06:13:50,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:13:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 38629 states and 46493 transitions. [2019-09-10 06:13:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:13:50,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:50,353 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:13:50,354 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:50,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:50,354 INFO L82 PathProgramCache]: Analyzing trace with hash 17947596, now seen corresponding path program 1 times [2019-09-10 06:13:50,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:50,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:50,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:50,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:50,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:51,285 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-10 06:13:52,775 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:52,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:52,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:13:52,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:52,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:13:52,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:13:52,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:13:52,777 INFO L87 Difference]: Start difference. First operand 38629 states and 46493 transitions. Second operand 26 states. [2019-09-10 06:13:53,544 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 06:13:53,748 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 06:13:54,255 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 06:13:54,588 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 06:13:55,575 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 06:13:58,449 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-09-10 06:14:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:00,382 INFO L93 Difference]: Finished difference Result 48057 states and 57290 transitions. [2019-09-10 06:14:00,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:14:00,383 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 175 [2019-09-10 06:14:00,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:00,420 INFO L225 Difference]: With dead ends: 48057 [2019-09-10 06:14:00,420 INFO L226 Difference]: Without dead ends: 48057 [2019-09-10 06:14:00,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=456, Invalid=1800, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:14:00,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48057 states. [2019-09-10 06:14:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48057 to 40084. [2019-09-10 06:14:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40084 states. [2019-09-10 06:14:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40084 states to 40084 states and 48157 transitions. [2019-09-10 06:14:00,793 INFO L78 Accepts]: Start accepts. Automaton has 40084 states and 48157 transitions. Word has length 175 [2019-09-10 06:14:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:00,794 INFO L475 AbstractCegarLoop]: Abstraction has 40084 states and 48157 transitions. [2019-09-10 06:14:00,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:14:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 40084 states and 48157 transitions. [2019-09-10 06:14:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:14:00,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:00,821 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:14:00,821 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:00,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:00,821 INFO L82 PathProgramCache]: Analyzing trace with hash -2009626333, now seen corresponding path program 1 times [2019-09-10 06:14:00,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:00,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:00,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:00,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:00,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:01,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:01,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:14:01,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:01,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:14:01,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:14:01,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:14:01,395 INFO L87 Difference]: Start difference. First operand 40084 states and 48157 transitions. Second operand 17 states. [2019-09-10 06:14:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:04,185 INFO L93 Difference]: Finished difference Result 71415 states and 85436 transitions. [2019-09-10 06:14:04,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:14:04,185 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 175 [2019-09-10 06:14:04,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:04,254 INFO L225 Difference]: With dead ends: 71415 [2019-09-10 06:14:04,254 INFO L226 Difference]: Without dead ends: 69939 [2019-09-10 06:14:04,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=348, Invalid=984, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:14:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69939 states. [2019-09-10 06:14:04,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69939 to 52638. [2019-09-10 06:14:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52638 states. [2019-09-10 06:14:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52638 states to 52638 states and 62536 transitions. [2019-09-10 06:14:04,920 INFO L78 Accepts]: Start accepts. Automaton has 52638 states and 62536 transitions. Word has length 175 [2019-09-10 06:14:04,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:04,920 INFO L475 AbstractCegarLoop]: Abstraction has 52638 states and 62536 transitions. [2019-09-10 06:14:04,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:14:04,920 INFO L276 IsEmpty]: Start isEmpty. Operand 52638 states and 62536 transitions. [2019-09-10 06:14:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 06:14:04,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:04,958 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:14:04,959 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:04,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:04,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1224452038, now seen corresponding path program 1 times [2019-09-10 06:14:04,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:04,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:04,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:04,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:04,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:06,281 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,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:06,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:14:06,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:06,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:14:06,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:14:06,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:14:06,283 INFO L87 Difference]: Start difference. First operand 52638 states and 62536 transitions. Second operand 22 states. [2019-09-10 06:14:07,703 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-10 06:14:07,879 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 06:14:08,034 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 06:14:08,408 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 06:14:08,631 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 06:14:10,475 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 06:14:10,682 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 06:14:10,834 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:14:11,034 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 06:14:11,706 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 06:14:11,877 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 06:14:12,056 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-09-10 06:14:12,308 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:14:12,473 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 06:14:12,893 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 06:14:13,235 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 06:14:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:14,720 INFO L93 Difference]: Finished difference Result 72166 states and 86696 transitions. [2019-09-10 06:14:14,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:14:14,720 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 175 [2019-09-10 06:14:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:14,790 INFO L225 Difference]: With dead ends: 72166 [2019-09-10 06:14:14,790 INFO L226 Difference]: Without dead ends: 72166 [2019-09-10 06:14:14,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=685, Invalid=1967, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 06:14:14,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72166 states. [2019-09-10 06:14:15,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72166 to 55536. [2019-09-10 06:14:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55536 states. [2019-09-10 06:14:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55536 states to 55536 states and 65819 transitions. [2019-09-10 06:14:15,457 INFO L78 Accepts]: Start accepts. Automaton has 55536 states and 65819 transitions. Word has length 175 [2019-09-10 06:14:15,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:15,457 INFO L475 AbstractCegarLoop]: Abstraction has 55536 states and 65819 transitions. [2019-09-10 06:14:15,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:14:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 55536 states and 65819 transitions. [2019-09-10 06:14:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 06:14:15,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:15,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,499 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:15,499 INFO L82 PathProgramCache]: Analyzing trace with hash -348028919, now seen corresponding path program 1 times [2019-09-10 06:14:15,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:15,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:15,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:15,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:15,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:15,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:15,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:15,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:15,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:15,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:15,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:15,575 INFO L87 Difference]: Start difference. First operand 55536 states and 65819 transitions. Second operand 3 states. [2019-09-10 06:14:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:15,844 INFO L93 Difference]: Finished difference Result 53589 states and 63429 transitions. [2019-09-10 06:14:15,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:15,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 06:14:15,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:15,891 INFO L225 Difference]: With dead ends: 53589 [2019-09-10 06:14:15,891 INFO L226 Difference]: Without dead ends: 53589 [2019-09-10 06:14:15,892 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:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53589 states. [2019-09-10 06:14:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53589 to 52473. [2019-09-10 06:14:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52473 states. [2019-09-10 06:14:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52473 states to 52473 states and 61897 transitions. [2019-09-10 06:14:16,399 INFO L78 Accepts]: Start accepts. Automaton has 52473 states and 61897 transitions. Word has length 176 [2019-09-10 06:14:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:16,399 INFO L475 AbstractCegarLoop]: Abstraction has 52473 states and 61897 transitions. [2019-09-10 06:14:16,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 52473 states and 61897 transitions. [2019-09-10 06:14:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 06:14:16,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:16,434 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:14:16,435 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:16,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:16,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1647546256, now seen corresponding path program 1 times [2019-09-10 06:14:16,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:16,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:16,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:16,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:16,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:16,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:16,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:16,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:16,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:16,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:16,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:16,500 INFO L87 Difference]: Start difference. First operand 52473 states and 61897 transitions. Second operand 3 states. [2019-09-10 06:14:16,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:16,889 INFO L93 Difference]: Finished difference Result 45505 states and 54139 transitions. [2019-09-10 06:14:16,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:16,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 06:14:16,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:16,934 INFO L225 Difference]: With dead ends: 45505 [2019-09-10 06:14:16,934 INFO L226 Difference]: Without dead ends: 45505 [2019-09-10 06:14:16,934 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:16,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45505 states. [2019-09-10 06:14:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45505 to 43445. [2019-09-10 06:14:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43445 states. [2019-09-10 06:14:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43445 states to 43445 states and 51287 transitions. [2019-09-10 06:14:17,373 INFO L78 Accepts]: Start accepts. Automaton has 43445 states and 51287 transitions. Word has length 176 [2019-09-10 06:14:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:17,373 INFO L475 AbstractCegarLoop]: Abstraction has 43445 states and 51287 transitions. [2019-09-10 06:14:17,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 43445 states and 51287 transitions. [2019-09-10 06:14:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 06:14:17,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:17,404 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:14:17,404 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:17,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:17,405 INFO L82 PathProgramCache]: Analyzing trace with hash 288937474, now seen corresponding path program 1 times [2019-09-10 06:14:17,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:17,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:17,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:17,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:17,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:17,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:14:17,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:17,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:17,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:17,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:17,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:17,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:17,483 INFO L87 Difference]: Start difference. First operand 43445 states and 51287 transitions. Second operand 3 states. [2019-09-10 06:14:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:17,658 INFO L93 Difference]: Finished difference Result 37782 states and 44518 transitions. [2019-09-10 06:14:17,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:17,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 06:14:17,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:17,694 INFO L225 Difference]: With dead ends: 37782 [2019-09-10 06:14:17,695 INFO L226 Difference]: Without dead ends: 37782 [2019-09-10 06:14:17,695 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:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37782 states. [2019-09-10 06:14:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37782 to 37678. [2019-09-10 06:14:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37678 states. [2019-09-10 06:14:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37678 states to 37678 states and 44414 transitions. [2019-09-10 06:14:18,053 INFO L78 Accepts]: Start accepts. Automaton has 37678 states and 44414 transitions. Word has length 176 [2019-09-10 06:14:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:18,053 INFO L475 AbstractCegarLoop]: Abstraction has 37678 states and 44414 transitions. [2019-09-10 06:14:18,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 37678 states and 44414 transitions. [2019-09-10 06:14:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 06:14:18,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:18,078 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:14:18,078 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:18,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:18,079 INFO L82 PathProgramCache]: Analyzing trace with hash 620523666, now seen corresponding path program 1 times [2019-09-10 06:14:18,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:18,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:18,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:18,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:18,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:18,144 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:18,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:18,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:18,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:18,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:18,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:18,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:18,146 INFO L87 Difference]: Start difference. First operand 37678 states and 44414 transitions. Second operand 3 states. [2019-09-10 06:14:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:18,314 INFO L93 Difference]: Finished difference Result 36606 states and 42812 transitions. [2019-09-10 06:14:18,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:18,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 06:14:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:18,344 INFO L225 Difference]: With dead ends: 36606 [2019-09-10 06:14:18,345 INFO L226 Difference]: Without dead ends: 36606 [2019-09-10 06:14:18,345 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:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36606 states. [2019-09-10 06:14:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36606 to 36502. [2019-09-10 06:14:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36502 states. [2019-09-10 06:14:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36502 states to 36502 states and 42708 transitions. [2019-09-10 06:14:18,675 INFO L78 Accepts]: Start accepts. Automaton has 36502 states and 42708 transitions. Word has length 176 [2019-09-10 06:14:18,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:18,675 INFO L475 AbstractCegarLoop]: Abstraction has 36502 states and 42708 transitions. [2019-09-10 06:14:18,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:18,676 INFO L276 IsEmpty]: Start isEmpty. Operand 36502 states and 42708 transitions. [2019-09-10 06:14:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 06:14:18,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:18,699 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:14:18,699 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:18,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:18,699 INFO L82 PathProgramCache]: Analyzing trace with hash -142958053, now seen corresponding path program 1 times [2019-09-10 06:14:18,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:18,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:18,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:18,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:18,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:18,763 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:18,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:18,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:18,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:18,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:18,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:18,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:18,765 INFO L87 Difference]: Start difference. First operand 36502 states and 42708 transitions. Second operand 3 states. [2019-09-10 06:14:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:18,944 INFO L93 Difference]: Finished difference Result 31230 states and 37066 transitions. [2019-09-10 06:14:18,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:18,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 06:14:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:18,975 INFO L225 Difference]: With dead ends: 31230 [2019-09-10 06:14:18,976 INFO L226 Difference]: Without dead ends: 30870 [2019-09-10 06:14:18,976 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:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30870 states. [2019-09-10 06:14:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30870 to 28833. [2019-09-10 06:14:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28833 states. [2019-09-10 06:14:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28833 states to 28833 states and 33932 transitions. [2019-09-10 06:14:19,234 INFO L78 Accepts]: Start accepts. Automaton has 28833 states and 33932 transitions. Word has length 176 [2019-09-10 06:14:19,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:19,234 INFO L475 AbstractCegarLoop]: Abstraction has 28833 states and 33932 transitions. [2019-09-10 06:14:19,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 28833 states and 33932 transitions. [2019-09-10 06:14:19,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 06:14:19,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:19,251 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:14:19,251 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:19,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:19,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1514420973, now seen corresponding path program 1 times [2019-09-10 06:14:19,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:19,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:19,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:19,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:19,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:19,322 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:19,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:19,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:19,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:19,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:19,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:19,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:19,324 INFO L87 Difference]: Start difference. First operand 28833 states and 33932 transitions. Second operand 3 states. [2019-09-10 06:14:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:19,488 INFO L93 Difference]: Finished difference Result 27038 states and 31902 transitions. [2019-09-10 06:14:19,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:19,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 06:14:19,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:19,511 INFO L225 Difference]: With dead ends: 27038 [2019-09-10 06:14:19,511 INFO L226 Difference]: Without dead ends: 27038 [2019-09-10 06:14:19,511 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:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27038 states. [2019-09-10 06:14:19,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27038 to 26022. [2019-09-10 06:14:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26022 states. [2019-09-10 06:14:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26022 states to 26022 states and 30542 transitions. [2019-09-10 06:14:19,788 INFO L78 Accepts]: Start accepts. Automaton has 26022 states and 30542 transitions. Word has length 176 [2019-09-10 06:14:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:19,788 INFO L475 AbstractCegarLoop]: Abstraction has 26022 states and 30542 transitions. [2019-09-10 06:14:19,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 26022 states and 30542 transitions. [2019-09-10 06:14:19,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:14:19,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:19,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] [2019-09-10 06:14:19,814 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:19,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:19,814 INFO L82 PathProgramCache]: Analyzing trace with hash 636108721, now seen corresponding path program 1 times [2019-09-10 06:14:19,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:19,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:19,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:19,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:19,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:19,892 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:19,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:19,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:19,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:19,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:19,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:19,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:19,894 INFO L87 Difference]: Start difference. First operand 26022 states and 30542 transitions. Second operand 3 states. [2019-09-10 06:14:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:19,987 INFO L93 Difference]: Finished difference Result 25742 states and 30051 transitions. [2019-09-10 06:14:19,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:19,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 06:14:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:20,015 INFO L225 Difference]: With dead ends: 25742 [2019-09-10 06:14:20,015 INFO L226 Difference]: Without dead ends: 25742 [2019-09-10 06:14:20,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:14:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25742 states. [2019-09-10 06:14:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25742 to 25626. [2019-09-10 06:14:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25626 states. [2019-09-10 06:14:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25626 states to 25626 states and 29931 transitions. [2019-09-10 06:14:20,347 INFO L78 Accepts]: Start accepts. Automaton has 25626 states and 29931 transitions. Word has length 180 [2019-09-10 06:14:20,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:20,348 INFO L475 AbstractCegarLoop]: Abstraction has 25626 states and 29931 transitions. [2019-09-10 06:14:20,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:20,348 INFO L276 IsEmpty]: Start isEmpty. Operand 25626 states and 29931 transitions. [2019-09-10 06:14:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:14:20,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:20,364 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:20,364 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:20,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:20,364 INFO L82 PathProgramCache]: Analyzing trace with hash -444325036, now seen corresponding path program 1 times [2019-09-10 06:14:20,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:20,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:20,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:20,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:20,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:20,414 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,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:20,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:20,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:20,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:20,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:20,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:20,416 INFO L87 Difference]: Start difference. First operand 25626 states and 29931 transitions. Second operand 3 states. [2019-09-10 06:14:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:20,492 INFO L93 Difference]: Finished difference Result 25297 states and 29407 transitions. [2019-09-10 06:14:20,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:20,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 06:14:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:20,515 INFO L225 Difference]: With dead ends: 25297 [2019-09-10 06:14:20,515 INFO L226 Difference]: Without dead ends: 25297 [2019-09-10 06:14:20,515 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:20,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25297 states. [2019-09-10 06:14:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25297 to 25143. [2019-09-10 06:14:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25143 states. [2019-09-10 06:14:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25143 states to 25143 states and 29250 transitions. [2019-09-10 06:14:20,735 INFO L78 Accepts]: Start accepts. Automaton has 25143 states and 29250 transitions. Word has length 180 [2019-09-10 06:14:20,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:20,735 INFO L475 AbstractCegarLoop]: Abstraction has 25143 states and 29250 transitions. [2019-09-10 06:14:20,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 25143 states and 29250 transitions. [2019-09-10 06:14:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:14:20,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:20,751 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:20,752 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:20,752 INFO L82 PathProgramCache]: Analyzing trace with hash 917076932, now seen corresponding path program 1 times [2019-09-10 06:14:20,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:20,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:20,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:20,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:20,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:20,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:20,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:20,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:20,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:20,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:20,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:20,810 INFO L87 Difference]: Start difference. First operand 25143 states and 29250 transitions. Second operand 3 states. [2019-09-10 06:14:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:20,885 INFO L93 Difference]: Finished difference Result 23251 states and 27091 transitions. [2019-09-10 06:14:20,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:20,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 06:14:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:20,905 INFO L225 Difference]: With dead ends: 23251 [2019-09-10 06:14:20,905 INFO L226 Difference]: Without dead ends: 23251 [2019-09-10 06:14:20,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:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23251 states. [2019-09-10 06:14:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23251 to 23189. [2019-09-10 06:14:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23189 states. [2019-09-10 06:14:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23189 states to 23189 states and 27029 transitions. [2019-09-10 06:14:21,102 INFO L78 Accepts]: Start accepts. Automaton has 23189 states and 27029 transitions. Word has length 180 [2019-09-10 06:14:21,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:21,102 INFO L475 AbstractCegarLoop]: Abstraction has 23189 states and 27029 transitions. [2019-09-10 06:14:21,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:21,102 INFO L276 IsEmpty]: Start isEmpty. Operand 23189 states and 27029 transitions. [2019-09-10 06:14:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:14:21,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:21,116 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:21,116 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:21,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1579848431, now seen corresponding path program 1 times [2019-09-10 06:14:21,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:21,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:21,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:21,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:21,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:21,175 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:21,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:21,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:21,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:21,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:21,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:21,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:21,177 INFO L87 Difference]: Start difference. First operand 23189 states and 27029 transitions. Second operand 3 states. [2019-09-10 06:14:21,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:21,238 INFO L93 Difference]: Finished difference Result 21268 states and 24764 transitions. [2019-09-10 06:14:21,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:21,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 06:14:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:21,257 INFO L225 Difference]: With dead ends: 21268 [2019-09-10 06:14:21,257 INFO L226 Difference]: Without dead ends: 21268 [2019-09-10 06:14:21,257 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:21,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21268 states. [2019-09-10 06:14:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21268 to 21192. [2019-09-10 06:14:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21192 states. [2019-09-10 06:14:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21192 states to 21192 states and 24690 transitions. [2019-09-10 06:14:21,429 INFO L78 Accepts]: Start accepts. Automaton has 21192 states and 24690 transitions. Word has length 180 [2019-09-10 06:14:21,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:21,429 INFO L475 AbstractCegarLoop]: Abstraction has 21192 states and 24690 transitions. [2019-09-10 06:14:21,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 21192 states and 24690 transitions. [2019-09-10 06:14:21,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:14:21,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:21,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] [2019-09-10 06:14:21,441 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:21,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:21,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1857534320, now seen corresponding path program 1 times [2019-09-10 06:14:21,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:21,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:21,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:21,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:21,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:21,516 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:21,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:21,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:21,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:21,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:21,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:21,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:21,517 INFO L87 Difference]: Start difference. First operand 21192 states and 24690 transitions. Second operand 3 states. [2019-09-10 06:14:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:21,580 INFO L93 Difference]: Finished difference Result 20985 states and 24297 transitions. [2019-09-10 06:14:21,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:21,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 06:14:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:21,597 INFO L225 Difference]: With dead ends: 20985 [2019-09-10 06:14:21,597 INFO L226 Difference]: Without dead ends: 20979 [2019-09-10 06:14:21,597 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:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20979 states. [2019-09-10 06:14:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20979 to 20923. [2019-09-10 06:14:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20923 states. [2019-09-10 06:14:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20923 states to 20923 states and 24238 transitions. [2019-09-10 06:14:21,753 INFO L78 Accepts]: Start accepts. Automaton has 20923 states and 24238 transitions. Word has length 180 [2019-09-10 06:14:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:21,754 INFO L475 AbstractCegarLoop]: Abstraction has 20923 states and 24238 transitions. [2019-09-10 06:14:21,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 20923 states and 24238 transitions. [2019-09-10 06:14:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:14:21,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:21,764 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:21,764 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:21,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:21,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1070549229, now seen corresponding path program 1 times [2019-09-10 06:14:21,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:21,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:21,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:21,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:21,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:21,826 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:21,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:21,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:21,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:21,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:21,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:21,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:21,828 INFO L87 Difference]: Start difference. First operand 20923 states and 24238 transitions. Second operand 3 states. [2019-09-10 06:14:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:21,892 INFO L93 Difference]: Finished difference Result 19292 states and 22350 transitions. [2019-09-10 06:14:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:21,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 06:14:21,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:21,908 INFO L225 Difference]: With dead ends: 19292 [2019-09-10 06:14:21,908 INFO L226 Difference]: Without dead ends: 19292 [2019-09-10 06:14:21,908 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:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19292 states. [2019-09-10 06:14:22,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19292 to 19255. [2019-09-10 06:14:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19255 states. [2019-09-10 06:14:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19255 states to 19255 states and 22316 transitions. [2019-09-10 06:14:22,056 INFO L78 Accepts]: Start accepts. Automaton has 19255 states and 22316 transitions. Word has length 180 [2019-09-10 06:14:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:22,056 INFO L475 AbstractCegarLoop]: Abstraction has 19255 states and 22316 transitions. [2019-09-10 06:14:22,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 19255 states and 22316 transitions. [2019-09-10 06:14:22,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:14:22,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:22,067 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:22,067 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:22,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:22,068 INFO L82 PathProgramCache]: Analyzing trace with hash -225002891, now seen corresponding path program 1 times [2019-09-10 06:14:22,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:22,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:22,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:22,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:22,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:23,684 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:23,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:23,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:14:23,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:23,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:14:23,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:14:23,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:14:23,686 INFO L87 Difference]: Start difference. First operand 19255 states and 22316 transitions. Second operand 25 states. [2019-09-10 06:14:24,289 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 06:14:24,566 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 06:14:24,857 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 06:14:25,327 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 06:14:25,736 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-09-10 06:14:26,206 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2019-09-10 06:14:26,697 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 92 [2019-09-10 06:14:27,061 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 06:14:27,288 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 06:14:27,546 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:14:27,755 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:14:27,988 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 06:14:28,307 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 06:14:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:30,872 INFO L93 Difference]: Finished difference Result 22742 states and 27374 transitions. [2019-09-10 06:14:30,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:14:30,873 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 181 [2019-09-10 06:14:30,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:30,891 INFO L225 Difference]: With dead ends: 22742 [2019-09-10 06:14:30,891 INFO L226 Difference]: Without dead ends: 22742 [2019-09-10 06:14:30,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=299, Invalid=1261, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:14:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22742 states. [2019-09-10 06:14:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22742 to 18980. [2019-09-10 06:14:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18980 states. [2019-09-10 06:14:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18980 states to 18980 states and 22029 transitions. [2019-09-10 06:14:31,066 INFO L78 Accepts]: Start accepts. Automaton has 18980 states and 22029 transitions. Word has length 181 [2019-09-10 06:14:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:31,066 INFO L475 AbstractCegarLoop]: Abstraction has 18980 states and 22029 transitions. [2019-09-10 06:14:31,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:14:31,066 INFO L276 IsEmpty]: Start isEmpty. Operand 18980 states and 22029 transitions. [2019-09-10 06:14:31,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:14:31,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:31,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] [2019-09-10 06:14:31,076 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:31,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:31,076 INFO L82 PathProgramCache]: Analyzing trace with hash 794548854, now seen corresponding path program 1 times [2019-09-10 06:14:31,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:31,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:31,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:31,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:31,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:31,715 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:31,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:31,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 06:14:31,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:31,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:14:31,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:14:31,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:14:31,716 INFO L87 Difference]: Start difference. First operand 18980 states and 22029 transitions. Second operand 20 states. [2019-09-10 06:14:31,862 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 06:14:32,869 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 06:14:34,279 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2019-09-10 06:14:34,509 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-09-10 06:14:35,309 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-10 06:14:35,556 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-10 06:14:36,081 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-09-10 06:14:36,450 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 06:14:36,593 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 06:14:36,862 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-09-10 06:14:37,007 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 06:14:37,155 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 06:14:37,674 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-09-10 06:14:37,821 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 06:14:40,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:40,642 INFO L93 Difference]: Finished difference Result 28017 states and 34139 transitions. [2019-09-10 06:14:40,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 06:14:40,643 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 181 [2019-09-10 06:14:40,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:40,669 INFO L225 Difference]: With dead ends: 28017 [2019-09-10 06:14:40,670 INFO L226 Difference]: Without dead ends: 28017 [2019-09-10 06:14:40,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=917, Invalid=4195, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 06:14:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28017 states. [2019-09-10 06:14:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28017 to 19577. [2019-09-10 06:14:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19577 states. [2019-09-10 06:14:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19577 states to 19577 states and 22659 transitions. [2019-09-10 06:14:40,985 INFO L78 Accepts]: Start accepts. Automaton has 19577 states and 22659 transitions. Word has length 181 [2019-09-10 06:14:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:40,986 INFO L475 AbstractCegarLoop]: Abstraction has 19577 states and 22659 transitions. [2019-09-10 06:14:40,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:14:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 19577 states and 22659 transitions. [2019-09-10 06:14:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:14:40,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:40,994 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:40,995 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:40,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash 731765973, now seen corresponding path program 1 times [2019-09-10 06:14:40,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:40,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:40,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:40,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:40,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:42,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:42,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:14:42,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:42,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:14:42,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:14:42,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:14:42,169 INFO L87 Difference]: Start difference. First operand 19577 states and 22659 transitions. Second operand 23 states. [2019-09-10 06:14:42,984 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 06:14:43,185 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 06:14:43,498 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-09-10 06:14:43,754 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-09-10 06:14:44,020 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 06:14:44,218 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 06:14:44,448 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 06:14:44,660 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 06:14:44,844 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-09-10 06:14:45,650 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-09-10 06:14:45,916 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-10 06:14:46,337 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 42 [2019-09-10 06:14:46,655 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 47 [2019-09-10 06:14:47,261 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2019-09-10 06:14:47,551 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2019-09-10 06:14:47,988 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-10 06:14:48,314 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 06:14:48,536 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-10 06:14:49,625 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-10 06:14:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:51,475 INFO L93 Difference]: Finished difference Result 20707 states and 23962 transitions. [2019-09-10 06:14:51,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 06:14:51,475 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 181 [2019-09-10 06:14:51,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:51,496 INFO L225 Difference]: With dead ends: 20707 [2019-09-10 06:14:51,496 INFO L226 Difference]: Without dead ends: 20707 [2019-09-10 06:14:51,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=767, Invalid=2773, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:14:51,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20707 states. [2019-09-10 06:14:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20707 to 20132. [2019-09-10 06:14:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20132 states. [2019-09-10 06:14:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20132 states to 20132 states and 23241 transitions. [2019-09-10 06:14:51,665 INFO L78 Accepts]: Start accepts. Automaton has 20132 states and 23241 transitions. Word has length 181 [2019-09-10 06:14:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:51,665 INFO L475 AbstractCegarLoop]: Abstraction has 20132 states and 23241 transitions. [2019-09-10 06:14:51,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:14:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand 20132 states and 23241 transitions. [2019-09-10 06:14:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:14:51,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:51,675 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:51,676 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:51,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:51,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1971311766, now seen corresponding path program 1 times [2019-09-10 06:14:51,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:51,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:51,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:51,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:51,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:52,478 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:52,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:52,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 06:14:52,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:52,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:14:52,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:14:52,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:14:52,480 INFO L87 Difference]: Start difference. First operand 20132 states and 23241 transitions. Second operand 24 states. [2019-09-10 06:14:52,690 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 06:14:53,784 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-10 06:14:53,941 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 06:14:54,502 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-10 06:14:54,646 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 06:14:56,361 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-10 06:14:57,149 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 06:14:57,425 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-10 06:14:57,942 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 06:14:58,382 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 06:14:59,209 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-10 06:15:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:00,576 INFO L93 Difference]: Finished difference Result 27009 states and 32776 transitions. [2019-09-10 06:15:00,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 06:15:00,576 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 181 [2019-09-10 06:15:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:00,604 INFO L225 Difference]: With dead ends: 27009 [2019-09-10 06:15:00,604 INFO L226 Difference]: Without dead ends: 27009 [2019-09-10 06:15:00,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=637, Invalid=3523, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 06:15:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27009 states. [2019-09-10 06:15:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27009 to 19913. [2019-09-10 06:15:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19913 states. [2019-09-10 06:15:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19913 states to 19913 states and 22998 transitions. [2019-09-10 06:15:00,819 INFO L78 Accepts]: Start accepts. Automaton has 19913 states and 22998 transitions. Word has length 181 [2019-09-10 06:15:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:00,819 INFO L475 AbstractCegarLoop]: Abstraction has 19913 states and 22998 transitions. [2019-09-10 06:15:00,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:15:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 19913 states and 22998 transitions. [2019-09-10 06:15:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:15:00,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:00,829 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:00,830 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:00,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:00,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1719809857, now seen corresponding path program 1 times [2019-09-10 06:15:00,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:00,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:00,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:00,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:00,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:01,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:15:01,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:01,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:15:01,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:01,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:15:01,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:15:01,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:15:01,562 INFO L87 Difference]: Start difference. First operand 19913 states and 22998 transitions. Second operand 16 states. [2019-09-10 06:15:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:03,576 INFO L93 Difference]: Finished difference Result 19810 states and 22877 transitions. [2019-09-10 06:15:03,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:15:03,577 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 181 [2019-09-10 06:15:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:03,595 INFO L225 Difference]: With dead ends: 19810 [2019-09-10 06:15:03,596 INFO L226 Difference]: Without dead ends: 19810 [2019-09-10 06:15:03,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:15:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19810 states. [2019-09-10 06:15:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19810 to 19808. [2019-09-10 06:15:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19808 states. [2019-09-10 06:15:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19808 states to 19808 states and 22876 transitions. [2019-09-10 06:15:03,764 INFO L78 Accepts]: Start accepts. Automaton has 19808 states and 22876 transitions. Word has length 181 [2019-09-10 06:15:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:03,765 INFO L475 AbstractCegarLoop]: Abstraction has 19808 states and 22876 transitions. [2019-09-10 06:15:03,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:15:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 19808 states and 22876 transitions. [2019-09-10 06:15:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:15:03,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:03,775 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:03,775 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:03,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:03,776 INFO L82 PathProgramCache]: Analyzing trace with hash -188723676, now seen corresponding path program 1 times [2019-09-10 06:15:03,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:03,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:03,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:03,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:04,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:04,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:15:04,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:04,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:15:04,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:15:04,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:15:04,746 INFO L87 Difference]: Start difference. First operand 19808 states and 22876 transitions. Second operand 19 states. [2019-09-10 06:15:04,881 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-09-10 06:15:07,477 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-09-10 06:15:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:10,348 INFO L93 Difference]: Finished difference Result 23340 states and 27666 transitions. [2019-09-10 06:15:10,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 06:15:10,348 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 181 [2019-09-10 06:15:10,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:10,365 INFO L225 Difference]: With dead ends: 23340 [2019-09-10 06:15:10,365 INFO L226 Difference]: Without dead ends: 22608 [2019-09-10 06:15:10,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=693, Invalid=2847, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:15:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22608 states. [2019-09-10 06:15:10,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22608 to 18942. [2019-09-10 06:15:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18942 states. [2019-09-10 06:15:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18942 states to 18942 states and 21957 transitions. [2019-09-10 06:15:10,525 INFO L78 Accepts]: Start accepts. Automaton has 18942 states and 21957 transitions. Word has length 181 [2019-09-10 06:15:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:10,526 INFO L475 AbstractCegarLoop]: Abstraction has 18942 states and 21957 transitions. [2019-09-10 06:15:10,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:15:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 18942 states and 21957 transitions. [2019-09-10 06:15:10,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:15:10,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:10,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:10,534 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:10,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash 646514906, now seen corresponding path program 1 times [2019-09-10 06:15:10,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:10,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:10,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:10,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:10,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:11,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:15:11,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:11,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 06:15:11,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:11,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:15:11,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:15:11,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:15:11,539 INFO L87 Difference]: Start difference. First operand 18942 states and 21957 transitions. Second operand 20 states. [2019-09-10 06:15:12,073 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 06:15:12,281 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 06:15:12,475 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 06:15:12,808 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-09-10 06:15:13,037 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2019-09-10 06:15:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:16,783 INFO L93 Difference]: Finished difference Result 20842 states and 24451 transitions. [2019-09-10 06:15:16,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 06:15:16,783 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 181 [2019-09-10 06:15:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:16,800 INFO L225 Difference]: With dead ends: 20842 [2019-09-10 06:15:16,801 INFO L226 Difference]: Without dead ends: 20842 [2019-09-10 06:15:16,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:15:16,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20842 states. [2019-09-10 06:15:16,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20842 to 18484. [2019-09-10 06:15:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18484 states. [2019-09-10 06:15:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18484 states to 18484 states and 21483 transitions. [2019-09-10 06:15:16,961 INFO L78 Accepts]: Start accepts. Automaton has 18484 states and 21483 transitions. Word has length 181 [2019-09-10 06:15:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:16,961 INFO L475 AbstractCegarLoop]: Abstraction has 18484 states and 21483 transitions. [2019-09-10 06:15:16,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:15:16,961 INFO L276 IsEmpty]: Start isEmpty. Operand 18484 states and 21483 transitions. [2019-09-10 06:15:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:15:16,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:16,970 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:16,971 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:16,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:16,971 INFO L82 PathProgramCache]: Analyzing trace with hash 815493270, now seen corresponding path program 1 times [2019-09-10 06:15:16,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:16,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:16,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:16,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:16,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:18,428 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:18,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:18,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 06:15:18,428 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:18,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 06:15:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 06:15:18,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:15:18,429 INFO L87 Difference]: Start difference. First operand 18484 states and 21483 transitions. Second operand 27 states. [2019-09-10 06:15:19,099 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-10 06:15:19,279 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 06:15:19,566 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 06:15:19,822 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 06:15:20,156 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 06:15:20,529 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 06:15:21,038 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 06:15:21,221 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 06:15:21,464 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:15:21,744 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:15:26,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:26,379 INFO L93 Difference]: Finished difference Result 25545 states and 31210 transitions. [2019-09-10 06:15:26,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:15:26,380 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 181 [2019-09-10 06:15:26,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:26,403 INFO L225 Difference]: With dead ends: 25545 [2019-09-10 06:15:26,404 INFO L226 Difference]: Without dead ends: 25545 [2019-09-10 06:15:26,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=371, Invalid=1885, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:15:26,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25545 states. [2019-09-10 06:15:26,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25545 to 18502. [2019-09-10 06:15:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18502 states. [2019-09-10 06:15:26,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18502 states to 18502 states and 21499 transitions. [2019-09-10 06:15:26,580 INFO L78 Accepts]: Start accepts. Automaton has 18502 states and 21499 transitions. Word has length 181 [2019-09-10 06:15:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:26,580 INFO L475 AbstractCegarLoop]: Abstraction has 18502 states and 21499 transitions. [2019-09-10 06:15:26,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 06:15:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 18502 states and 21499 transitions. [2019-09-10 06:15:26,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:15:26,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:26,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:26,590 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:26,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:26,590 INFO L82 PathProgramCache]: Analyzing trace with hash -940362739, now seen corresponding path program 1 times [2019-09-10 06:15:26,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:26,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:26,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:26,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:26,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:27,056 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:27,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:27,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:15:27,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:27,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:15:27,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:15:27,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:15:27,057 INFO L87 Difference]: Start difference. First operand 18502 states and 21499 transitions. Second operand 17 states. [2019-09-10 06:15:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:30,363 INFO L93 Difference]: Finished difference Result 24890 states and 30046 transitions. [2019-09-10 06:15:30,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:15:30,364 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 181 [2019-09-10 06:15:30,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:30,390 INFO L225 Difference]: With dead ends: 24890 [2019-09-10 06:15:30,391 INFO L226 Difference]: Without dead ends: 24742 [2019-09-10 06:15:30,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=385, Invalid=1021, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:15:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24742 states. [2019-09-10 06:15:30,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24742 to 19433. [2019-09-10 06:15:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19433 states. [2019-09-10 06:15:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19433 states to 19433 states and 22463 transitions. [2019-09-10 06:15:30,600 INFO L78 Accepts]: Start accepts. Automaton has 19433 states and 22463 transitions. Word has length 181 [2019-09-10 06:15:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:30,600 INFO L475 AbstractCegarLoop]: Abstraction has 19433 states and 22463 transitions. [2019-09-10 06:15:30,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:15:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 19433 states and 22463 transitions. [2019-09-10 06:15:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:15:30,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:30,611 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:30,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:30,612 INFO L82 PathProgramCache]: Analyzing trace with hash -914028939, now seen corresponding path program 1 times [2019-09-10 06:15:30,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:30,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:30,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:30,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:30,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:31,605 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,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:31,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:15:31,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:31,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:15:31,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:15:31,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:15:31,607 INFO L87 Difference]: Start difference. First operand 19433 states and 22463 transitions. Second operand 23 states. [2019-09-10 06:15:31,939 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-09-10 06:15:32,241 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 06:15:33,299 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 06:15:33,560 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 06:15:33,806 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 06:15:33,962 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:15:34,230 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:15:34,463 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 06:15:34,751 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 06:15:34,980 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 06:15:40,849 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 06:15:41,023 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-10 06:15:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:41,617 INFO L93 Difference]: Finished difference Result 23653 states and 28419 transitions. [2019-09-10 06:15:41,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 06:15:41,617 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 181 [2019-09-10 06:15:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:41,639 INFO L225 Difference]: With dead ends: 23653 [2019-09-10 06:15:41,639 INFO L226 Difference]: Without dead ends: 23653 [2019-09-10 06:15:41,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=829, Invalid=3331, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 06:15:41,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23653 states. [2019-09-10 06:15:41,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23653 to 19361. [2019-09-10 06:15:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19361 states. [2019-09-10 06:15:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19361 states to 19361 states and 22388 transitions. [2019-09-10 06:15:41,803 INFO L78 Accepts]: Start accepts. Automaton has 19361 states and 22388 transitions. Word has length 181 [2019-09-10 06:15:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:41,804 INFO L475 AbstractCegarLoop]: Abstraction has 19361 states and 22388 transitions. [2019-09-10 06:15:41,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:15:41,804 INFO L276 IsEmpty]: Start isEmpty. Operand 19361 states and 22388 transitions. [2019-09-10 06:15:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:15:41,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:41,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:41,814 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:41,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:41,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1093195945, now seen corresponding path program 1 times [2019-09-10 06:15:41,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:41,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:41,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:41,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:41,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:43,042 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:43,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:43,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 06:15:43,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:43,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 06:15:43,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 06:15:43,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:15:43,044 INFO L87 Difference]: Start difference. First operand 19361 states and 22388 transitions. Second operand 28 states. [2019-09-10 06:15:44,344 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:15:44,570 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 06:15:44,907 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 06:15:45,201 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 06:15:45,492 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 06:15:45,651 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 06:15:46,007 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 06:15:46,383 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 06:15:47,711 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 06:15:48,071 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 06:15:48,243 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 06:15:48,688 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 06:15:49,222 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 06:15:50,020 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 06:15:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:51,448 INFO L93 Difference]: Finished difference Result 19339 states and 22357 transitions. [2019-09-10 06:15:51,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:15:51,448 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 181 [2019-09-10 06:15:51,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:51,462 INFO L225 Difference]: With dead ends: 19339 [2019-09-10 06:15:51,462 INFO L226 Difference]: Without dead ends: 19339 [2019-09-10 06:15:51,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=598, Invalid=2482, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 06:15:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19339 states. [2019-09-10 06:15:51,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19339 to 19202. [2019-09-10 06:15:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19202 states. [2019-09-10 06:15:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19202 states to 19202 states and 22221 transitions. [2019-09-10 06:15:51,604 INFO L78 Accepts]: Start accepts. Automaton has 19202 states and 22221 transitions. Word has length 181 [2019-09-10 06:15:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:51,605 INFO L475 AbstractCegarLoop]: Abstraction has 19202 states and 22221 transitions. [2019-09-10 06:15:51,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 06:15:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 19202 states and 22221 transitions. [2019-09-10 06:15:51,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:15:51,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:51,614 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:51,615 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:51,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:51,615 INFO L82 PathProgramCache]: Analyzing trace with hash -830116433, now seen corresponding path program 1 times [2019-09-10 06:15:51,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:51,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:51,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:51,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:51,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:52,063 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:52,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:52,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:15:52,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:52,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:15:52,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:15:52,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:15:52,065 INFO L87 Difference]: Start difference. First operand 19202 states and 22221 transitions. Second operand 16 states. [2019-09-10 06:15:53,236 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-10 06:15:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:54,350 INFO L93 Difference]: Finished difference Result 19202 states and 22217 transitions. [2019-09-10 06:15:54,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:15:54,351 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 181 [2019-09-10 06:15:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:54,366 INFO L225 Difference]: With dead ends: 19202 [2019-09-10 06:15:54,367 INFO L226 Difference]: Without dead ends: 19202 [2019-09-10 06:15:54,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:15:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19202 states. [2019-09-10 06:15:54,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19202 to 19196. [2019-09-10 06:15:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19196 states. [2019-09-10 06:15:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19196 states to 19196 states and 22212 transitions. [2019-09-10 06:15:54,523 INFO L78 Accepts]: Start accepts. Automaton has 19196 states and 22212 transitions. Word has length 181 [2019-09-10 06:15:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:54,524 INFO L475 AbstractCegarLoop]: Abstraction has 19196 states and 22212 transitions. [2019-09-10 06:15:54,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:15:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 19196 states and 22212 transitions. [2019-09-10 06:15:54,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:15:54,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:54,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:54,534 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:54,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:54,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1172654365, now seen corresponding path program 1 times [2019-09-10 06:15:54,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:54,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:54,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:54,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:54,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:55,350 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:55,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:55,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 06:15:55,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:55,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:15:55,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:15:55,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:15:55,352 INFO L87 Difference]: Start difference. First operand 19196 states and 22212 transitions. Second operand 20 states. [2019-09-10 06:15:59,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:59,143 INFO L93 Difference]: Finished difference Result 23895 states and 28623 transitions. [2019-09-10 06:15:59,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:15:59,144 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 181 [2019-09-10 06:15:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:59,168 INFO L225 Difference]: With dead ends: 23895 [2019-09-10 06:15:59,168 INFO L226 Difference]: Without dead ends: 23895 [2019-09-10 06:15:59,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=298, Invalid=1342, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 06:15:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23895 states. [2019-09-10 06:15:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23895 to 19592. [2019-09-10 06:15:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19592 states. [2019-09-10 06:15:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19592 states to 19592 states and 22606 transitions. [2019-09-10 06:15:59,366 INFO L78 Accepts]: Start accepts. Automaton has 19592 states and 22606 transitions. Word has length 181 [2019-09-10 06:15:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:59,366 INFO L475 AbstractCegarLoop]: Abstraction has 19592 states and 22606 transitions. [2019-09-10 06:15:59,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:15:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 19592 states and 22606 transitions. [2019-09-10 06:15:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:15:59,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:59,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] [2019-09-10 06:15:59,377 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:59,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:59,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1842505912, now seen corresponding path program 1 times [2019-09-10 06:15:59,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:59,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:59,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:59,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:59,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:00,165 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2019-09-10 06:16:01,252 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:01,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:01,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 06:16:01,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:01,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:16:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:16:01,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:16:01,253 INFO L87 Difference]: Start difference. First operand 19592 states and 22606 transitions. Second operand 24 states. [2019-09-10 06:16:01,903 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 06:16:02,326 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 06:16:02,562 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 06:16:02,757 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 06:16:03,126 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 06:16:03,385 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 06:16:03,602 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 06:16:03,807 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2019-09-10 06:16:04,571 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 40 [2019-09-10 06:16:05,073 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2019-09-10 06:16:05,327 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 47 [2019-09-10 06:16:05,850 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2019-09-10 06:16:06,503 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-09-10 06:16:06,692 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 06:16:07,391 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-09-10 06:16:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:08,689 INFO L93 Difference]: Finished difference Result 25902 states and 31110 transitions. [2019-09-10 06:16:08,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:16:08,690 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 181 [2019-09-10 06:16:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:08,713 INFO L225 Difference]: With dead ends: 25902 [2019-09-10 06:16:08,713 INFO L226 Difference]: Without dead ends: 25902 [2019-09-10 06:16:08,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=418, Invalid=1304, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:16:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25902 states. [2019-09-10 06:16:08,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25902 to 19600. [2019-09-10 06:16:08,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19600 states. [2019-09-10 06:16:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19600 states to 19600 states and 22613 transitions. [2019-09-10 06:16:08,892 INFO L78 Accepts]: Start accepts. Automaton has 19600 states and 22613 transitions. Word has length 181 [2019-09-10 06:16:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:08,892 INFO L475 AbstractCegarLoop]: Abstraction has 19600 states and 22613 transitions. [2019-09-10 06:16:08,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:16:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand 19600 states and 22613 transitions. [2019-09-10 06:16:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:16:08,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:08,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:08,902 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:08,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:08,902 INFO L82 PathProgramCache]: Analyzing trace with hash -725435669, now seen corresponding path program 1 times [2019-09-10 06:16:08,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:08,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:08,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:08,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:08,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:09,985 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-09-10 06:16:10,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:16:10,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:10,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:16:10,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:10,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:16:10,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:16:10,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:16:10,372 INFO L87 Difference]: Start difference. First operand 19600 states and 22613 transitions. Second operand 25 states. [2019-09-10 06:16:12,232 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 06:16:12,669 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 06:16:12,921 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 06:16:13,072 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 06:16:13,641 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 06:16:13,823 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 06:16:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:15,044 INFO L93 Difference]: Finished difference Result 23435 states and 28034 transitions. [2019-09-10 06:16:15,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:16:15,044 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 181 [2019-09-10 06:16:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:15,067 INFO L225 Difference]: With dead ends: 23435 [2019-09-10 06:16:15,067 INFO L226 Difference]: Without dead ends: 23435 [2019-09-10 06:16:15,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=346, Invalid=1214, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:16:15,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23435 states. [2019-09-10 06:16:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23435 to 19675. [2019-09-10 06:16:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19675 states. [2019-09-10 06:16:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19675 states to 19675 states and 22691 transitions. [2019-09-10 06:16:15,270 INFO L78 Accepts]: Start accepts. Automaton has 19675 states and 22691 transitions. Word has length 181 [2019-09-10 06:16:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:15,271 INFO L475 AbstractCegarLoop]: Abstraction has 19675 states and 22691 transitions. [2019-09-10 06:16:15,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:16:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 19675 states and 22691 transitions. [2019-09-10 06:16:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:16:15,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:15,282 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:15,282 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:15,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:15,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1584310199, now seen corresponding path program 1 times [2019-09-10 06:16:15,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:15,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:15,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:15,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:15,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:16,018 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:16,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:16,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:16:16,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:16,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:16:16,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:16:16,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:16:16,019 INFO L87 Difference]: Start difference. First operand 19675 states and 22691 transitions. Second operand 17 states. [2019-09-10 06:16:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:19,422 INFO L93 Difference]: Finished difference Result 26328 states and 31598 transitions. [2019-09-10 06:16:19,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:16:19,422 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 181 [2019-09-10 06:16:19,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:19,451 INFO L225 Difference]: With dead ends: 26328 [2019-09-10 06:16:19,451 INFO L226 Difference]: Without dead ends: 26312 [2019-09-10 06:16:19,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=351, Invalid=1209, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:16:19,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26312 states. [2019-09-10 06:16:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26312 to 20890. [2019-09-10 06:16:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20890 states. [2019-09-10 06:16:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20890 states to 20890 states and 23956 transitions. [2019-09-10 06:16:19,647 INFO L78 Accepts]: Start accepts. Automaton has 20890 states and 23956 transitions. Word has length 181 [2019-09-10 06:16:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:19,648 INFO L475 AbstractCegarLoop]: Abstraction has 20890 states and 23956 transitions. [2019-09-10 06:16:19,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:16:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 20890 states and 23956 transitions. [2019-09-10 06:16:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:16:19,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:19,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:19,658 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:19,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:19,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1199083704, now seen corresponding path program 1 times [2019-09-10 06:16:19,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:19,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:19,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:19,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:19,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:20,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:16:20,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:20,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:16:20,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:20,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:16:20,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:16:20,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:16:20,183 INFO L87 Difference]: Start difference. First operand 20890 states and 23956 transitions. Second operand 17 states. [2019-09-10 06:16:26,883 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:16:27,033 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-10 06:16:27,271 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 06:16:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:27,405 INFO L93 Difference]: Finished difference Result 27122 states and 32315 transitions. [2019-09-10 06:16:27,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 06:16:27,406 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 181 [2019-09-10 06:16:27,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:27,431 INFO L225 Difference]: With dead ends: 27122 [2019-09-10 06:16:27,431 INFO L226 Difference]: Without dead ends: 27122 [2019-09-10 06:16:27,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=794, Invalid=2746, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:16:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27122 states. [2019-09-10 06:16:27,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27122 to 21224. [2019-09-10 06:16:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21224 states. [2019-09-10 06:16:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21224 states to 21224 states and 24289 transitions. [2019-09-10 06:16:27,619 INFO L78 Accepts]: Start accepts. Automaton has 21224 states and 24289 transitions. Word has length 181 [2019-09-10 06:16:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:27,619 INFO L475 AbstractCegarLoop]: Abstraction has 21224 states and 24289 transitions. [2019-09-10 06:16:27,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:16:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 21224 states and 24289 transitions. [2019-09-10 06:16:27,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:16:27,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:27,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:27,629 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:27,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:27,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1355364095, now seen corresponding path program 1 times [2019-09-10 06:16:27,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:27,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:27,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:27,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:27,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:28,143 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:28,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:28,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:16:28,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:28,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:16:28,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:16:28,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:16:28,145 INFO L87 Difference]: Start difference. First operand 21224 states and 24289 transitions. Second operand 17 states. [2019-09-10 06:16:30,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:30,198 INFO L93 Difference]: Finished difference Result 24938 states and 29428 transitions. [2019-09-10 06:16:30,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:16:30,198 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 181 [2019-09-10 06:16:30,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:30,220 INFO L225 Difference]: With dead ends: 24938 [2019-09-10 06:16:30,220 INFO L226 Difference]: Without dead ends: 24919 [2019-09-10 06:16:30,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=256, Invalid=800, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:16:30,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24919 states. [2019-09-10 06:16:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24919 to 20413. [2019-09-10 06:16:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20413 states. [2019-09-10 06:16:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20413 states to 20413 states and 23442 transitions. [2019-09-10 06:16:30,417 INFO L78 Accepts]: Start accepts. Automaton has 20413 states and 23442 transitions. Word has length 181 [2019-09-10 06:16:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:30,418 INFO L475 AbstractCegarLoop]: Abstraction has 20413 states and 23442 transitions. [2019-09-10 06:16:30,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:16:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 20413 states and 23442 transitions. [2019-09-10 06:16:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:16:30,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:30,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:30,428 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:30,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:30,429 INFO L82 PathProgramCache]: Analyzing trace with hash 970271222, now seen corresponding path program 1 times [2019-09-10 06:16:30,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:30,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:30,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:30,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:30,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:30,842 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:30,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:30,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:16:30,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:30,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:16:30,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:16:30,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:16:30,844 INFO L87 Difference]: Start difference. First operand 20413 states and 23442 transitions. Second operand 17 states. [2019-09-10 06:16:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:34,852 INFO L93 Difference]: Finished difference Result 25042 states and 29960 transitions. [2019-09-10 06:16:34,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 06:16:34,852 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 181 [2019-09-10 06:16:34,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:34,877 INFO L225 Difference]: With dead ends: 25042 [2019-09-10 06:16:34,877 INFO L226 Difference]: Without dead ends: 24978 [2019-09-10 06:16:34,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=625, Invalid=1727, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:16:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24978 states. [2019-09-10 06:16:35,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24978 to 19161. [2019-09-10 06:16:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19161 states. [2019-09-10 06:16:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19161 states to 19161 states and 22098 transitions. [2019-09-10 06:16:35,075 INFO L78 Accepts]: Start accepts. Automaton has 19161 states and 22098 transitions. Word has length 181 [2019-09-10 06:16:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:35,076 INFO L475 AbstractCegarLoop]: Abstraction has 19161 states and 22098 transitions. [2019-09-10 06:16:35,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:16:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 19161 states and 22098 transitions. [2019-09-10 06:16:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:16:35,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:35,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:35,086 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:35,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:35,086 INFO L82 PathProgramCache]: Analyzing trace with hash -970137600, now seen corresponding path program 1 times [2019-09-10 06:16:35,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:35,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:35,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:35,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:35,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:36,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:36,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 06:16:36,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:36,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:16:36,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:16:36,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:16:36,068 INFO L87 Difference]: Start difference. First operand 19161 states and 22098 transitions. Second operand 24 states. [2019-09-10 06:16:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:41,011 INFO L93 Difference]: Finished difference Result 19758 states and 22764 transitions. [2019-09-10 06:16:41,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 06:16:41,011 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 181 [2019-09-10 06:16:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:41,030 INFO L225 Difference]: With dead ends: 19758 [2019-09-10 06:16:41,030 INFO L226 Difference]: Without dead ends: 19758 [2019-09-10 06:16:41,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=466, Invalid=2084, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 06:16:41,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19758 states. [2019-09-10 06:16:41,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19758 to 19033. [2019-09-10 06:16:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19033 states. [2019-09-10 06:16:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19033 states to 19033 states and 21965 transitions. [2019-09-10 06:16:41,195 INFO L78 Accepts]: Start accepts. Automaton has 19033 states and 21965 transitions. Word has length 181 [2019-09-10 06:16:41,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:41,196 INFO L475 AbstractCegarLoop]: Abstraction has 19033 states and 21965 transitions. [2019-09-10 06:16:41,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:16:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 19033 states and 21965 transitions. [2019-09-10 06:16:41,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:16:41,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:41,206 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:41,206 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:41,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:41,206 INFO L82 PathProgramCache]: Analyzing trace with hash -807949330, now seen corresponding path program 1 times [2019-09-10 06:16:41,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:41,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:41,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:41,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:41,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:42,038 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:42,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:42,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:16:42,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:42,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:16:42,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:16:42,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:16:42,039 INFO L87 Difference]: Start difference. First operand 19033 states and 21965 transitions. Second operand 16 states. [2019-09-10 06:16:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:44,456 INFO L93 Difference]: Finished difference Result 21176 states and 24694 transitions. [2019-09-10 06:16:44,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:16:44,457 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 181 [2019-09-10 06:16:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:44,474 INFO L225 Difference]: With dead ends: 21176 [2019-09-10 06:16:44,475 INFO L226 Difference]: Without dead ends: 21063 [2019-09-10 06:16:44,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:16:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21063 states. [2019-09-10 06:16:44,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21063 to 18883. [2019-09-10 06:16:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18883 states. [2019-09-10 06:16:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18883 states to 18883 states and 21813 transitions. [2019-09-10 06:16:44,635 INFO L78 Accepts]: Start accepts. Automaton has 18883 states and 21813 transitions. Word has length 181 [2019-09-10 06:16:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:44,635 INFO L475 AbstractCegarLoop]: Abstraction has 18883 states and 21813 transitions. [2019-09-10 06:16:44,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:16:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 18883 states and 21813 transitions. [2019-09-10 06:16:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:16:44,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:44,645 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:44,645 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:44,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:44,645 INFO L82 PathProgramCache]: Analyzing trace with hash 887599600, now seen corresponding path program 1 times [2019-09-10 06:16:44,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:44,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:44,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:44,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:44,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:45,120 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,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:45,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:16:45,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:45,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:16:45,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:16:45,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:16:45,121 INFO L87 Difference]: Start difference. First operand 18883 states and 21813 transitions. Second operand 17 states. [2019-09-10 06:16:45,767 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:16:45,910 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:16:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:47,893 INFO L93 Difference]: Finished difference Result 21328 states and 25311 transitions. [2019-09-10 06:16:47,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:16:47,894 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 181 [2019-09-10 06:16:47,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:47,910 INFO L225 Difference]: With dead ends: 21328 [2019-09-10 06:16:47,910 INFO L226 Difference]: Without dead ends: 21328 [2019-09-10 06:16:47,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:16:47,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21328 states. [2019-09-10 06:16:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21328 to 18826. [2019-09-10 06:16:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18826 states. [2019-09-10 06:16:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18826 states to 18826 states and 21756 transitions. [2019-09-10 06:16:48,061 INFO L78 Accepts]: Start accepts. Automaton has 18826 states and 21756 transitions. Word has length 181 [2019-09-10 06:16:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:48,062 INFO L475 AbstractCegarLoop]: Abstraction has 18826 states and 21756 transitions. [2019-09-10 06:16:48,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:16:48,062 INFO L276 IsEmpty]: Start isEmpty. Operand 18826 states and 21756 transitions. [2019-09-10 06:16:48,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:16:48,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:48,071 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:48,072 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:48,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:48,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1116545704, now seen corresponding path program 1 times [2019-09-10 06:16:48,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:48,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:48,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:48,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:48,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:48,794 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:48,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:48,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:16:48,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:48,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:16:48,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:16:48,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:16:48,795 INFO L87 Difference]: Start difference. First operand 18826 states and 21756 transitions. Second operand 21 states. [2019-09-10 06:16:49,619 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 06:16:49,778 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 06:16:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:51,919 INFO L93 Difference]: Finished difference Result 18615 states and 21532 transitions. [2019-09-10 06:16:51,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:16:51,920 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 181 [2019-09-10 06:16:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:51,936 INFO L225 Difference]: With dead ends: 18615 [2019-09-10 06:16:51,936 INFO L226 Difference]: Without dead ends: 18609 [2019-09-10 06:16:51,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:16:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18609 states. [2019-09-10 06:16:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18609 to 18609. [2019-09-10 06:16:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18609 states. [2019-09-10 06:16:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18609 states to 18609 states and 21526 transitions. [2019-09-10 06:16:52,091 INFO L78 Accepts]: Start accepts. Automaton has 18609 states and 21526 transitions. Word has length 181 [2019-09-10 06:16:52,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:52,091 INFO L475 AbstractCegarLoop]: Abstraction has 18609 states and 21526 transitions. [2019-09-10 06:16:52,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:16:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 18609 states and 21526 transitions. [2019-09-10 06:16:52,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:16:52,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:52,100 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:52,101 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:52,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:52,101 INFO L82 PathProgramCache]: Analyzing trace with hash -857103932, now seen corresponding path program 1 times [2019-09-10 06:16:52,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:52,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:52,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:52,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:52,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:53,038 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:53,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:53,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:16:53,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:53,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:16:53,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:16:53,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:16:53,039 INFO L87 Difference]: Start difference. First operand 18609 states and 21526 transitions. Second operand 22 states. [2019-09-10 06:16:53,307 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-09-10 06:16:54,591 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 06:16:54,860 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-09-10 06:16:55,123 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-09-10 06:16:58,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:58,318 INFO L93 Difference]: Finished difference Result 18639 states and 21557 transitions. [2019-09-10 06:16:58,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:16:58,318 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 181 [2019-09-10 06:16:58,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:58,339 INFO L225 Difference]: With dead ends: 18639 [2019-09-10 06:16:58,340 INFO L226 Difference]: Without dead ends: 18639 [2019-09-10 06:16:58,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=320, Invalid=1486, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:16:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18639 states. [2019-09-10 06:16:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18639 to 18635. [2019-09-10 06:16:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18635 states. [2019-09-10 06:16:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18635 states to 18635 states and 21553 transitions. [2019-09-10 06:16:58,508 INFO L78 Accepts]: Start accepts. Automaton has 18635 states and 21553 transitions. Word has length 181 [2019-09-10 06:16:58,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:58,509 INFO L475 AbstractCegarLoop]: Abstraction has 18635 states and 21553 transitions. [2019-09-10 06:16:58,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:16:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 18635 states and 21553 transitions. [2019-09-10 06:16:58,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 06:16:58,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:58,518 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:58,519 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:58,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:58,519 INFO L82 PathProgramCache]: Analyzing trace with hash 672002744, now seen corresponding path program 1 times [2019-09-10 06:16:58,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:58,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:58,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:58,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:58,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:59,414 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:59,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:59,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:16:59,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:59,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:16:59,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:16:59,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:16:59,416 INFO L87 Difference]: Start difference. First operand 18635 states and 21553 transitions. Second operand 23 states. [2019-09-10 06:16:59,623 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-09-10 06:17:00,800 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 06:17:01,053 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-09-10 06:17:01,310 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-09-10 06:17:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:04,566 INFO L93 Difference]: Finished difference Result 18414 states and 21326 transitions. [2019-09-10 06:17:04,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:17:04,566 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 181 [2019-09-10 06:17:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:04,583 INFO L225 Difference]: With dead ends: 18414 [2019-09-10 06:17:04,583 INFO L226 Difference]: Without dead ends: 18414 [2019-09-10 06:17:04,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=349, Invalid=1631, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 06:17:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18414 states. [2019-09-10 06:17:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18414 to 18387. [2019-09-10 06:17:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18387 states. [2019-09-10 06:17:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18387 states to 18387 states and 21296 transitions. [2019-09-10 06:17:04,735 INFO L78 Accepts]: Start accepts. Automaton has 18387 states and 21296 transitions. Word has length 181 [2019-09-10 06:17:04,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:04,735 INFO L475 AbstractCegarLoop]: Abstraction has 18387 states and 21296 transitions. [2019-09-10 06:17:04,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:17:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 18387 states and 21296 transitions. [2019-09-10 06:17:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 06:17:04,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:04,745 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:04,745 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:04,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:04,745 INFO L82 PathProgramCache]: Analyzing trace with hash 903830523, now seen corresponding path program 1 times [2019-09-10 06:17:04,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:04,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:04,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:04,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:04,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:05,987 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:05,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:05,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:17:05,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:05,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:17:05,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:17:05,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:17:05,988 INFO L87 Difference]: Start difference. First operand 18387 states and 21296 transitions. Second operand 26 states. [2019-09-10 06:17:06,355 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2019-09-10 06:17:08,501 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 06:17:08,721 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 06:17:09,154 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 06:17:09,562 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:17:09,850 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-10 06:17:10,098 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 06:17:10,388 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 06:17:14,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:14,732 INFO L93 Difference]: Finished difference Result 20256 states and 23624 transitions. [2019-09-10 06:17:14,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:17:14,733 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 182 [2019-09-10 06:17:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:14,749 INFO L225 Difference]: With dead ends: 20256 [2019-09-10 06:17:14,749 INFO L226 Difference]: Without dead ends: 20232 [2019-09-10 06:17:14,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=448, Invalid=2102, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 06:17:14,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20232 states. [2019-09-10 06:17:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20232 to 18633. [2019-09-10 06:17:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18633 states. [2019-09-10 06:17:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18633 states to 18633 states and 21542 transitions. [2019-09-10 06:17:14,900 INFO L78 Accepts]: Start accepts. Automaton has 18633 states and 21542 transitions. Word has length 182 [2019-09-10 06:17:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:14,900 INFO L475 AbstractCegarLoop]: Abstraction has 18633 states and 21542 transitions. [2019-09-10 06:17:14,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:17:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 18633 states and 21542 transitions. [2019-09-10 06:17:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 06:17:14,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:14,909 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:14,909 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:14,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:14,909 INFO L82 PathProgramCache]: Analyzing trace with hash -398146773, now seen corresponding path program 1 times [2019-09-10 06:17:14,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:14,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:14,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:14,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:14,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:15,356 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,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:15,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:17:15,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:15,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:17:15,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:17:15,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:17:15,357 INFO L87 Difference]: Start difference. First operand 18633 states and 21542 transitions. Second operand 18 states. [2019-09-10 06:17:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:21,662 INFO L93 Difference]: Finished difference Result 40469 states and 51107 transitions. [2019-09-10 06:17:21,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 06:17:21,662 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 182 [2019-09-10 06:17:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:21,703 INFO L225 Difference]: With dead ends: 40469 [2019-09-10 06:17:21,704 INFO L226 Difference]: Without dead ends: 40233 [2019-09-10 06:17:21,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=980, Invalid=4720, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 06:17:21,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40233 states. [2019-09-10 06:17:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40233 to 18839. [2019-09-10 06:17:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18839 states. [2019-09-10 06:17:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18839 states to 18839 states and 21746 transitions. [2019-09-10 06:17:21,987 INFO L78 Accepts]: Start accepts. Automaton has 18839 states and 21746 transitions. Word has length 182 [2019-09-10 06:17:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:21,988 INFO L475 AbstractCegarLoop]: Abstraction has 18839 states and 21746 transitions. [2019-09-10 06:17:21,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:17:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 18839 states and 21746 transitions. [2019-09-10 06:17:21,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 06:17:21,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:21,997 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:21,997 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:21,997 INFO L82 PathProgramCache]: Analyzing trace with hash 505958135, now seen corresponding path program 1 times [2019-09-10 06:17:21,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:21,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:21,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:21,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:21,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:22,517 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:22,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:22,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:17:22,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:22,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:17:22,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:17:22,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:17:22,519 INFO L87 Difference]: Start difference. First operand 18839 states and 21746 transitions. Second operand 21 states. [2019-09-10 06:17:26,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:26,571 INFO L93 Difference]: Finished difference Result 25284 states and 30247 transitions. [2019-09-10 06:17:26,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:17:26,571 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 182 [2019-09-10 06:17:26,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:26,595 INFO L225 Difference]: With dead ends: 25284 [2019-09-10 06:17:26,595 INFO L226 Difference]: Without dead ends: 25284 [2019-09-10 06:17:26,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=431, Invalid=1549, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 06:17:26,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25284 states. [2019-09-10 06:17:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25284 to 19638. [2019-09-10 06:17:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19638 states. [2019-09-10 06:17:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19638 states to 19638 states and 22573 transitions. [2019-09-10 06:17:26,767 INFO L78 Accepts]: Start accepts. Automaton has 19638 states and 22573 transitions. Word has length 182 [2019-09-10 06:17:26,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:26,767 INFO L475 AbstractCegarLoop]: Abstraction has 19638 states and 22573 transitions. [2019-09-10 06:17:26,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:17:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 19638 states and 22573 transitions. [2019-09-10 06:17:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 06:17:26,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:26,776 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:26,776 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:26,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:26,776 INFO L82 PathProgramCache]: Analyzing trace with hash -602977755, now seen corresponding path program 1 times [2019-09-10 06:17:26,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:26,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:26,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:27,098 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:27,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:27,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:17:27,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:27,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:17:27,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:17:27,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:17:27,100 INFO L87 Difference]: Start difference. First operand 19638 states and 22573 transitions. Second operand 17 states. [2019-09-10 06:17:30,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:30,501 INFO L93 Difference]: Finished difference Result 25419 states and 30061 transitions. [2019-09-10 06:17:30,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 06:17:30,502 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 182 [2019-09-10 06:17:30,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:30,524 INFO L225 Difference]: With dead ends: 25419 [2019-09-10 06:17:30,524 INFO L226 Difference]: Without dead ends: 25377 [2019-09-10 06:17:30,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=448, Invalid=1808, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:17:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25377 states. [2019-09-10 06:17:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25377 to 22640. [2019-09-10 06:17:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22640 states. [2019-09-10 06:17:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22640 states to 22640 states and 26706 transitions. [2019-09-10 06:17:30,728 INFO L78 Accepts]: Start accepts. Automaton has 22640 states and 26706 transitions. Word has length 182 [2019-09-10 06:17:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:30,728 INFO L475 AbstractCegarLoop]: Abstraction has 22640 states and 26706 transitions. [2019-09-10 06:17:30,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:17:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 22640 states and 26706 transitions. [2019-09-10 06:17:30,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 06:17:30,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:30,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] [2019-09-10 06:17:30,738 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:30,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:30,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1418366187, now seen corresponding path program 1 times [2019-09-10 06:17:30,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:30,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:30,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:30,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:30,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:31,150 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:31,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:31,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:17:31,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:31,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:17:31,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:17:31,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:17:31,152 INFO L87 Difference]: Start difference. First operand 22640 states and 26706 transitions. Second operand 16 states. [2019-09-10 06:17:33,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:33,404 INFO L93 Difference]: Finished difference Result 24883 states and 29039 transitions. [2019-09-10 06:17:33,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:17:33,404 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 182 [2019-09-10 06:17:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:33,427 INFO L225 Difference]: With dead ends: 24883 [2019-09-10 06:17:33,428 INFO L226 Difference]: Without dead ends: 24573 [2019-09-10 06:17:33,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=1049, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:17:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24573 states. [2019-09-10 06:17:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24573 to 21369. [2019-09-10 06:17:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21369 states. [2019-09-10 06:17:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21369 states to 21369 states and 24860 transitions. [2019-09-10 06:17:33,621 INFO L78 Accepts]: Start accepts. Automaton has 21369 states and 24860 transitions. Word has length 182 [2019-09-10 06:17:33,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:33,621 INFO L475 AbstractCegarLoop]: Abstraction has 21369 states and 24860 transitions. [2019-09-10 06:17:33,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:17:33,621 INFO L276 IsEmpty]: Start isEmpty. Operand 21369 states and 24860 transitions. [2019-09-10 06:17:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 06:17:33,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:33,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:33,632 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1752436859, now seen corresponding path program 1 times [2019-09-10 06:17:33,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:33,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:33,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:33,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:33,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:34,300 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:34,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:34,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:17:34,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:34,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:17:34,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:17:34,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:17:34,301 INFO L87 Difference]: Start difference. First operand 21369 states and 24860 transitions. Second operand 21 states. [2019-09-10 06:17:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:41,554 INFO L93 Difference]: Finished difference Result 31413 states and 38207 transitions. [2019-09-10 06:17:41,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 06:17:41,555 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 182 [2019-09-10 06:17:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:41,580 INFO L225 Difference]: With dead ends: 31413 [2019-09-10 06:17:41,581 INFO L226 Difference]: Without dead ends: 31008 [2019-09-10 06:17:41,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=591, Invalid=2489, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 06:17:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31008 states. [2019-09-10 06:17:41,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31008 to 21404. [2019-09-10 06:17:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21404 states. [2019-09-10 06:17:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21404 states to 21404 states and 24884 transitions. [2019-09-10 06:17:41,790 INFO L78 Accepts]: Start accepts. Automaton has 21404 states and 24884 transitions. Word has length 182 [2019-09-10 06:17:41,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:41,790 INFO L475 AbstractCegarLoop]: Abstraction has 21404 states and 24884 transitions. [2019-09-10 06:17:41,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:17:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 21404 states and 24884 transitions. [2019-09-10 06:17:41,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 06:17:41,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:41,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,801 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:41,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:41,801 INFO L82 PathProgramCache]: Analyzing trace with hash -729842352, now seen corresponding path program 1 times [2019-09-10 06:17:41,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:41,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:41,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:41,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:41,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:42,287 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:42,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:42,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:17:42,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:42,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:17:42,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:17:42,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:17:42,289 INFO L87 Difference]: Start difference. First operand 21404 states and 24884 transitions. Second operand 22 states. [2019-09-10 06:17:47,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:47,151 INFO L93 Difference]: Finished difference Result 30203 states and 36565 transitions. [2019-09-10 06:17:47,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:17:47,151 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 182 [2019-09-10 06:17:47,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:47,177 INFO L225 Difference]: With dead ends: 30203 [2019-09-10 06:17:47,177 INFO L226 Difference]: Without dead ends: 30203 [2019-09-10 06:17:47,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=584, Invalid=1866, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:17:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30203 states. [2019-09-10 06:17:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30203 to 21842. [2019-09-10 06:17:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21842 states. [2019-09-10 06:17:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21842 states to 21842 states and 25346 transitions. [2019-09-10 06:17:47,397 INFO L78 Accepts]: Start accepts. Automaton has 21842 states and 25346 transitions. Word has length 182 [2019-09-10 06:17:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:47,398 INFO L475 AbstractCegarLoop]: Abstraction has 21842 states and 25346 transitions. [2019-09-10 06:17:47,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:17:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 21842 states and 25346 transitions. [2019-09-10 06:17:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 06:17:47,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:47,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] [2019-09-10 06:17:47,408 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:47,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:47,408 INFO L82 PathProgramCache]: Analyzing trace with hash -757214550, now seen corresponding path program 1 times [2019-09-10 06:17:47,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:47,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:47,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:47,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:47,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:48,326 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:48,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:48,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:17:48,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:48,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:17:48,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:17:48,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:17:48,327 INFO L87 Difference]: Start difference. First operand 21842 states and 25346 transitions. Second operand 26 states. [2019-09-10 06:17:48,547 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 06:17:49,550 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 06:17:49,943 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 06:17:50,159 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 06:17:50,587 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 06:17:54,580 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:17:56,096 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 06:18:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:00,179 INFO L93 Difference]: Finished difference Result 33328 states and 41240 transitions. [2019-09-10 06:18:00,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 06:18:00,180 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 182 [2019-09-10 06:18:00,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:00,219 INFO L225 Difference]: With dead ends: 33328 [2019-09-10 06:18:00,219 INFO L226 Difference]: Without dead ends: 33328 [2019-09-10 06:18:00,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=468, Invalid=2612, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 06:18:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33328 states. [2019-09-10 06:18:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33328 to 22278. [2019-09-10 06:18:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22278 states. [2019-09-10 06:18:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22278 states to 22278 states and 25789 transitions. [2019-09-10 06:18:00,583 INFO L78 Accepts]: Start accepts. Automaton has 22278 states and 25789 transitions. Word has length 182 [2019-09-10 06:18:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:00,584 INFO L475 AbstractCegarLoop]: Abstraction has 22278 states and 25789 transitions. [2019-09-10 06:18:00,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:18:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 22278 states and 25789 transitions. [2019-09-10 06:18:00,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 06:18:00,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:00,603 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:00,604 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:00,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:00,604 INFO L82 PathProgramCache]: Analyzing trace with hash 366057836, now seen corresponding path program 1 times [2019-09-10 06:18:00,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:00,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:00,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:00,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:00,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:01,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:01,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:18:01,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:01,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:18:01,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:18:01,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:18:01,093 INFO L87 Difference]: Start difference. First operand 22278 states and 25789 transitions. Second operand 22 states. [2019-09-10 06:18:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:07,040 INFO L93 Difference]: Finished difference Result 33649 states and 41141 transitions. [2019-09-10 06:18:07,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 06:18:07,040 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 182 [2019-09-10 06:18:07,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:07,067 INFO L225 Difference]: With dead ends: 33649 [2019-09-10 06:18:07,068 INFO L226 Difference]: Without dead ends: 33649 [2019-09-10 06:18:07,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=662, Invalid=2760, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 06:18:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33649 states. [2019-09-10 06:18:07,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33649 to 22500. [2019-09-10 06:18:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22500 states. [2019-09-10 06:18:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22500 states to 22500 states and 26016 transitions. [2019-09-10 06:18:07,416 INFO L78 Accepts]: Start accepts. Automaton has 22500 states and 26016 transitions. Word has length 182 [2019-09-10 06:18:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:07,416 INFO L475 AbstractCegarLoop]: Abstraction has 22500 states and 26016 transitions. [2019-09-10 06:18:07,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:18:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 22500 states and 26016 transitions. [2019-09-10 06:18:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 06:18:07,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:07,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:07,426 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:07,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:07,427 INFO L82 PathProgramCache]: Analyzing trace with hash 338685638, now seen corresponding path program 1 times [2019-09-10 06:18:07,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:07,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:07,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:07,819 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:07,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:07,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:18:07,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:07,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:18:07,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:18:07,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:18:07,820 INFO L87 Difference]: Start difference. First operand 22500 states and 26016 transitions. Second operand 17 states. [2019-09-10 06:18:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:09,638 INFO L93 Difference]: Finished difference Result 23478 states and 27030 transitions. [2019-09-10 06:18:09,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:18:09,638 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 182 [2019-09-10 06:18:09,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:09,655 INFO L225 Difference]: With dead ends: 23478 [2019-09-10 06:18:09,655 INFO L226 Difference]: Without dead ends: 22790 [2019-09-10 06:18:09,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=228, Invalid=962, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:18:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22790 states. [2019-09-10 06:18:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22790 to 22192. [2019-09-10 06:18:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22192 states. [2019-09-10 06:18:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22192 states to 22192 states and 25676 transitions. [2019-09-10 06:18:09,817 INFO L78 Accepts]: Start accepts. Automaton has 22192 states and 25676 transitions. Word has length 182 [2019-09-10 06:18:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:09,818 INFO L475 AbstractCegarLoop]: Abstraction has 22192 states and 25676 transitions. [2019-09-10 06:18:09,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:18:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 22192 states and 25676 transitions. [2019-09-10 06:18:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 06:18:09,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:09,827 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:09,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:09,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1339931684, now seen corresponding path program 1 times [2019-09-10 06:18:09,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:09,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:09,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:09,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:09,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:10,166 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,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:10,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:18:10,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:10,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:18:10,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:18:10,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:18:10,167 INFO L87 Difference]: Start difference. First operand 22192 states and 25676 transitions. Second operand 16 states. [2019-09-10 06:18:10,301 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 06:18:12,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:12,259 INFO L93 Difference]: Finished difference Result 22806 states and 26283 transitions. [2019-09-10 06:18:12,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:18:12,260 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 182 [2019-09-10 06:18:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:12,275 INFO L225 Difference]: With dead ends: 22806 [2019-09-10 06:18:12,275 INFO L226 Difference]: Without dead ends: 22806 [2019-09-10 06:18:12,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:18:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22806 states. [2019-09-10 06:18:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22806 to 22476. [2019-09-10 06:18:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22476 states. [2019-09-10 06:18:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22476 states to 22476 states and 25948 transitions. [2019-09-10 06:18:12,431 INFO L78 Accepts]: Start accepts. Automaton has 22476 states and 25948 transitions. Word has length 182 [2019-09-10 06:18:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:12,431 INFO L475 AbstractCegarLoop]: Abstraction has 22476 states and 25948 transitions. [2019-09-10 06:18:12,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:18:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 22476 states and 25948 transitions. [2019-09-10 06:18:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 06:18:12,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:12,441 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:12,442 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:12,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:12,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1553656895, now seen corresponding path program 1 times [2019-09-10 06:18:12,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:12,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:12,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:12,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:12,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:13,067 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:13,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:13,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:18:13,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:13,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:18:13,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:18:13,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:18:13,069 INFO L87 Difference]: Start difference. First operand 22476 states and 25948 transitions. Second operand 21 states. [2019-09-10 06:18:13,293 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-09-10 06:18:14,172 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:18:15,840 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-09-10 06:18:16,490 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:18:18,793 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:18:21,062 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 06:18:22,005 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:18:26,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:26,178 INFO L93 Difference]: Finished difference Result 33554 states and 41296 transitions. [2019-09-10 06:18:26,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 06:18:26,179 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 182 [2019-09-10 06:18:26,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:26,204 INFO L225 Difference]: With dead ends: 33554 [2019-09-10 06:18:26,204 INFO L226 Difference]: Without dead ends: 33252 [2019-09-10 06:18:26,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=810, Invalid=3350, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 06:18:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33252 states. [2019-09-10 06:18:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33252 to 22080. [2019-09-10 06:18:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22080 states. [2019-09-10 06:18:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22080 states to 22080 states and 25546 transitions. [2019-09-10 06:18:26,422 INFO L78 Accepts]: Start accepts. Automaton has 22080 states and 25546 transitions. Word has length 182 [2019-09-10 06:18:26,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:26,422 INFO L475 AbstractCegarLoop]: Abstraction has 22080 states and 25546 transitions. [2019-09-10 06:18:26,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:18:26,422 INFO L276 IsEmpty]: Start isEmpty. Operand 22080 states and 25546 transitions. [2019-09-10 06:18:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 06:18:26,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:26,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:26,432 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash 49211065, now seen corresponding path program 1 times [2019-09-10 06:18:26,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:26,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:26,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:26,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:26,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:27,006 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,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:27,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:18:27,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:27,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:18:27,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:18:27,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:18:27,007 INFO L87 Difference]: Start difference. First operand 22080 states and 25546 transitions. Second operand 22 states. [2019-09-10 06:18:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:35,572 INFO L93 Difference]: Finished difference Result 35532 states and 44347 transitions. [2019-09-10 06:18:35,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 06:18:35,572 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 182 [2019-09-10 06:18:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:35,603 INFO L225 Difference]: With dead ends: 35532 [2019-09-10 06:18:35,604 INFO L226 Difference]: Without dead ends: 35498 [2019-09-10 06:18:35,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=624, Invalid=2916, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:18:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35498 states. [2019-09-10 06:18:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35498 to 22060. [2019-09-10 06:18:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22060 states. [2019-09-10 06:18:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22060 states to 22060 states and 25520 transitions. [2019-09-10 06:18:35,829 INFO L78 Accepts]: Start accepts. Automaton has 22060 states and 25520 transitions. Word has length 182 [2019-09-10 06:18:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:35,829 INFO L475 AbstractCegarLoop]: Abstraction has 22060 states and 25520 transitions. [2019-09-10 06:18:35,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:18:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 22060 states and 25520 transitions. [2019-09-10 06:18:35,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 06:18:35,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:35,839 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:35,839 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:35,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:35,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1145111253, now seen corresponding path program 1 times [2019-09-10 06:18:35,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:35,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:35,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:35,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:35,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:36,281 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:36,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:36,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:18:36,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:36,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:18:36,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:18:36,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:18:36,282 INFO L87 Difference]: Start difference. First operand 22060 states and 25520 transitions. Second operand 21 states. [2019-09-10 06:18:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:43,040 INFO L93 Difference]: Finished difference Result 31941 states and 38881 transitions. [2019-09-10 06:18:43,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 06:18:43,041 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 182 [2019-09-10 06:18:43,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:43,066 INFO L225 Difference]: With dead ends: 31941 [2019-09-10 06:18:43,067 INFO L226 Difference]: Without dead ends: 31339 [2019-09-10 06:18:43,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=557, Invalid=2199, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 06:18:43,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31339 states. [2019-09-10 06:18:43,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31339 to 21964. [2019-09-10 06:18:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21964 states. [2019-09-10 06:18:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21964 states to 21964 states and 25404 transitions. [2019-09-10 06:18:43,286 INFO L78 Accepts]: Start accepts. Automaton has 21964 states and 25404 transitions. Word has length 182 [2019-09-10 06:18:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:43,286 INFO L475 AbstractCegarLoop]: Abstraction has 21964 states and 25404 transitions. [2019-09-10 06:18:43,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:18:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 21964 states and 25404 transitions. [2019-09-10 06:18:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 06:18:43,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:43,296 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:43,297 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:43,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:43,297 INFO L82 PathProgramCache]: Analyzing trace with hash -837520036, now seen corresponding path program 1 times [2019-09-10 06:18:43,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:43,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:43,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:43,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:43,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:43,355 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:43,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:43,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:43,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:43,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:43,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:43,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:43,357 INFO L87 Difference]: Start difference. First operand 21964 states and 25404 transitions. Second operand 3 states. [2019-09-10 06:18:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:43,487 INFO L93 Difference]: Finished difference Result 26518 states and 31348 transitions. [2019-09-10 06:18:43,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:43,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 06:18:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:43,511 INFO L225 Difference]: With dead ends: 26518 [2019-09-10 06:18:43,512 INFO L226 Difference]: Without dead ends: 26518 [2019-09-10 06:18:43,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26518 states. [2019-09-10 06:18:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26518 to 26344. [2019-09-10 06:18:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26344 states. [2019-09-10 06:18:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26344 states to 26344 states and 31089 transitions. [2019-09-10 06:18:43,716 INFO L78 Accepts]: Start accepts. Automaton has 26344 states and 31089 transitions. Word has length 185 [2019-09-10 06:18:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:43,716 INFO L475 AbstractCegarLoop]: Abstraction has 26344 states and 31089 transitions. [2019-09-10 06:18:43,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 26344 states and 31089 transitions. [2019-09-10 06:18:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:43,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:43,726 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:43,726 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:43,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:43,727 INFO L82 PathProgramCache]: Analyzing trace with hash -942656122, now seen corresponding path program 1 times [2019-09-10 06:18:43,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:43,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:43,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:43,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:43,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:43,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:43,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:18:43,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:43,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:18:43,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:18:43,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:18:43,816 INFO L87 Difference]: Start difference. First operand 26344 states and 31089 transitions. Second operand 6 states. [2019-09-10 06:18:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:43,949 INFO L93 Difference]: Finished difference Result 33342 states and 40850 transitions. [2019-09-10 06:18:43,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:18:43,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-09-10 06:18:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:43,977 INFO L225 Difference]: With dead ends: 33342 [2019-09-10 06:18:43,977 INFO L226 Difference]: Without dead ends: 33342 [2019-09-10 06:18:43,978 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:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33342 states. [2019-09-10 06:18:44,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33342 to 26398. [2019-09-10 06:18:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26398 states. [2019-09-10 06:18:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26398 states to 26398 states and 31143 transitions. [2019-09-10 06:18:44,223 INFO L78 Accepts]: Start accepts. Automaton has 26398 states and 31143 transitions. Word has length 186 [2019-09-10 06:18:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:44,223 INFO L475 AbstractCegarLoop]: Abstraction has 26398 states and 31143 transitions. [2019-09-10 06:18:44,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:18:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 26398 states and 31143 transitions. [2019-09-10 06:18:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:44,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:44,233 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:44,233 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:44,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:44,234 INFO L82 PathProgramCache]: Analyzing trace with hash -940809080, now seen corresponding path program 1 times [2019-09-10 06:18:44,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:44,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:44,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:44,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:44,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:44,354 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:44,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:44,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:18:44,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:44,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:18:44,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:18:44,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:44,355 INFO L87 Difference]: Start difference. First operand 26398 states and 31143 transitions. Second operand 5 states. [2019-09-10 06:18:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:44,497 INFO L93 Difference]: Finished difference Result 28522 states and 33972 transitions. [2019-09-10 06:18:44,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:18:44,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-09-10 06:18:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:44,523 INFO L225 Difference]: With dead ends: 28522 [2019-09-10 06:18:44,523 INFO L226 Difference]: Without dead ends: 28522 [2019-09-10 06:18:44,523 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:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28522 states. [2019-09-10 06:18:44,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28522 to 28484. [2019-09-10 06:18:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28484 states. [2019-09-10 06:18:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28484 states to 28484 states and 33935 transitions. [2019-09-10 06:18:44,757 INFO L78 Accepts]: Start accepts. Automaton has 28484 states and 33935 transitions. Word has length 186 [2019-09-10 06:18:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:44,757 INFO L475 AbstractCegarLoop]: Abstraction has 28484 states and 33935 transitions. [2019-09-10 06:18:44,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:18:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 28484 states and 33935 transitions. [2019-09-10 06:18:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:44,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:44,768 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:44,768 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:44,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:44,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1628074122, now seen corresponding path program 1 times [2019-09-10 06:18:44,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:44,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:44,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:44,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:44,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:44,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:44,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:18:44,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:44,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:18:44,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:18:44,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:44,899 INFO L87 Difference]: Start difference. First operand 28484 states and 33935 transitions. Second operand 5 states. [2019-09-10 06:18:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:45,026 INFO L93 Difference]: Finished difference Result 30626 states and 36782 transitions. [2019-09-10 06:18:45,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:18:45,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-09-10 06:18:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:45,053 INFO L225 Difference]: With dead ends: 30626 [2019-09-10 06:18:45,053 INFO L226 Difference]: Without dead ends: 30626 [2019-09-10 06:18:45,054 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:45,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30626 states. [2019-09-10 06:18:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30626 to 30588. [2019-09-10 06:18:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30588 states. [2019-09-10 06:18:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30588 states to 30588 states and 36745 transitions. [2019-09-10 06:18:45,300 INFO L78 Accepts]: Start accepts. Automaton has 30588 states and 36745 transitions. Word has length 186 [2019-09-10 06:18:45,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:45,301 INFO L475 AbstractCegarLoop]: Abstraction has 30588 states and 36745 transitions. [2019-09-10 06:18:45,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:18:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 30588 states and 36745 transitions. [2019-09-10 06:18:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:45,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:45,311 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:45,312 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:45,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:45,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1626227080, now seen corresponding path program 1 times [2019-09-10 06:18:45,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:45,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:45,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:45,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:45,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:45,417 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:45,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:45,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:18:45,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:45,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:18:45,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:18:45,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:18:45,419 INFO L87 Difference]: Start difference. First operand 30588 states and 36745 transitions. Second operand 6 states. [2019-09-10 06:18:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:45,553 INFO L93 Difference]: Finished difference Result 37140 states and 45800 transitions. [2019-09-10 06:18:45,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:18:45,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-09-10 06:18:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:45,588 INFO L225 Difference]: With dead ends: 37140 [2019-09-10 06:18:45,588 INFO L226 Difference]: Without dead ends: 37140 [2019-09-10 06:18:45,588 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:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37140 states. [2019-09-10 06:18:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37140 to 30624. [2019-09-10 06:18:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30624 states. [2019-09-10 06:18:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30624 states to 30624 states and 36781 transitions. [2019-09-10 06:18:45,872 INFO L78 Accepts]: Start accepts. Automaton has 30624 states and 36781 transitions. Word has length 186 [2019-09-10 06:18:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:45,873 INFO L475 AbstractCegarLoop]: Abstraction has 30624 states and 36781 transitions. [2019-09-10 06:18:45,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:18:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 30624 states and 36781 transitions. [2019-09-10 06:18:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:45,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:45,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:45,884 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:45,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:45,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1070998046, now seen corresponding path program 1 times [2019-09-10 06:18:45,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:45,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:45,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:45,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:45,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:45,979 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:45,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:45,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:18:45,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:45,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:18:45,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:18:45,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:18:45,981 INFO L87 Difference]: Start difference. First operand 30624 states and 36781 transitions. Second operand 6 states. [2019-09-10 06:18:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:46,244 INFO L93 Difference]: Finished difference Result 39760 states and 49407 transitions. [2019-09-10 06:18:46,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:18:46,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-09-10 06:18:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:46,279 INFO L225 Difference]: With dead ends: 39760 [2019-09-10 06:18:46,279 INFO L226 Difference]: Without dead ends: 39760 [2019-09-10 06:18:46,279 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:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39760 states. [2019-09-10 06:18:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39760 to 30681. [2019-09-10 06:18:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30681 states. [2019-09-10 06:18:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30681 states to 30681 states and 36838 transitions. [2019-09-10 06:18:46,578 INFO L78 Accepts]: Start accepts. Automaton has 30681 states and 36838 transitions. Word has length 186 [2019-09-10 06:18:46,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:46,578 INFO L475 AbstractCegarLoop]: Abstraction has 30681 states and 36838 transitions. [2019-09-10 06:18:46,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:18:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 30681 states and 36838 transitions. [2019-09-10 06:18:46,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:46,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:46,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:46,589 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:46,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:46,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1072845088, now seen corresponding path program 1 times [2019-09-10 06:18:46,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:46,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:46,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:46,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:46,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:46,714 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,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:46,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:18:46,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:46,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:18:46,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:18:46,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:46,715 INFO L87 Difference]: Start difference. First operand 30681 states and 36838 transitions. Second operand 5 states. [2019-09-10 06:18:46,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:46,908 INFO L93 Difference]: Finished difference Result 33042 states and 39997 transitions. [2019-09-10 06:18:46,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:18:46,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-09-10 06:18:46,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:46,938 INFO L225 Difference]: With dead ends: 33042 [2019-09-10 06:18:46,938 INFO L226 Difference]: Without dead ends: 33042 [2019-09-10 06:18:46,938 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:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33042 states. [2019-09-10 06:18:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33042 to 33020. [2019-09-10 06:18:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33020 states. [2019-09-10 06:18:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33020 states to 33020 states and 39976 transitions. [2019-09-10 06:18:47,210 INFO L78 Accepts]: Start accepts. Automaton has 33020 states and 39976 transitions. Word has length 186 [2019-09-10 06:18:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:47,210 INFO L475 AbstractCegarLoop]: Abstraction has 33020 states and 39976 transitions. [2019-09-10 06:18:47,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:18:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 33020 states and 39976 transitions. [2019-09-10 06:18:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:18:47,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:47,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:47,221 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1896762548, now seen corresponding path program 1 times [2019-09-10 06:18:47,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:47,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:47,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:47,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:47,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:47,908 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:47,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:47,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:18:47,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:47,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:18:47,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:18:47,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:18:47,909 INFO L87 Difference]: Start difference. First operand 33020 states and 39976 transitions. Second operand 22 states. [2019-09-10 06:18:48,080 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 06:18:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:54,185 INFO L93 Difference]: Finished difference Result 65492 states and 82837 transitions. [2019-09-10 06:18:54,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 06:18:54,185 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 188 [2019-09-10 06:18:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:54,252 INFO L225 Difference]: With dead ends: 65492 [2019-09-10 06:18:54,252 INFO L226 Difference]: Without dead ends: 65492 [2019-09-10 06:18:54,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1020, Invalid=3140, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 06:18:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65492 states. [2019-09-10 06:18:54,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65492 to 39136. [2019-09-10 06:18:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39136 states. [2019-09-10 06:18:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39136 states to 39136 states and 48062 transitions. [2019-09-10 06:18:54,691 INFO L78 Accepts]: Start accepts. Automaton has 39136 states and 48062 transitions. Word has length 188 [2019-09-10 06:18:54,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:54,692 INFO L475 AbstractCegarLoop]: Abstraction has 39136 states and 48062 transitions. [2019-09-10 06:18:54,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:18:54,692 INFO L276 IsEmpty]: Start isEmpty. Operand 39136 states and 48062 transitions. [2019-09-10 06:18:54,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:18:54,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:54,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:54,703 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:54,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1048224410, now seen corresponding path program 1 times [2019-09-10 06:18:54,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:54,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:54,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:55,017 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:55,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:55,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:18:55,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:55,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:18:55,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:18:55,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:18:55,019 INFO L87 Difference]: Start difference. First operand 39136 states and 48062 transitions. Second operand 15 states. [2019-09-10 06:18:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:57,247 INFO L93 Difference]: Finished difference Result 52557 states and 66132 transitions. [2019-09-10 06:18:57,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:18:57,247 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 188 [2019-09-10 06:18:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:57,312 INFO L225 Difference]: With dead ends: 52557 [2019-09-10 06:18:57,313 INFO L226 Difference]: Without dead ends: 52557 [2019-09-10 06:18:57,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:18:57,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52557 states. [2019-09-10 06:18:57,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52557 to 38466. [2019-09-10 06:18:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38466 states. [2019-09-10 06:18:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38466 states to 38466 states and 47333 transitions. [2019-09-10 06:18:57,718 INFO L78 Accepts]: Start accepts. Automaton has 38466 states and 47333 transitions. Word has length 188 [2019-09-10 06:18:57,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:57,718 INFO L475 AbstractCegarLoop]: Abstraction has 38466 states and 47333 transitions. [2019-09-10 06:18:57,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:18:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 38466 states and 47333 transitions. [2019-09-10 06:18:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:18:57,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:57,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:57,729 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:57,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash 190172036, now seen corresponding path program 1 times [2019-09-10 06:18:57,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:57,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:57,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:57,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:57,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:58,226 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:58,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:58,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:18:58,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:58,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:18:58,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:18:58,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:18:58,228 INFO L87 Difference]: Start difference. First operand 38466 states and 47333 transitions. Second operand 18 states. [2019-09-10 06:19:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:01,815 INFO L93 Difference]: Finished difference Result 64187 states and 81807 transitions. [2019-09-10 06:19:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:19:01,815 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 188 [2019-09-10 06:19:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:01,877 INFO L225 Difference]: With dead ends: 64187 [2019-09-10 06:19:01,877 INFO L226 Difference]: Without dead ends: 64039 [2019-09-10 06:19:01,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=535, Invalid=1445, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 06:19:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64039 states. [2019-09-10 06:19:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64039 to 39111. [2019-09-10 06:19:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39111 states. [2019-09-10 06:19:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39111 states to 39111 states and 48208 transitions. [2019-09-10 06:19:02,267 INFO L78 Accepts]: Start accepts. Automaton has 39111 states and 48208 transitions. Word has length 188 [2019-09-10 06:19:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:02,268 INFO L475 AbstractCegarLoop]: Abstraction has 39111 states and 48208 transitions. [2019-09-10 06:19:02,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:19:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 39111 states and 48208 transitions. [2019-09-10 06:19:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:19:02,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:02,277 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:02,277 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:02,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:02,277 INFO L82 PathProgramCache]: Analyzing trace with hash -658366102, now seen corresponding path program 1 times [2019-09-10 06:19:02,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:02,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:02,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:02,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:02,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:19:02,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:02,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:19:02,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:19:02,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:19:02,696 INFO L87 Difference]: Start difference. First operand 39111 states and 48208 transitions. Second operand 18 states. [2019-09-10 06:19:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:07,337 INFO L93 Difference]: Finished difference Result 65346 states and 83258 transitions. [2019-09-10 06:19:07,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 06:19:07,338 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 188 [2019-09-10 06:19:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:07,395 INFO L225 Difference]: With dead ends: 65346 [2019-09-10 06:19:07,395 INFO L226 Difference]: Without dead ends: 64304 [2019-09-10 06:19:07,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=452, Invalid=2098, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 06:19:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64304 states. [2019-09-10 06:19:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64304 to 37805. [2019-09-10 06:19:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37805 states. [2019-09-10 06:19:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37805 states to 37805 states and 46858 transitions. [2019-09-10 06:19:07,772 INFO L78 Accepts]: Start accepts. Automaton has 37805 states and 46858 transitions. Word has length 188 [2019-09-10 06:19:07,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:07,773 INFO L475 AbstractCegarLoop]: Abstraction has 37805 states and 46858 transitions. [2019-09-10 06:19:07,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:19:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 37805 states and 46858 transitions. [2019-09-10 06:19:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:19:07,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:07,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:07,783 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:07,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:07,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2005572556, now seen corresponding path program 1 times [2019-09-10 06:19:07,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:07,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:07,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:07,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:07,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:08,080 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:08,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:08,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:19:08,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:08,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:19:08,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:19:08,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:19:08,082 INFO L87 Difference]: Start difference. First operand 37805 states and 46858 transitions. Second operand 15 states. [2019-09-10 06:19:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:12,228 INFO L93 Difference]: Finished difference Result 66551 states and 85565 transitions. [2019-09-10 06:19:12,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 06:19:12,229 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 188 [2019-09-10 06:19:12,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:12,297 INFO L225 Difference]: With dead ends: 66551 [2019-09-10 06:19:12,297 INFO L226 Difference]: Without dead ends: 66335 [2019-09-10 06:19:12,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=793, Invalid=2747, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:19:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66335 states. [2019-09-10 06:19:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66335 to 37149. [2019-09-10 06:19:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37149 states. [2019-09-10 06:19:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37149 states to 37149 states and 46162 transitions. [2019-09-10 06:19:12,710 INFO L78 Accepts]: Start accepts. Automaton has 37149 states and 46162 transitions. Word has length 188 [2019-09-10 06:19:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:12,710 INFO L475 AbstractCegarLoop]: Abstraction has 37149 states and 46162 transitions. [2019-09-10 06:19:12,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:19:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 37149 states and 46162 transitions. [2019-09-10 06:19:12,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:19:12,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:12,719 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:12,719 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:12,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:12,720 INFO L82 PathProgramCache]: Analyzing trace with hash -861984993, now seen corresponding path program 1 times [2019-09-10 06:19:12,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:12,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:12,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:12,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:12,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:13,095 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:13,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:13,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:19:13,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:13,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:19:13,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:19:13,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:19:13,097 INFO L87 Difference]: Start difference. First operand 37149 states and 46162 transitions. Second operand 15 states. [2019-09-10 06:19:15,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:15,718 INFO L93 Difference]: Finished difference Result 49263 states and 62320 transitions. [2019-09-10 06:19:15,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:19:15,718 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 188 [2019-09-10 06:19:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:15,764 INFO L225 Difference]: With dead ends: 49263 [2019-09-10 06:19:15,764 INFO L226 Difference]: Without dead ends: 49263 [2019-09-10 06:19:15,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=356, Invalid=976, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:19:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49263 states. [2019-09-10 06:19:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49263 to 37065. [2019-09-10 06:19:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37065 states. [2019-09-10 06:19:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37065 states to 37065 states and 46058 transitions. [2019-09-10 06:19:16,112 INFO L78 Accepts]: Start accepts. Automaton has 37065 states and 46058 transitions. Word has length 188 [2019-09-10 06:19:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:16,112 INFO L475 AbstractCegarLoop]: Abstraction has 37065 states and 46058 transitions. [2019-09-10 06:19:16,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:19:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 37065 states and 46058 transitions. [2019-09-10 06:19:16,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:19:16,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:16,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:16,122 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:16,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:16,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1373279846, now seen corresponding path program 1 times [2019-09-10 06:19:16,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:16,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:16,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:16,545 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:16,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:16,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:19:16,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:16,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:19:16,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:19:16,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:19:16,547 INFO L87 Difference]: Start difference. First operand 37065 states and 46058 transitions. Second operand 14 states. [2019-09-10 06:19:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:17,909 INFO L93 Difference]: Finished difference Result 36076 states and 45000 transitions. [2019-09-10 06:19:17,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:19:17,910 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 188 [2019-09-10 06:19:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:17,951 INFO L225 Difference]: With dead ends: 36076 [2019-09-10 06:19:17,951 INFO L226 Difference]: Without dead ends: 36076 [2019-09-10 06:19:17,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:19:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36076 states. [2019-09-10 06:19:18,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36076 to 35864. [2019-09-10 06:19:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35864 states. [2019-09-10 06:19:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35864 states to 35864 states and 44789 transitions. [2019-09-10 06:19:18,259 INFO L78 Accepts]: Start accepts. Automaton has 35864 states and 44789 transitions. Word has length 188 [2019-09-10 06:19:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:18,259 INFO L475 AbstractCegarLoop]: Abstraction has 35864 states and 44789 transitions. [2019-09-10 06:19:18,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:19:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 35864 states and 44789 transitions. [2019-09-10 06:19:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:19:18,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:18,268 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:18,268 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:18,269 INFO L82 PathProgramCache]: Analyzing trace with hash 438438238, now seen corresponding path program 1 times [2019-09-10 06:19:18,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:18,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:18,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:18,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:18,506 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,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:18,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:19:18,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:18,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:19:18,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:19:18,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:19:18,507 INFO L87 Difference]: Start difference. First operand 35864 states and 44789 transitions. Second operand 15 states. [2019-09-10 06:19:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:20,648 INFO L93 Difference]: Finished difference Result 44123 states and 55856 transitions. [2019-09-10 06:19:20,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:19:20,649 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 188 [2019-09-10 06:19:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:20,688 INFO L225 Difference]: With dead ends: 44123 [2019-09-10 06:19:20,689 INFO L226 Difference]: Without dead ends: 43802 [2019-09-10 06:19:20,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:19:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43802 states. [2019-09-10 06:19:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43802 to 35122. [2019-09-10 06:19:20,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35122 states. [2019-09-10 06:19:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35122 states to 35122 states and 44012 transitions. [2019-09-10 06:19:20,990 INFO L78 Accepts]: Start accepts. Automaton has 35122 states and 44012 transitions. Word has length 188 [2019-09-10 06:19:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:20,990 INFO L475 AbstractCegarLoop]: Abstraction has 35122 states and 44012 transitions. [2019-09-10 06:19:20,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:19:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 35122 states and 44012 transitions. [2019-09-10 06:19:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:19:20,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:20,997 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:20,998 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:20,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:20,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1188760306, now seen corresponding path program 1 times [2019-09-10 06:19:20,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:20,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:20,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:20,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:20,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:21,334 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:21,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:21,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:19:21,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:21,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:19:21,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:19:21,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:19:21,335 INFO L87 Difference]: Start difference. First operand 35122 states and 44012 transitions. Second operand 17 states. [2019-09-10 06:19:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:24,076 INFO L93 Difference]: Finished difference Result 39557 states and 49480 transitions. [2019-09-10 06:19:24,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:19:24,077 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 188 [2019-09-10 06:19:24,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:24,112 INFO L225 Difference]: With dead ends: 39557 [2019-09-10 06:19:24,113 INFO L226 Difference]: Without dead ends: 39107 [2019-09-10 06:19:24,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=449, Invalid=1531, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 06:19:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39107 states. [2019-09-10 06:19:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39107 to 36429. [2019-09-10 06:19:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36429 states. [2019-09-10 06:19:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36429 states to 36429 states and 45897 transitions. [2019-09-10 06:19:24,419 INFO L78 Accepts]: Start accepts. Automaton has 36429 states and 45897 transitions. Word has length 188 [2019-09-10 06:19:24,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:24,419 INFO L475 AbstractCegarLoop]: Abstraction has 36429 states and 45897 transitions. [2019-09-10 06:19:24,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:19:24,419 INFO L276 IsEmpty]: Start isEmpty. Operand 36429 states and 45897 transitions. [2019-09-10 06:19:24,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:19:24,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:24,427 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:24,427 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:24,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:24,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2057869475, now seen corresponding path program 1 times [2019-09-10 06:19:24,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:24,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:24,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:24,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:24,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:24,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:19:24,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:24,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:19:24,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:24,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:19:24,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:19:24,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:19:24,680 INFO L87 Difference]: Start difference. First operand 36429 states and 45897 transitions. Second operand 15 states. [2019-09-10 06:19:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:27,018 INFO L93 Difference]: Finished difference Result 46622 states and 59611 transitions. [2019-09-10 06:19:27,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:19:27,018 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 188 [2019-09-10 06:19:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:27,061 INFO L225 Difference]: With dead ends: 46622 [2019-09-10 06:19:27,062 INFO L226 Difference]: Without dead ends: 46622 [2019-09-10 06:19:27,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=335, Invalid=925, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:19:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46622 states. [2019-09-10 06:19:27,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46622 to 36227. [2019-09-10 06:19:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36227 states. [2019-09-10 06:19:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36227 states to 36227 states and 45669 transitions. [2019-09-10 06:19:27,404 INFO L78 Accepts]: Start accepts. Automaton has 36227 states and 45669 transitions. Word has length 188 [2019-09-10 06:19:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:27,404 INFO L475 AbstractCegarLoop]: Abstraction has 36227 states and 45669 transitions. [2019-09-10 06:19:27,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:19:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 36227 states and 45669 transitions. [2019-09-10 06:19:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:19:27,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:27,412 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:27,412 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:27,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:27,412 INFO L82 PathProgramCache]: Analyzing trace with hash -590722983, now seen corresponding path program 1 times [2019-09-10 06:19:27,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:27,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:27,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:27,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:27,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:28,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:19:28,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:28,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:19:28,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:28,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:19:28,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:19:28,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:19:28,258 INFO L87 Difference]: Start difference. First operand 36227 states and 45669 transitions. Second operand 25 states. [2019-09-10 06:19:30,716 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 06:19:31,023 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 06:19:31,167 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:19:31,380 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 06:19:31,545 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 06:19:31,684 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 06:19:32,079 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 06:19:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:35,061 INFO L93 Difference]: Finished difference Result 39788 states and 50280 transitions. [2019-09-10 06:19:35,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 06:19:35,062 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 188 [2019-09-10 06:19:35,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:35,097 INFO L225 Difference]: With dead ends: 39788 [2019-09-10 06:19:35,097 INFO L226 Difference]: Without dead ends: 39788 [2019-09-10 06:19:35,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=855, Invalid=2805, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 06:19:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39788 states. [2019-09-10 06:19:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39788 to 36364. [2019-09-10 06:19:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36364 states. [2019-09-10 06:19:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36364 states to 36364 states and 45805 transitions. [2019-09-10 06:19:35,373 INFO L78 Accepts]: Start accepts. Automaton has 36364 states and 45805 transitions. Word has length 188 [2019-09-10 06:19:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:35,373 INFO L475 AbstractCegarLoop]: Abstraction has 36364 states and 45805 transitions. [2019-09-10 06:19:35,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:19:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 36364 states and 45805 transitions. [2019-09-10 06:19:35,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:19:35,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:35,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:35,381 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:35,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:35,381 INFO L82 PathProgramCache]: Analyzing trace with hash 64490711, now seen corresponding path program 1 times [2019-09-10 06:19:35,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:35,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:35,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:35,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:35,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:35,674 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:35,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:35,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:19:35,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:35,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:19:35,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:19:35,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:19:35,675 INFO L87 Difference]: Start difference. First operand 36364 states and 45805 transitions. Second operand 15 states. [2019-09-10 06:19:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:40,297 INFO L93 Difference]: Finished difference Result 73735 states and 96448 transitions. [2019-09-10 06:19:40,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 06:19:40,298 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 188 [2019-09-10 06:19:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:40,379 INFO L225 Difference]: With dead ends: 73735 [2019-09-10 06:19:40,380 INFO L226 Difference]: Without dead ends: 73446 [2019-09-10 06:19:40,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=869, Invalid=3163, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 06:19:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73446 states. [2019-09-10 06:19:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73446 to 35822. [2019-09-10 06:19:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35822 states. [2019-09-10 06:19:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35822 states to 35822 states and 45215 transitions. [2019-09-10 06:19:40,837 INFO L78 Accepts]: Start accepts. Automaton has 35822 states and 45215 transitions. Word has length 188 [2019-09-10 06:19:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:40,837 INFO L475 AbstractCegarLoop]: Abstraction has 35822 states and 45215 transitions. [2019-09-10 06:19:40,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:19:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 35822 states and 45215 transitions. [2019-09-10 06:19:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:19:40,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:40,845 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:40,845 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:40,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:40,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2006510581, now seen corresponding path program 1 times [2019-09-10 06:19:40,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:40,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:40,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:41,186 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:41,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:41,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:19:41,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:41,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:19:41,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:19:41,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:19:41,188 INFO L87 Difference]: Start difference. First operand 35822 states and 45215 transitions. Second operand 14 states. [2019-09-10 06:19:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:43,106 INFO L93 Difference]: Finished difference Result 45776 states and 58918 transitions. [2019-09-10 06:19:43,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 06:19:43,106 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 188 [2019-09-10 06:19:43,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:43,148 INFO L225 Difference]: With dead ends: 45776 [2019-09-10 06:19:43,149 INFO L226 Difference]: Without dead ends: 45724 [2019-09-10 06:19:43,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:19:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45724 states. [2019-09-10 06:19:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45724 to 31058. [2019-09-10 06:19:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31058 states. [2019-09-10 06:19:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31058 states to 31058 states and 39102 transitions. [2019-09-10 06:19:43,434 INFO L78 Accepts]: Start accepts. Automaton has 31058 states and 39102 transitions. Word has length 188 [2019-09-10 06:19:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:43,434 INFO L475 AbstractCegarLoop]: Abstraction has 31058 states and 39102 transitions. [2019-09-10 06:19:43,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:19:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 31058 states and 39102 transitions. [2019-09-10 06:19:43,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:19:43,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:43,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] [2019-09-10 06:19:43,440 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:43,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:43,441 INFO L82 PathProgramCache]: Analyzing trace with hash 89095096, now seen corresponding path program 1 times [2019-09-10 06:19:43,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:43,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:43,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:43,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:43,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:43,731 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:43,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:43,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:19:43,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:43,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:19:43,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:19:43,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:19:43,732 INFO L87 Difference]: Start difference. First operand 31058 states and 39102 transitions. Second operand 15 states. [2019-09-10 06:19:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:46,222 INFO L93 Difference]: Finished difference Result 41958 states and 53912 transitions. [2019-09-10 06:19:46,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:19:46,222 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 188 [2019-09-10 06:19:46,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:46,263 INFO L225 Difference]: With dead ends: 41958 [2019-09-10 06:19:46,263 INFO L226 Difference]: Without dead ends: 41958 [2019-09-10 06:19:46,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=356, Invalid=976, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:19:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41958 states. [2019-09-10 06:19:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41958 to 30536. [2019-09-10 06:19:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30536 states. [2019-09-10 06:19:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30536 states to 30536 states and 38566 transitions. [2019-09-10 06:19:46,542 INFO L78 Accepts]: Start accepts. Automaton has 30536 states and 38566 transitions. Word has length 188 [2019-09-10 06:19:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:46,542 INFO L475 AbstractCegarLoop]: Abstraction has 30536 states and 38566 transitions. [2019-09-10 06:19:46,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:19:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 30536 states and 38566 transitions. [2019-09-10 06:19:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 06:19:46,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:46,550 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] [2019-09-10 06:19:46,550 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:46,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:46,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1659946591, now seen corresponding path program 1 times [2019-09-10 06:19:46,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:46,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:46,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:46,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:46,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:46,606 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,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:46,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:46,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:46,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:46,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:46,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:46,607 INFO L87 Difference]: Start difference. First operand 30536 states and 38566 transitions. Second operand 3 states. [2019-09-10 06:19:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:46,764 INFO L93 Difference]: Finished difference Result 48747 states and 62252 transitions. [2019-09-10 06:19:46,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:46,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-10 06:19:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:46,823 INFO L225 Difference]: With dead ends: 48747 [2019-09-10 06:19:46,824 INFO L226 Difference]: Without dead ends: 48747 [2019-09-10 06:19:46,824 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:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48747 states. [2019-09-10 06:19:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48747 to 48611. [2019-09-10 06:19:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48611 states. [2019-09-10 06:19:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48611 states to 48611 states and 62117 transitions. [2019-09-10 06:19:47,224 INFO L78 Accepts]: Start accepts. Automaton has 48611 states and 62117 transitions. Word has length 200 [2019-09-10 06:19:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:47,224 INFO L475 AbstractCegarLoop]: Abstraction has 48611 states and 62117 transitions. [2019-09-10 06:19:47,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 48611 states and 62117 transitions. [2019-09-10 06:19:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 06:19:47,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:47,233 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] [2019-09-10 06:19:47,233 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:47,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:47,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1658503615, now seen corresponding path program 1 times [2019-09-10 06:19:47,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:47,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:47,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:47,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:47,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:47,502 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:47,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:47,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:47,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:47,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:47,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:47,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:47,504 INFO L87 Difference]: Start difference. First operand 48611 states and 62117 transitions. Second operand 3 states. [2019-09-10 06:19:47,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:47,721 INFO L93 Difference]: Finished difference Result 80749 states and 104190 transitions. [2019-09-10 06:19:47,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:47,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-09-10 06:19:47,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:47,818 INFO L225 Difference]: With dead ends: 80749 [2019-09-10 06:19:47,818 INFO L226 Difference]: Without dead ends: 80749 [2019-09-10 06:19:47,819 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:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80749 states. [2019-09-10 06:19:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80749 to 80453. [2019-09-10 06:19:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80453 states. [2019-09-10 06:19:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80453 states to 80453 states and 103895 transitions. [2019-09-10 06:19:48,502 INFO L78 Accepts]: Start accepts. Automaton has 80453 states and 103895 transitions. Word has length 201 [2019-09-10 06:19:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:48,502 INFO L475 AbstractCegarLoop]: Abstraction has 80453 states and 103895 transitions. [2019-09-10 06:19:48,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 80453 states and 103895 transitions. [2019-09-10 06:19:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 06:19:48,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:48,512 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] [2019-09-10 06:19:48,512 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:48,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1472472646, now seen corresponding path program 1 times [2019-09-10 06:19:48,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:48,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:48,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:48,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:48,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:48,569 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:48,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:48,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:48,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:48,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:48,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:48,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:48,571 INFO L87 Difference]: Start difference. First operand 80453 states and 103895 transitions. Second operand 3 states. [2019-09-10 06:19:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:48,893 INFO L93 Difference]: Finished difference Result 131807 states and 171080 transitions. [2019-09-10 06:19:48,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:48,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-09-10 06:19:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:49,054 INFO L225 Difference]: With dead ends: 131807 [2019-09-10 06:19:49,054 INFO L226 Difference]: Without dead ends: 131807 [2019-09-10 06:19:49,055 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:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131807 states. [2019-09-10 06:19:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131807 to 130917. [2019-09-10 06:19:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130917 states. [2019-09-10 06:19:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130917 states to 130917 states and 170191 transitions. [2019-09-10 06:19:50,152 INFO L78 Accepts]: Start accepts. Automaton has 130917 states and 170191 transitions. Word has length 202 [2019-09-10 06:19:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:50,152 INFO L475 AbstractCegarLoop]: Abstraction has 130917 states and 170191 transitions. [2019-09-10 06:19:50,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 130917 states and 170191 transitions. [2019-09-10 06:19:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 06:19:50,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:50,164 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:50,164 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:50,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:50,164 INFO L82 PathProgramCache]: Analyzing trace with hash 140818810, now seen corresponding path program 1 times [2019-09-10 06:19:50,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:50,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:50,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:50,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:50,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:50,235 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:50,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:50,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:50,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:50,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:50,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:50,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:50,237 INFO L87 Difference]: Start difference. First operand 130917 states and 170191 transitions. Second operand 3 states. [2019-09-10 06:19:50,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:50,880 INFO L93 Difference]: Finished difference Result 234515 states and 306296 transitions. [2019-09-10 06:19:50,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:50,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-09-10 06:19:50,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:51,265 INFO L225 Difference]: With dead ends: 234515 [2019-09-10 06:19:51,265 INFO L226 Difference]: Without dead ends: 234515 [2019-09-10 06:19:51,265 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:51,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234515 states. [2019-09-10 06:19:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234515 to 232749. [2019-09-10 06:19:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232749 states. [2019-09-10 06:19:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232749 states to 232749 states and 304531 transitions. [2019-09-10 06:19:55,880 INFO L78 Accepts]: Start accepts. Automaton has 232749 states and 304531 transitions. Word has length 203 [2019-09-10 06:19:55,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:55,880 INFO L475 AbstractCegarLoop]: Abstraction has 232749 states and 304531 transitions. [2019-09-10 06:19:55,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 232749 states and 304531 transitions. [2019-09-10 06:19:55,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-10 06:19:55,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:55,893 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] [2019-09-10 06:19:55,893 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:55,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:55,893 INFO L82 PathProgramCache]: Analyzing trace with hash -901326802, now seen corresponding path program 1 times [2019-09-10 06:19:55,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:55,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:55,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:55,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:55,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:55,950 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,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:55,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:55,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:55,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:55,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:55,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:55,951 INFO L87 Difference]: Start difference. First operand 232749 states and 304531 transitions. Second operand 3 states. [2019-09-10 06:19:56,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:56,701 INFO L93 Difference]: Finished difference Result 321905 states and 421230 transitions. [2019-09-10 06:19:56,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:56,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-09-10 06:19:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:57,219 INFO L225 Difference]: With dead ends: 321905 [2019-09-10 06:19:57,219 INFO L226 Difference]: Without dead ends: 321905 [2019-09-10 06:19:57,219 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:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321905 states. [2019-09-10 06:20:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321905 to 321375. [2019-09-10 06:20:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321375 states. [2019-09-10 06:20:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321375 states to 321375 states and 420701 transitions. [2019-09-10 06:20:05,221 INFO L78 Accepts]: Start accepts. Automaton has 321375 states and 420701 transitions. Word has length 206 [2019-09-10 06:20:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:05,222 INFO L475 AbstractCegarLoop]: Abstraction has 321375 states and 420701 transitions. [2019-09-10 06:20:05,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 321375 states and 420701 transitions. [2019-09-10 06:20:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-10 06:20:05,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:05,234 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] [2019-09-10 06:20:05,234 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:05,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:05,234 INFO L82 PathProgramCache]: Analyzing trace with hash -861849513, now seen corresponding path program 1 times [2019-09-10 06:20:05,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:05,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:05,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:05,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:05,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:05,339 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:05,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:05,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:20:05,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:05,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:20:05,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:20:05,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:05,340 INFO L87 Difference]: Start difference. First operand 321375 states and 420701 transitions. Second operand 4 states. [2019-09-10 06:20:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:07,371 INFO L93 Difference]: Finished difference Result 813219 states and 1065691 transitions. [2019-09-10 06:20:07,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:20:07,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-09-10 06:20:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:08,744 INFO L225 Difference]: With dead ends: 813219 [2019-09-10 06:20:08,744 INFO L226 Difference]: Without dead ends: 813219 [2019-09-10 06:20:08,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:09,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813219 states. [2019-09-10 06:20:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813219 to 799863. [2019-09-10 06:20:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799863 states. [2019-09-10 06:20:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799863 states to 799863 states and 1045661 transitions. [2019-09-10 06:20:34,336 INFO L78 Accepts]: Start accepts. Automaton has 799863 states and 1045661 transitions. Word has length 206 [2019-09-10 06:20:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:34,337 INFO L475 AbstractCegarLoop]: Abstraction has 799863 states and 1045661 transitions. [2019-09-10 06:20:34,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:20:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 799863 states and 1045661 transitions. [2019-09-10 06:20:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-10 06:20:34,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:34,351 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] [2019-09-10 06:20:34,351 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:34,351 INFO L82 PathProgramCache]: Analyzing trace with hash 809334158, now seen corresponding path program 1 times [2019-09-10 06:20:34,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:34,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:34,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:34,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:34,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:34,441 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:34,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:34,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:20:34,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:34,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:20:34,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:20:34,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:34,443 INFO L87 Difference]: Start difference. First operand 799863 states and 1045661 transitions. Second operand 4 states. [2019-09-10 06:20:52,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:52,172 INFO L93 Difference]: Finished difference Result 1919687 states and 2498703 transitions. [2019-09-10 06:20:52,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:20:52,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-09-10 06:20:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:55,155 INFO L225 Difference]: With dead ends: 1919687 [2019-09-10 06:20:55,156 INFO L226 Difference]: Without dead ends: 1919687 [2019-09-10 06:20:55,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919687 states. [2019-09-10 06:21:59,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919687 to 1882027. [2019-09-10 06:21:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882027 states.