java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:11:27,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:11:27,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:11:27,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:11:27,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:11:27,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:11:27,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:11:27,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:11:27,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:11:27,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:11:27,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:11:27,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:11:27,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:11:27,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:11:27,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:11:27,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:11:27,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:11:27,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:11:27,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:11:27,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:11:27,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:11:27,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:11:27,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:11:27,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:11:27,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:11:27,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:11:27,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:11:27,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:11:27,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:11:27,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:11:27,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:11:27,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:11:27,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:11:27,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:11:27,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:11:27,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:11:27,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:11:27,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:11:27,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:11:27,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:11:27,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:11:27,701 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 07:11:27,717 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:11:27,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:11:27,718 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:11:27,718 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:11:27,719 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:11:27,719 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:11:27,719 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:11:27,720 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:11:27,720 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:11:27,720 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:11:27,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:11:27,721 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:11:27,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:11:27,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:11:27,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:11:27,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:11:27,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:11:27,722 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:11:27,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:11:27,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:11:27,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:11:27,723 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:11:27,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:11:27,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:11:27,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:11:27,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:11:27,724 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:11:27,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:11:27,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:11:27,724 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:11:27,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:11:27,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:11:27,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:11:27,775 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:11:27,775 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:11:27,776 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 07:11:27,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf34d7b2/eb7b0bef23d2440eabb1d5809dee71c9/FLAGf0e9f4932 [2019-09-10 07:11:28,440 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:11:28,441 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 07:11:28,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf34d7b2/eb7b0bef23d2440eabb1d5809dee71c9/FLAGf0e9f4932 [2019-09-10 07:11:28,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf34d7b2/eb7b0bef23d2440eabb1d5809dee71c9 [2019-09-10 07:11:28,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:11:28,667 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:11:28,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:11:28,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:11:28,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:11:28,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:11:28" (1/1) ... [2019-09-10 07:11:28,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6d8772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:28, skipping insertion in model container [2019-09-10 07:11:28,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:11:28" (1/1) ... [2019-09-10 07:11:28,685 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:11:28,752 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:11:29,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:11:29,205 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:11:29,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:11:29,362 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:11:29,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:29 WrapperNode [2019-09-10 07:11:29,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:11:29,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:11:29,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:11:29,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:11:29,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:29" (1/1) ... [2019-09-10 07:11:29,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:29" (1/1) ... [2019-09-10 07:11:29,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:29" (1/1) ... [2019-09-10 07:11:29,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:29" (1/1) ... [2019-09-10 07:11:29,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:29" (1/1) ... [2019-09-10 07:11:29,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:29" (1/1) ... [2019-09-10 07:11:29,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:29" (1/1) ... [2019-09-10 07:11:29,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:11:29,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:11:29,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:11:29,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:11:29,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:29" (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 07:11:29,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:11:29,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:11:29,530 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:11:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:11:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:11:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:11:29,531 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:11:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:11:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:11:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:11:29,534 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:11:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:11:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:11:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:11:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:11:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:11:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:11:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:11:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:11:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:11:30,685 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:11:30,686 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:11:30,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:11:30 BoogieIcfgContainer [2019-09-10 07:11:30,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:11:30,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:11:30,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:11:30,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:11:30,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:11:28" (1/3) ... [2019-09-10 07:11:30,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6893c6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:11:30, skipping insertion in model container [2019-09-10 07:11:30,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:29" (2/3) ... [2019-09-10 07:11:30,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6893c6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:11:30, skipping insertion in model container [2019-09-10 07:11:30,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:11:30" (3/3) ... [2019-09-10 07:11:30,702 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 07:11:30,713 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:11:30,736 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:11:30,754 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:11:30,779 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:11:30,780 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:11:30,780 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:11:30,780 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:11:30,780 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:11:30,781 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:11:30,781 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:11:30,781 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:11:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states. [2019-09-10 07:11:30,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:11:30,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:30,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] [2019-09-10 07:11:30,829 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:30,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:30,835 INFO L82 PathProgramCache]: Analyzing trace with hash -653543998, now seen corresponding path program 1 times [2019-09-10 07:11:30,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:30,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:30,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:31,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:31,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:31,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:31,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:31,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:31,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:31,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:31,340 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 3 states. [2019-09-10 07:11:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:31,466 INFO L93 Difference]: Finished difference Result 327 states and 539 transitions. [2019-09-10 07:11:31,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:11:31,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 07:11:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:31,486 INFO L225 Difference]: With dead ends: 327 [2019-09-10 07:11:31,486 INFO L226 Difference]: Without dead ends: 319 [2019-09-10 07:11:31,488 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 07:11:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-10 07:11:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2019-09-10 07:11:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-09-10 07:11:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 471 transitions. [2019-09-10 07:11:31,581 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 471 transitions. Word has length 84 [2019-09-10 07:11:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:31,582 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 471 transitions. [2019-09-10 07:11:31,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:11:31,583 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 471 transitions. [2019-09-10 07:11:31,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:11:31,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:31,591 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:31,592 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:31,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:31,593 INFO L82 PathProgramCache]: Analyzing trace with hash 955400931, now seen corresponding path program 1 times [2019-09-10 07:11:31,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:31,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:31,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:31,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:31,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:31,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:31,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:11:31,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:31,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:11:31,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:11:31,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:11:31,999 INFO L87 Difference]: Start difference. First operand 317 states and 471 transitions. Second operand 7 states. [2019-09-10 07:11:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:32,361 INFO L93 Difference]: Finished difference Result 1127 states and 1720 transitions. [2019-09-10 07:11:32,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:11:32,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-09-10 07:11:32,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:32,369 INFO L225 Difference]: With dead ends: 1127 [2019-09-10 07:11:32,370 INFO L226 Difference]: Without dead ends: 1127 [2019-09-10 07:11:32,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:11:32,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2019-09-10 07:11:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1119. [2019-09-10 07:11:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-09-10 07:11:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1716 transitions. [2019-09-10 07:11:32,435 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1716 transitions. Word has length 85 [2019-09-10 07:11:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:32,436 INFO L475 AbstractCegarLoop]: Abstraction has 1119 states and 1716 transitions. [2019-09-10 07:11:32,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:11:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1716 transitions. [2019-09-10 07:11:32,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:11:32,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:32,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:32,442 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:32,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:32,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1687831789, now seen corresponding path program 1 times [2019-09-10 07:11:32,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:32,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:32,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:32,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:32,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:32,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:32,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:11:32,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:32,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:11:32,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:11:32,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:11:32,573 INFO L87 Difference]: Start difference. First operand 1119 states and 1716 transitions. Second operand 5 states. [2019-09-10 07:11:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:32,890 INFO L93 Difference]: Finished difference Result 1879 states and 2895 transitions. [2019-09-10 07:11:32,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:11:32,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:11:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:32,901 INFO L225 Difference]: With dead ends: 1879 [2019-09-10 07:11:32,902 INFO L226 Difference]: Without dead ends: 1879 [2019-09-10 07:11:32,902 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 07:11:32,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2019-09-10 07:11:32,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1877. [2019-09-10 07:11:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-09-10 07:11:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2894 transitions. [2019-09-10 07:11:32,942 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2894 transitions. Word has length 86 [2019-09-10 07:11:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:32,943 INFO L475 AbstractCegarLoop]: Abstraction has 1877 states and 2894 transitions. [2019-09-10 07:11:32,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:11:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2894 transitions. [2019-09-10 07:11:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:11:32,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:32,946 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:32,946 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:32,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:32,946 INFO L82 PathProgramCache]: Analyzing trace with hash -334266178, now seen corresponding path program 1 times [2019-09-10 07:11:32,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:32,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:32,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:32,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:32,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:33,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:33,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:11:33,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:33,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:11:33,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:11:33,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:11:33,049 INFO L87 Difference]: Start difference. First operand 1877 states and 2894 transitions. Second operand 5 states. [2019-09-10 07:11:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:33,378 INFO L93 Difference]: Finished difference Result 3379 states and 5232 transitions. [2019-09-10 07:11:33,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:11:33,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:11:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:33,395 INFO L225 Difference]: With dead ends: 3379 [2019-09-10 07:11:33,395 INFO L226 Difference]: Without dead ends: 3379 [2019-09-10 07:11:33,396 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 07:11:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2019-09-10 07:11:33,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 3377. [2019-09-10 07:11:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2019-09-10 07:11:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 5231 transitions. [2019-09-10 07:11:33,481 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 5231 transitions. Word has length 86 [2019-09-10 07:11:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:33,481 INFO L475 AbstractCegarLoop]: Abstraction has 3377 states and 5231 transitions. [2019-09-10 07:11:33,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:11:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 5231 transitions. [2019-09-10 07:11:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:11:33,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:33,484 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:33,484 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:33,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:33,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1147431652, now seen corresponding path program 1 times [2019-09-10 07:11:33,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:33,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:33,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:33,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:33,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:33,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:33,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:11:33,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:33,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:11:33,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:11:33,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:11:33,613 INFO L87 Difference]: Start difference. First operand 3377 states and 5231 transitions. Second operand 5 states. [2019-09-10 07:11:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:33,916 INFO L93 Difference]: Finished difference Result 6433 states and 9954 transitions. [2019-09-10 07:11:33,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:11:33,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:11:33,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:33,947 INFO L225 Difference]: With dead ends: 6433 [2019-09-10 07:11:33,947 INFO L226 Difference]: Without dead ends: 6433 [2019-09-10 07:11:33,947 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 07:11:33,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6433 states. [2019-09-10 07:11:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6433 to 6431. [2019-09-10 07:11:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6431 states. [2019-09-10 07:11:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6431 states to 6431 states and 9953 transitions. [2019-09-10 07:11:34,119 INFO L78 Accepts]: Start accepts. Automaton has 6431 states and 9953 transitions. Word has length 86 [2019-09-10 07:11:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:34,120 INFO L475 AbstractCegarLoop]: Abstraction has 6431 states and 9953 transitions. [2019-09-10 07:11:34,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:11:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6431 states and 9953 transitions. [2019-09-10 07:11:34,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:11:34,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:34,124 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:34,124 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:34,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:34,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1013428555, now seen corresponding path program 1 times [2019-09-10 07:11:34,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:34,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:34,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:34,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:34,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:34,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:34,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:11:34,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:34,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:11:34,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:11:34,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:11:34,323 INFO L87 Difference]: Start difference. First operand 6431 states and 9953 transitions. Second operand 6 states. [2019-09-10 07:11:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:34,721 INFO L93 Difference]: Finished difference Result 18267 states and 28184 transitions. [2019-09-10 07:11:34,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:11:34,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-10 07:11:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:34,814 INFO L225 Difference]: With dead ends: 18267 [2019-09-10 07:11:34,814 INFO L226 Difference]: Without dead ends: 18267 [2019-09-10 07:11:34,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 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 07:11:34,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18267 states. [2019-09-10 07:11:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18267 to 18263. [2019-09-10 07:11:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18263 states. [2019-09-10 07:11:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18263 states to 18263 states and 28182 transitions. [2019-09-10 07:11:35,208 INFO L78 Accepts]: Start accepts. Automaton has 18263 states and 28182 transitions. Word has length 86 [2019-09-10 07:11:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:35,210 INFO L475 AbstractCegarLoop]: Abstraction has 18263 states and 28182 transitions. [2019-09-10 07:11:35,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:11:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 18263 states and 28182 transitions. [2019-09-10 07:11:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:11:35,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:35,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:35,220 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:35,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:35,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1083255427, now seen corresponding path program 1 times [2019-09-10 07:11:35,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:35,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:35,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:35,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:35,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:35,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:35,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:11:35,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:35,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:11:35,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:11:35,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:11:35,314 INFO L87 Difference]: Start difference. First operand 18263 states and 28182 transitions. Second operand 5 states. [2019-09-10 07:11:35,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:35,666 INFO L93 Difference]: Finished difference Result 33015 states and 50762 transitions. [2019-09-10 07:11:35,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:11:35,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 07:11:35,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:35,738 INFO L225 Difference]: With dead ends: 33015 [2019-09-10 07:11:35,738 INFO L226 Difference]: Without dead ends: 33015 [2019-09-10 07:11:35,739 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 07:11:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33015 states. [2019-09-10 07:11:36,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33015 to 33013. [2019-09-10 07:11:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33013 states. [2019-09-10 07:11:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33013 states to 33013 states and 50761 transitions. [2019-09-10 07:11:36,823 INFO L78 Accepts]: Start accepts. Automaton has 33013 states and 50761 transitions. Word has length 87 [2019-09-10 07:11:36,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:36,824 INFO L475 AbstractCegarLoop]: Abstraction has 33013 states and 50761 transitions. [2019-09-10 07:11:36,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:11:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 33013 states and 50761 transitions. [2019-09-10 07:11:36,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:11:36,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:36,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:36,834 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:36,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:36,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1123215154, now seen corresponding path program 1 times [2019-09-10 07:11:36,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:36,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:36,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:36,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:36,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:11:36,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:36,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:11:36,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:11:36,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:11:36,935 INFO L87 Difference]: Start difference. First operand 33013 states and 50761 transitions. Second operand 5 states. [2019-09-10 07:11:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:37,289 INFO L93 Difference]: Finished difference Result 62605 states and 95577 transitions. [2019-09-10 07:11:37,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:11:37,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 07:11:37,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:37,377 INFO L225 Difference]: With dead ends: 62605 [2019-09-10 07:11:37,377 INFO L226 Difference]: Without dead ends: 62605 [2019-09-10 07:11:37,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:11:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62605 states. [2019-09-10 07:11:38,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62605 to 33445. [2019-09-10 07:11:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33445 states. [2019-09-10 07:11:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33445 states to 33445 states and 51193 transitions. [2019-09-10 07:11:38,150 INFO L78 Accepts]: Start accepts. Automaton has 33445 states and 51193 transitions. Word has length 87 [2019-09-10 07:11:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:38,150 INFO L475 AbstractCegarLoop]: Abstraction has 33445 states and 51193 transitions. [2019-09-10 07:11:38,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:11:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 33445 states and 51193 transitions. [2019-09-10 07:11:38,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:11:38,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:38,159 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:38,159 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:38,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:38,160 INFO L82 PathProgramCache]: Analyzing trace with hash -201497109, now seen corresponding path program 1 times [2019-09-10 07:11:38,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:38,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:38,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:38,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:38,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:38,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:38,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:11:38,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:38,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:11:38,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:11:38,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:11:38,416 INFO L87 Difference]: Start difference. First operand 33445 states and 51193 transitions. Second operand 10 states. [2019-09-10 07:11:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:41,461 INFO L93 Difference]: Finished difference Result 101818 states and 153571 transitions. [2019-09-10 07:11:41,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:11:41,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 07:11:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:41,636 INFO L225 Difference]: With dead ends: 101818 [2019-09-10 07:11:41,637 INFO L226 Difference]: Without dead ends: 101818 [2019-09-10 07:11:41,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:11:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101818 states. [2019-09-10 07:11:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101818 to 34032. [2019-09-10 07:11:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34032 states. [2019-09-10 07:11:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34032 states to 34032 states and 52058 transitions. [2019-09-10 07:11:42,583 INFO L78 Accepts]: Start accepts. Automaton has 34032 states and 52058 transitions. Word has length 88 [2019-09-10 07:11:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:42,584 INFO L475 AbstractCegarLoop]: Abstraction has 34032 states and 52058 transitions. [2019-09-10 07:11:42,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:11:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 34032 states and 52058 transitions. [2019-09-10 07:11:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:11:42,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:42,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:42,596 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1998335413, now seen corresponding path program 1 times [2019-09-10 07:11:42,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:42,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:42,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:42,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:42,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:42,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:42,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:11:42,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:42,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:11:42,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:11:42,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:11:42,692 INFO L87 Difference]: Start difference. First operand 34032 states and 52058 transitions. Second operand 4 states. [2019-09-10 07:11:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:42,846 INFO L93 Difference]: Finished difference Result 62642 states and 95051 transitions. [2019-09-10 07:11:42,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:11:42,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-10 07:11:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:42,922 INFO L225 Difference]: With dead ends: 62642 [2019-09-10 07:11:42,923 INFO L226 Difference]: Without dead ends: 62642 [2019-09-10 07:11:42,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 07:11:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62642 states. [2019-09-10 07:11:43,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62642 to 62640. [2019-09-10 07:11:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62640 states. [2019-09-10 07:11:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62640 states to 62640 states and 95050 transitions. [2019-09-10 07:11:43,844 INFO L78 Accepts]: Start accepts. Automaton has 62640 states and 95050 transitions. Word has length 88 [2019-09-10 07:11:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:43,844 INFO L475 AbstractCegarLoop]: Abstraction has 62640 states and 95050 transitions. [2019-09-10 07:11:43,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:11:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 62640 states and 95050 transitions. [2019-09-10 07:11:43,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:11:43,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:43,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:43,861 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:43,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:43,862 INFO L82 PathProgramCache]: Analyzing trace with hash -696308474, now seen corresponding path program 1 times [2019-09-10 07:11:43,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:43,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:43,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:43,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:43,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:43,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:43,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:43,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:43,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:43,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:43,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:43,947 INFO L87 Difference]: Start difference. First operand 62640 states and 95050 transitions. Second operand 3 states. [2019-09-10 07:11:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:44,403 INFO L93 Difference]: Finished difference Result 69212 states and 103203 transitions. [2019-09-10 07:11:44,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:11:44,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:11:44,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:44,548 INFO L225 Difference]: With dead ends: 69212 [2019-09-10 07:11:44,549 INFO L226 Difference]: Without dead ends: 68740 [2019-09-10 07:11:44,549 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 07:11:44,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68740 states. [2019-09-10 07:11:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68740 to 61458. [2019-09-10 07:11:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61458 states. [2019-09-10 07:11:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61458 states to 61458 states and 91958 transitions. [2019-09-10 07:11:45,194 INFO L78 Accepts]: Start accepts. Automaton has 61458 states and 91958 transitions. Word has length 89 [2019-09-10 07:11:45,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:45,194 INFO L475 AbstractCegarLoop]: Abstraction has 61458 states and 91958 transitions. [2019-09-10 07:11:45,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:11:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 61458 states and 91958 transitions. [2019-09-10 07:11:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:11:45,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:45,204 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:45,204 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:45,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:45,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1308007351, now seen corresponding path program 1 times [2019-09-10 07:11:45,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:45,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:45,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:45,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:45,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:45,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:45,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:45,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:45,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:45,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:45,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:45,270 INFO L87 Difference]: Start difference. First operand 61458 states and 91958 transitions. Second operand 3 states. [2019-09-10 07:11:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:45,486 INFO L93 Difference]: Finished difference Result 78664 states and 115701 transitions. [2019-09-10 07:11:45,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:11:45,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:11:45,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:45,581 INFO L225 Difference]: With dead ends: 78664 [2019-09-10 07:11:45,582 INFO L226 Difference]: Without dead ends: 78664 [2019-09-10 07:11:45,582 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 07:11:45,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78664 states. [2019-09-10 07:11:46,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78664 to 77950. [2019-09-10 07:11:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77950 states. [2019-09-10 07:11:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77950 states to 77950 states and 114988 transitions. [2019-09-10 07:11:46,599 INFO L78 Accepts]: Start accepts. Automaton has 77950 states and 114988 transitions. Word has length 89 [2019-09-10 07:11:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:46,599 INFO L475 AbstractCegarLoop]: Abstraction has 77950 states and 114988 transitions. [2019-09-10 07:11:46,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:11:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 77950 states and 114988 transitions. [2019-09-10 07:11:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:11:46,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:46,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] [2019-09-10 07:11:46,611 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:46,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:46,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1895914823, now seen corresponding path program 1 times [2019-09-10 07:11:46,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:46,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:46,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:46,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:46,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:46,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:46,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:46,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:46,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:46,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:46,681 INFO L87 Difference]: Start difference. First operand 77950 states and 114988 transitions. Second operand 3 states. [2019-09-10 07:11:46,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:46,946 INFO L93 Difference]: Finished difference Result 83004 states and 119832 transitions. [2019-09-10 07:11:46,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:11:46,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:11:46,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:47,473 INFO L225 Difference]: With dead ends: 83004 [2019-09-10 07:11:47,473 INFO L226 Difference]: Without dead ends: 83004 [2019-09-10 07:11:47,474 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 07:11:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83004 states. [2019-09-10 07:11:48,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83004 to 82194. [2019-09-10 07:11:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82194 states. [2019-09-10 07:11:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82194 states to 82194 states and 119023 transitions. [2019-09-10 07:11:48,177 INFO L78 Accepts]: Start accepts. Automaton has 82194 states and 119023 transitions. Word has length 89 [2019-09-10 07:11:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:48,177 INFO L475 AbstractCegarLoop]: Abstraction has 82194 states and 119023 transitions. [2019-09-10 07:11:48,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:11:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 82194 states and 119023 transitions. [2019-09-10 07:11:48,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:11:48,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:48,185 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:48,186 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:48,186 INFO L82 PathProgramCache]: Analyzing trace with hash -563721050, now seen corresponding path program 1 times [2019-09-10 07:11:48,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:48,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:48,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:48,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:48,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:48,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:11:48,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:48,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:11:48,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:11:48,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:11:48,296 INFO L87 Difference]: Start difference. First operand 82194 states and 119023 transitions. Second operand 7 states. [2019-09-10 07:11:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:50,150 INFO L93 Difference]: Finished difference Result 257764 states and 366929 transitions. [2019-09-10 07:11:50,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:11:50,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-10 07:11:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:50,573 INFO L225 Difference]: With dead ends: 257764 [2019-09-10 07:11:50,573 INFO L226 Difference]: Without dead ends: 257764 [2019-09-10 07:11:50,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:11:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257764 states. [2019-09-10 07:11:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257764 to 100722. [2019-09-10 07:11:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100722 states. [2019-09-10 07:11:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100722 states to 100722 states and 145354 transitions. [2019-09-10 07:11:54,549 INFO L78 Accepts]: Start accepts. Automaton has 100722 states and 145354 transitions. Word has length 89 [2019-09-10 07:11:54,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:54,549 INFO L475 AbstractCegarLoop]: Abstraction has 100722 states and 145354 transitions. [2019-09-10 07:11:54,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:11:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 100722 states and 145354 transitions. [2019-09-10 07:11:54,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:11:54,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:54,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:54,559 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:54,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:54,560 INFO L82 PathProgramCache]: Analyzing trace with hash -125183737, now seen corresponding path program 1 times [2019-09-10 07:11:54,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:54,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:54,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:54,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:54,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:54,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:54,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:54,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:54,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:54,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:54,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:54,630 INFO L87 Difference]: Start difference. First operand 100722 states and 145354 transitions. Second operand 3 states. [2019-09-10 07:11:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:55,090 INFO L93 Difference]: Finished difference Result 145232 states and 205776 transitions. [2019-09-10 07:11:55,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:11:55,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:11:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:55,321 INFO L225 Difference]: With dead ends: 145232 [2019-09-10 07:11:55,321 INFO L226 Difference]: Without dead ends: 145232 [2019-09-10 07:11:55,322 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 07:11:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145232 states. [2019-09-10 07:11:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145232 to 144062. [2019-09-10 07:11:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144062 states. [2019-09-10 07:11:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144062 states to 144062 states and 204607 transitions. [2019-09-10 07:11:57,361 INFO L78 Accepts]: Start accepts. Automaton has 144062 states and 204607 transitions. Word has length 89 [2019-09-10 07:11:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:57,362 INFO L475 AbstractCegarLoop]: Abstraction has 144062 states and 204607 transitions. [2019-09-10 07:11:57,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:11:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 144062 states and 204607 transitions. [2019-09-10 07:11:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:11:57,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:57,372 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:57,372 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:57,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:57,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1522962295, now seen corresponding path program 1 times [2019-09-10 07:11:57,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:57,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:57,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:57,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:57,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:57,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:57,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:57,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:57,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:57,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:57,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:57,430 INFO L87 Difference]: Start difference. First operand 144062 states and 204607 transitions. Second operand 3 states. [2019-09-10 07:11:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:57,915 INFO L93 Difference]: Finished difference Result 197907 states and 276538 transitions. [2019-09-10 07:11:57,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:11:57,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:11:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:01,157 INFO L225 Difference]: With dead ends: 197907 [2019-09-10 07:12:01,158 INFO L226 Difference]: Without dead ends: 197907 [2019-09-10 07:12:01,158 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 07:12:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197907 states. [2019-09-10 07:12:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197907 to 135649. [2019-09-10 07:12:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135649 states. [2019-09-10 07:12:03,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135649 states to 135649 states and 189998 transitions. [2019-09-10 07:12:03,046 INFO L78 Accepts]: Start accepts. Automaton has 135649 states and 189998 transitions. Word has length 89 [2019-09-10 07:12:03,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:03,046 INFO L475 AbstractCegarLoop]: Abstraction has 135649 states and 189998 transitions. [2019-09-10 07:12:03,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:12:03,046 INFO L276 IsEmpty]: Start isEmpty. Operand 135649 states and 189998 transitions. [2019-09-10 07:12:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:12:03,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:03,056 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:12:03,057 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:03,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:03,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1195416311, now seen corresponding path program 1 times [2019-09-10 07:12:03,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:03,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:03,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:03,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:03,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:03,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:03,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:12:03,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:03,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:12:03,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:12:03,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:12:03,150 INFO L87 Difference]: Start difference. First operand 135649 states and 189998 transitions. Second operand 7 states. [2019-09-10 07:12:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:05,437 INFO L93 Difference]: Finished difference Result 726127 states and 1008885 transitions. [2019-09-10 07:12:05,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:12:05,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-10 07:12:05,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:06,573 INFO L225 Difference]: With dead ends: 726127 [2019-09-10 07:12:06,574 INFO L226 Difference]: Without dead ends: 726127 [2019-09-10 07:12:06,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:12:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726127 states. [2019-09-10 07:12:15,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726127 to 136063. [2019-09-10 07:12:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136063 states. [2019-09-10 07:12:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136063 states to 136063 states and 190528 transitions. [2019-09-10 07:12:15,832 INFO L78 Accepts]: Start accepts. Automaton has 136063 states and 190528 transitions. Word has length 89 [2019-09-10 07:12:15,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:15,833 INFO L475 AbstractCegarLoop]: Abstraction has 136063 states and 190528 transitions. [2019-09-10 07:12:15,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:12:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 136063 states and 190528 transitions. [2019-09-10 07:12:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:12:15,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:15,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:12:15,845 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:15,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:15,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1526121945, now seen corresponding path program 1 times [2019-09-10 07:12:15,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:15,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:15,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:15,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:15,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:15,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:15,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:12:15,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:15,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:12:15,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:12:15,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:12:15,936 INFO L87 Difference]: Start difference. First operand 136063 states and 190528 transitions. Second operand 7 states. [2019-09-10 07:12:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:18,567 INFO L93 Difference]: Finished difference Result 584803 states and 815968 transitions. [2019-09-10 07:12:18,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:12:18,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-10 07:12:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:19,403 INFO L225 Difference]: With dead ends: 584803 [2019-09-10 07:12:19,403 INFO L226 Difference]: Without dead ends: 584803 [2019-09-10 07:12:19,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:12:19,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584803 states. [2019-09-10 07:12:27,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584803 to 136123. [2019-09-10 07:12:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136123 states. [2019-09-10 07:12:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136123 states to 136123 states and 190608 transitions. [2019-09-10 07:12:27,762 INFO L78 Accepts]: Start accepts. Automaton has 136123 states and 190608 transitions. Word has length 89 [2019-09-10 07:12:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:27,762 INFO L475 AbstractCegarLoop]: Abstraction has 136123 states and 190608 transitions. [2019-09-10 07:12:27,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:12:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 136123 states and 190608 transitions. [2019-09-10 07:12:27,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:12:27,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:27,770 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:12:27,770 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:27,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:27,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1524215002, now seen corresponding path program 1 times [2019-09-10 07:12:27,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:27,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:27,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:27,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:27,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:27,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:27,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:12:27,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:27,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:12:27,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:12:27,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:12:27,850 INFO L87 Difference]: Start difference. First operand 136123 states and 190608 transitions. Second operand 7 states. [2019-09-10 07:12:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:30,343 INFO L93 Difference]: Finished difference Result 512869 states and 712217 transitions. [2019-09-10 07:12:30,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:12:30,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:12:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:31,070 INFO L225 Difference]: With dead ends: 512869 [2019-09-10 07:12:31,070 INFO L226 Difference]: Without dead ends: 512869 [2019-09-10 07:12:31,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:12:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512869 states. [2019-09-10 07:12:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512869 to 136223. [2019-09-10 07:12:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136223 states. [2019-09-10 07:12:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136223 states to 136223 states and 190728 transitions. [2019-09-10 07:12:38,684 INFO L78 Accepts]: Start accepts. Automaton has 136223 states and 190728 transitions. Word has length 90 [2019-09-10 07:12:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:38,685 INFO L475 AbstractCegarLoop]: Abstraction has 136223 states and 190728 transitions. [2019-09-10 07:12:38,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:12:38,685 INFO L276 IsEmpty]: Start isEmpty. Operand 136223 states and 190728 transitions. [2019-09-10 07:12:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:12:38,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:38,693 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:12:38,693 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:38,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:38,694 INFO L82 PathProgramCache]: Analyzing trace with hash -643370689, now seen corresponding path program 1 times [2019-09-10 07:12:38,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:38,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:38,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:38,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:38,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:38,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:38,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:12:38,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:38,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:12:38,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:12:38,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:12:38,808 INFO L87 Difference]: Start difference. First operand 136223 states and 190728 transitions. Second operand 7 states. [2019-09-10 07:12:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:41,902 INFO L93 Difference]: Finished difference Result 678731 states and 940249 transitions. [2019-09-10 07:12:41,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:12:41,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:12:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:42,798 INFO L225 Difference]: With dead ends: 678731 [2019-09-10 07:12:42,799 INFO L226 Difference]: Without dead ends: 678731 [2019-09-10 07:12:42,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:12:43,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678731 states. [2019-09-10 07:12:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678731 to 136867. [2019-09-10 07:12:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136867 states. [2019-09-10 07:12:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136867 states to 136867 states and 191546 transitions. [2019-09-10 07:12:47,766 INFO L78 Accepts]: Start accepts. Automaton has 136867 states and 191546 transitions. Word has length 90 [2019-09-10 07:12:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:47,766 INFO L475 AbstractCegarLoop]: Abstraction has 136867 states and 191546 transitions. [2019-09-10 07:12:47,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:12:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 136867 states and 191546 transitions. [2019-09-10 07:12:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:12:47,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:47,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] [2019-09-10 07:12:47,775 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:47,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1946274543, now seen corresponding path program 1 times [2019-09-10 07:12:47,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:47,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:47,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:47,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:47,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:50,535 WARN L188 SmtUtils]: Spent 2.65 s on a formula simplification that was a NOOP. DAG size: 12 [2019-09-10 07:12:50,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:50,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:50,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:12:50,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:50,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:12:50,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:12:50,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:12:50,563 INFO L87 Difference]: Start difference. First operand 136867 states and 191546 transitions. Second operand 7 states. [2019-09-10 07:12:51,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:51,797 INFO L93 Difference]: Finished difference Result 533833 states and 747005 transitions. [2019-09-10 07:12:51,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:12:51,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-09-10 07:12:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:52,489 INFO L225 Difference]: With dead ends: 533833 [2019-09-10 07:12:52,489 INFO L226 Difference]: Without dead ends: 533833 [2019-09-10 07:12:52,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:12:52,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533833 states. [2019-09-10 07:12:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533833 to 162295. [2019-09-10 07:12:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162295 states. [2019-09-10 07:13:00,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162295 states to 162295 states and 226844 transitions. [2019-09-10 07:13:00,163 INFO L78 Accepts]: Start accepts. Automaton has 162295 states and 226844 transitions. Word has length 91 [2019-09-10 07:13:00,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:00,163 INFO L475 AbstractCegarLoop]: Abstraction has 162295 states and 226844 transitions. [2019-09-10 07:13:00,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:13:00,163 INFO L276 IsEmpty]: Start isEmpty. Operand 162295 states and 226844 transitions. [2019-09-10 07:13:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:13:00,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:00,173 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:13:00,173 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:00,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:00,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1692361164, now seen corresponding path program 1 times [2019-09-10 07:13:00,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:00,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:00,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:00,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:00,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:00,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:00,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:13:00,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:00,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:13:00,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:13:00,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:00,338 INFO L87 Difference]: Start difference. First operand 162295 states and 226844 transitions. Second operand 7 states. [2019-09-10 07:13:01,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:01,637 INFO L93 Difference]: Finished difference Result 540317 states and 755039 transitions. [2019-09-10 07:13:01,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:13:01,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-09-10 07:13:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:03,516 INFO L225 Difference]: With dead ends: 540317 [2019-09-10 07:13:03,516 INFO L226 Difference]: Without dead ends: 540317 [2019-09-10 07:13:03,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:03,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540317 states. [2019-09-10 07:13:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540317 to 189321. [2019-09-10 07:13:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189321 states. [2019-09-10 07:13:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189321 states to 189321 states and 264921 transitions. [2019-09-10 07:13:14,390 INFO L78 Accepts]: Start accepts. Automaton has 189321 states and 264921 transitions. Word has length 91 [2019-09-10 07:13:14,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:14,390 INFO L475 AbstractCegarLoop]: Abstraction has 189321 states and 264921 transitions. [2019-09-10 07:13:14,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:13:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 189321 states and 264921 transitions. [2019-09-10 07:13:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:13:14,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:14,401 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:13:14,401 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:14,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:14,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1246904335, now seen corresponding path program 1 times [2019-09-10 07:13:14,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:14,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:14,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:14,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:14,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:14,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:14,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:13:14,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:14,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:13:14,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:13:14,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:14,542 INFO L87 Difference]: Start difference. First operand 189321 states and 264921 transitions. Second operand 7 states. [2019-09-10 07:13:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:15,957 INFO L93 Difference]: Finished difference Result 551649 states and 771121 transitions. [2019-09-10 07:13:15,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:13:15,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:13:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:16,723 INFO L225 Difference]: With dead ends: 551649 [2019-09-10 07:13:16,723 INFO L226 Difference]: Without dead ends: 551649 [2019-09-10 07:13:16,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:13:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551649 states. [2019-09-10 07:13:25,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551649 to 230269. [2019-09-10 07:13:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230269 states. [2019-09-10 07:13:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230269 states to 230269 states and 322430 transitions. [2019-09-10 07:13:26,068 INFO L78 Accepts]: Start accepts. Automaton has 230269 states and 322430 transitions. Word has length 92 [2019-09-10 07:13:26,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:26,068 INFO L475 AbstractCegarLoop]: Abstraction has 230269 states and 322430 transitions. [2019-09-10 07:13:26,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:13:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 230269 states and 322430 transitions. [2019-09-10 07:13:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:13:26,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:26,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] [2019-09-10 07:13:26,078 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:26,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:26,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1250063985, now seen corresponding path program 1 times [2019-09-10 07:13:26,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:26,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:26,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:26,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:26,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:26,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:26,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:26,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:13:26,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:26,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:13:26,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:13:26,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:26,224 INFO L87 Difference]: Start difference. First operand 230269 states and 322430 transitions. Second operand 7 states. [2019-09-10 07:13:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:28,940 INFO L93 Difference]: Finished difference Result 585165 states and 817997 transitions. [2019-09-10 07:13:28,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:13:28,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:13:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:29,705 INFO L225 Difference]: With dead ends: 585165 [2019-09-10 07:13:29,705 INFO L226 Difference]: Without dead ends: 585165 [2019-09-10 07:13:29,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585165 states. [2019-09-10 07:13:40,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585165 to 267549. [2019-09-10 07:13:40,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267549 states. [2019-09-10 07:13:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267549 states to 267549 states and 375026 transitions. [2019-09-10 07:13:41,393 INFO L78 Accepts]: Start accepts. Automaton has 267549 states and 375026 transitions. Word has length 92 [2019-09-10 07:13:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:41,393 INFO L475 AbstractCegarLoop]: Abstraction has 267549 states and 375026 transitions. [2019-09-10 07:13:41,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:13:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 267549 states and 375026 transitions. [2019-09-10 07:13:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:13:41,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:41,407 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:13:41,407 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:41,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:41,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2114361812, now seen corresponding path program 1 times [2019-09-10 07:13:41,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:41,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:41,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:41,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:41,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:41,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:41,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:13:41,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:41,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:13:41,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:13:41,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:41,511 INFO L87 Difference]: Start difference. First operand 267549 states and 375026 transitions. Second operand 7 states. [2019-09-10 07:13:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:42,962 INFO L93 Difference]: Finished difference Result 589285 states and 824137 transitions. [2019-09-10 07:13:42,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:13:42,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:13:42,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:49,530 INFO L225 Difference]: With dead ends: 589285 [2019-09-10 07:13:49,530 INFO L226 Difference]: Without dead ends: 589285 [2019-09-10 07:13:49,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:13:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589285 states. [2019-09-10 07:13:53,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589285 to 288763. [2019-09-10 07:13:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288763 states. [2019-09-10 07:13:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288763 states to 288763 states and 404948 transitions. [2019-09-10 07:13:54,732 INFO L78 Accepts]: Start accepts. Automaton has 288763 states and 404948 transitions. Word has length 92 [2019-09-10 07:13:54,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:54,732 INFO L475 AbstractCegarLoop]: Abstraction has 288763 states and 404948 transitions. [2019-09-10 07:13:54,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:13:54,732 INFO L276 IsEmpty]: Start isEmpty. Operand 288763 states and 404948 transitions. [2019-09-10 07:13:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 07:13:54,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:54,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:13:54,749 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:54,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash -2029869568, now seen corresponding path program 1 times [2019-09-10 07:13:54,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:54,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:54,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:54,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:54,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:54,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:13:54,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:54,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:13:54,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:13:54,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:13:54,973 INFO L87 Difference]: Start difference. First operand 288763 states and 404948 transitions. Second operand 10 states. [2019-09-10 07:14:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:00,594 INFO L93 Difference]: Finished difference Result 1016664 states and 1421467 transitions. [2019-09-10 07:14:00,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:14:00,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-09-10 07:14:00,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:02,148 INFO L225 Difference]: With dead ends: 1016664 [2019-09-10 07:14:02,149 INFO L226 Difference]: Without dead ends: 1016664 [2019-09-10 07:14:02,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:14:04,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016664 states. [2019-09-10 07:14:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016664 to 288763. [2019-09-10 07:14:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288763 states. [2019-09-10 07:14:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288763 states to 288763 states and 404914 transitions. [2019-09-10 07:14:19,854 INFO L78 Accepts]: Start accepts. Automaton has 288763 states and 404914 transitions. Word has length 96 [2019-09-10 07:14:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:19,855 INFO L475 AbstractCegarLoop]: Abstraction has 288763 states and 404914 transitions. [2019-09-10 07:14:19,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:14:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 288763 states and 404914 transitions. [2019-09-10 07:14:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:14:19,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:19,870 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:14:19,870 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:19,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:19,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1147760385, now seen corresponding path program 1 times [2019-09-10 07:14:19,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:19,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:19,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:19,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:19,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:20,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:20,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:14:20,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:20,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:14:20,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:14:20,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:14:20,052 INFO L87 Difference]: Start difference. First operand 288763 states and 404914 transitions. Second operand 10 states. [2019-09-10 07:14:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:28,293 INFO L93 Difference]: Finished difference Result 867563 states and 1212814 transitions. [2019-09-10 07:14:28,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:14:28,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-10 07:14:28,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:29,603 INFO L225 Difference]: With dead ends: 867563 [2019-09-10 07:14:29,603 INFO L226 Difference]: Without dead ends: 867563 [2019-09-10 07:14:29,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:14:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867563 states. [2019-09-10 07:14:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867563 to 288205. [2019-09-10 07:14:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288205 states. [2019-09-10 07:14:39,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288205 states to 288205 states and 404085 transitions. [2019-09-10 07:14:39,062 INFO L78 Accepts]: Start accepts. Automaton has 288205 states and 404085 transitions. Word has length 97 [2019-09-10 07:14:39,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:39,063 INFO L475 AbstractCegarLoop]: Abstraction has 288205 states and 404085 transitions. [2019-09-10 07:14:39,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:14:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 288205 states and 404085 transitions. [2019-09-10 07:14:39,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:14:39,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:39,079 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:14:39,079 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:39,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:39,079 INFO L82 PathProgramCache]: Analyzing trace with hash 769192610, now seen corresponding path program 1 times [2019-09-10 07:14:39,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:39,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:39,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:39,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:39,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:39,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:39,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:14:39,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:39,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:14:39,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:14:39,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:14:39,302 INFO L87 Difference]: Start difference. First operand 288205 states and 404085 transitions. Second operand 10 states. [2019-09-10 07:14:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:46,491 INFO L93 Difference]: Finished difference Result 1332753 states and 1857068 transitions. [2019-09-10 07:14:46,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 07:14:46,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-10 07:14:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:57,057 INFO L225 Difference]: With dead ends: 1332753 [2019-09-10 07:14:57,057 INFO L226 Difference]: Without dead ends: 1332753 [2019-09-10 07:14:57,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:14:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332753 states. [2019-09-10 07:15:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332753 to 287773. [2019-09-10 07:15:04,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287773 states. [2019-09-10 07:15:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287773 states to 287773 states and 403389 transitions. [2019-09-10 07:15:05,309 INFO L78 Accepts]: Start accepts. Automaton has 287773 states and 403389 transitions. Word has length 97 [2019-09-10 07:15:05,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:05,309 INFO L475 AbstractCegarLoop]: Abstraction has 287773 states and 403389 transitions. [2019-09-10 07:15:05,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:15:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 287773 states and 403389 transitions. [2019-09-10 07:15:05,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:15:05,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:05,321 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:05,321 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:05,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:05,322 INFO L82 PathProgramCache]: Analyzing trace with hash 929670118, now seen corresponding path program 1 times [2019-09-10 07:15:05,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:05,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:05,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:05,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:05,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:06,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:06,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:15:06,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:06,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:15:06,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:15:06,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:15:06,260 INFO L87 Difference]: Start difference. First operand 287773 states and 403389 transitions. Second operand 10 states. [2019-09-10 07:15:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:16,619 INFO L93 Difference]: Finished difference Result 1344408 states and 1866254 transitions. [2019-09-10 07:15:16,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:15:16,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-10 07:15:16,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:19,826 INFO L225 Difference]: With dead ends: 1344408 [2019-09-10 07:15:19,826 INFO L226 Difference]: Without dead ends: 1344408 [2019-09-10 07:15:19,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:15:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344408 states. [2019-09-10 07:15:37,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344408 to 287859. [2019-09-10 07:15:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287859 states. [2019-09-10 07:15:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287859 states to 287859 states and 403353 transitions. [2019-09-10 07:15:37,543 INFO L78 Accepts]: Start accepts. Automaton has 287859 states and 403353 transitions. Word has length 97 [2019-09-10 07:15:37,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:37,543 INFO L475 AbstractCegarLoop]: Abstraction has 287859 states and 403353 transitions. [2019-09-10 07:15:37,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:15:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 287859 states and 403353 transitions. [2019-09-10 07:15:37,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:15:37,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:37,555 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:37,555 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:37,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:37,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951554, now seen corresponding path program 1 times [2019-09-10 07:15:37,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:37,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:37,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:37,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:37,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:38,128 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-09-10 07:15:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:38,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:38,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:15:38,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:38,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:15:38,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:15:38,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:15:38,379 INFO L87 Difference]: Start difference. First operand 287859 states and 403353 transitions. Second operand 14 states. [2019-09-10 07:15:39,878 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:15:40,041 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:15:40,193 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-10 07:15:40,329 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 07:15:45,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:45,652 INFO L93 Difference]: Finished difference Result 1069577 states and 1487237 transitions. [2019-09-10 07:15:45,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:15:45,653 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-09-10 07:15:45,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:47,444 INFO L225 Difference]: With dead ends: 1069577 [2019-09-10 07:15:47,444 INFO L226 Difference]: Without dead ends: 1069577 [2019-09-10 07:15:47,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:15:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069577 states. [2019-09-10 07:16:06,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069577 to 541452. [2019-09-10 07:16:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541452 states. [2019-09-10 07:16:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541452 states to 541452 states and 757228 transitions. [2019-09-10 07:16:08,699 INFO L78 Accepts]: Start accepts. Automaton has 541452 states and 757228 transitions. Word has length 97 [2019-09-10 07:16:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:08,699 INFO L475 AbstractCegarLoop]: Abstraction has 541452 states and 757228 transitions. [2019-09-10 07:16:08,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:16:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 541452 states and 757228 transitions. [2019-09-10 07:16:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:16:08,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:08,713 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:08,713 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:08,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:08,713 INFO L82 PathProgramCache]: Analyzing trace with hash 838555303, now seen corresponding path program 1 times [2019-09-10 07:16:08,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:08,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:08,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:08,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:08,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:09,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 07:16:09,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:09,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:16:09,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:09,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:16:09,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:16:09,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:16:09,145 INFO L87 Difference]: Start difference. First operand 541452 states and 757228 transitions. Second operand 13 states. [2019-09-10 07:16:09,700 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 07:16:09,880 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 07:16:10,080 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 07:16:10,340 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 07:16:10,583 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:16:10,725 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-09-10 07:16:10,866 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:16:11,058 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:16:11,922 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 07:16:12,543 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 07:16:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:40,913 INFO L93 Difference]: Finished difference Result 3365117 states and 4681629 transitions. [2019-09-10 07:16:40,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 07:16:40,914 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-09-10 07:16:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:47,683 INFO L225 Difference]: With dead ends: 3365117 [2019-09-10 07:16:47,684 INFO L226 Difference]: Without dead ends: 3365117 [2019-09-10 07:16:47,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=333, Invalid=1149, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:16:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365117 states. [2019-09-10 07:17:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365117 to 541198. [2019-09-10 07:17:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541198 states. [2019-09-10 07:17:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541198 states to 541198 states and 756887 transitions. [2019-09-10 07:17:20,021 INFO L78 Accepts]: Start accepts. Automaton has 541198 states and 756887 transitions. Word has length 97 [2019-09-10 07:17:20,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:20,022 INFO L475 AbstractCegarLoop]: Abstraction has 541198 states and 756887 transitions. [2019-09-10 07:17:20,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:17:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 541198 states and 756887 transitions. [2019-09-10 07:17:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:17:20,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:20,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:20,036 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:20,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1453018506, now seen corresponding path program 1 times [2019-09-10 07:17:20,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:20,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:20,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:20,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:20,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:20,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:17:20,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:20,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:17:20,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:17:20,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:17:20,471 INFO L87 Difference]: Start difference. First operand 541198 states and 756887 transitions. Second operand 12 states. [2019-09-10 07:17:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:34,788 INFO L93 Difference]: Finished difference Result 1866106 states and 2609642 transitions. [2019-09-10 07:17:34,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:17:34,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-10 07:17:34,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:37,635 INFO L225 Difference]: With dead ends: 1866106 [2019-09-10 07:17:37,635 INFO L226 Difference]: Without dead ends: 1866106 [2019-09-10 07:17:37,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:17:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866106 states. [2019-09-10 07:18:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866106 to 525180. [2019-09-10 07:18:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525180 states. [2019-09-10 07:18:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525180 states to 525180 states and 735051 transitions. [2019-09-10 07:18:10,406 INFO L78 Accepts]: Start accepts. Automaton has 525180 states and 735051 transitions. Word has length 98 [2019-09-10 07:18:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:10,406 INFO L475 AbstractCegarLoop]: Abstraction has 525180 states and 735051 transitions. [2019-09-10 07:18:10,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:18:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 525180 states and 735051 transitions. [2019-09-10 07:18:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:18:10,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:10,417 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:18:10,417 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:10,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:10,418 INFO L82 PathProgramCache]: Analyzing trace with hash -403116399, now seen corresponding path program 1 times [2019-09-10 07:18:10,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:10,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:10,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:10,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:10,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:10,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:10,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:18:10,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:10,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:18:10,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:18:10,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:18:10,454 INFO L87 Difference]: Start difference. First operand 525180 states and 735051 transitions. Second operand 3 states. [2019-09-10 07:18:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:22,343 INFO L93 Difference]: Finished difference Result 824566 states and 1151677 transitions. [2019-09-10 07:18:22,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:18:22,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:18:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:23,639 INFO L225 Difference]: With dead ends: 824566 [2019-09-10 07:18:23,639 INFO L226 Difference]: Without dead ends: 824566 [2019-09-10 07:18:23,640 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 07:18:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824566 states. [2019-09-10 07:18:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824566 to 647922. [2019-09-10 07:18:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647922 states. [2019-09-10 07:18:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647922 states to 647922 states and 907197 transitions. [2019-09-10 07:18:34,082 INFO L78 Accepts]: Start accepts. Automaton has 647922 states and 907197 transitions. Word has length 98 [2019-09-10 07:18:34,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:34,082 INFO L475 AbstractCegarLoop]: Abstraction has 647922 states and 907197 transitions. [2019-09-10 07:18:34,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:18:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand 647922 states and 907197 transitions. [2019-09-10 07:18:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:18:34,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:34,093 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:18:34,093 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:34,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:34,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1928387185, now seen corresponding path program 1 times [2019-09-10 07:18:34,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:34,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:34,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:34,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:34,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:34,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 07:18:34,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:34,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:18:34,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:34,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:18:34,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:18:34,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:18:34,156 INFO L87 Difference]: Start difference. First operand 647922 states and 907197 transitions. Second operand 3 states. [2019-09-10 07:18:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:45,054 INFO L93 Difference]: Finished difference Result 1026311 states and 1433726 transitions. [2019-09-10 07:18:45,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:18:45,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:18:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:46,735 INFO L225 Difference]: With dead ends: 1026311 [2019-09-10 07:18:46,736 INFO L226 Difference]: Without dead ends: 1026311 [2019-09-10 07:18:46,736 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 07:18:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026311 states. [2019-09-10 07:18:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026311 to 615550. [2019-09-10 07:18:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615550 states. [2019-09-10 07:18:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615550 states to 615550 states and 861581 transitions. [2019-09-10 07:18:58,868 INFO L78 Accepts]: Start accepts. Automaton has 615550 states and 861581 transitions. Word has length 99 [2019-09-10 07:18:58,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:58,869 INFO L475 AbstractCegarLoop]: Abstraction has 615550 states and 861581 transitions. [2019-09-10 07:18:58,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:18:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 615550 states and 861581 transitions. [2019-09-10 07:18:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:18:58,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:58,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:18:58,881 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:58,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:58,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1833717307, now seen corresponding path program 1 times [2019-09-10 07:18:58,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:58,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:58,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:58,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:58,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:58,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:58,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:58,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:18:58,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:58,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:18:58,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:18:58,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:18:58,935 INFO L87 Difference]: Start difference. First operand 615550 states and 861581 transitions. Second operand 3 states. [2019-09-10 07:19:02,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:02,589 INFO L93 Difference]: Finished difference Result 582975 states and 809389 transitions. [2019-09-10 07:19:02,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:19:02,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 07:19:02,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:03,543 INFO L225 Difference]: With dead ends: 582975 [2019-09-10 07:19:03,544 INFO L226 Difference]: Without dead ends: 582975 [2019-09-10 07:19:03,544 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 07:19:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582975 states. [2019-09-10 07:19:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582975 to 582973. [2019-09-10 07:19:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582973 states. [2019-09-10 07:19:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582973 states to 582973 states and 809388 transitions. [2019-09-10 07:19:20,402 INFO L78 Accepts]: Start accepts. Automaton has 582973 states and 809388 transitions. Word has length 101 [2019-09-10 07:19:20,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:20,403 INFO L475 AbstractCegarLoop]: Abstraction has 582973 states and 809388 transitions. [2019-09-10 07:19:20,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:19:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 582973 states and 809388 transitions. [2019-09-10 07:19:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:19:20,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:20,417 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:20,417 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:20,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:20,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1797870042, now seen corresponding path program 1 times [2019-09-10 07:19:20,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:20,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:20,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:20,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:20,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:20,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:20,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:19:20,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:20,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:19:20,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:19:20,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:19:20,465 INFO L87 Difference]: Start difference. First operand 582973 states and 809388 transitions. Second operand 3 states. [2019-09-10 07:19:23,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:23,955 INFO L93 Difference]: Finished difference Result 787992 states and 1091734 transitions. [2019-09-10 07:19:23,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:19:23,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:19:23,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:25,137 INFO L225 Difference]: With dead ends: 787992 [2019-09-10 07:19:25,137 INFO L226 Difference]: Without dead ends: 787992 [2019-09-10 07:19:25,137 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 07:19:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787992 states. [2019-09-10 07:19:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787992 to 571371. [2019-09-10 07:19:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571371 states. [2019-09-10 07:19:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571371 states to 571371 states and 792110 transitions. [2019-09-10 07:19:43,583 INFO L78 Accepts]: Start accepts. Automaton has 571371 states and 792110 transitions. Word has length 102 [2019-09-10 07:19:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:43,583 INFO L475 AbstractCegarLoop]: Abstraction has 571371 states and 792110 transitions. [2019-09-10 07:19:43,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:19:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 571371 states and 792110 transitions. [2019-09-10 07:19:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:19:43,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:43,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:43,594 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:43,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:43,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2023712038, now seen corresponding path program 1 times [2019-09-10 07:19:43,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:43,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:43,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:43,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:43,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:44,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:44,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:19:44,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:44,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:19:44,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:19:44,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:19:44,383 INFO L87 Difference]: Start difference. First operand 571371 states and 792110 transitions. Second operand 19 states. [2019-09-10 07:19:44,979 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:19:45,214 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:19:45,433 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 07:20:07,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:07,326 INFO L93 Difference]: Finished difference Result 2469058 states and 3419025 transitions. [2019-09-10 07:20:07,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 07:20:07,326 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 102 [2019-09-10 07:20:07,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:12,410 INFO L225 Difference]: With dead ends: 2469058 [2019-09-10 07:20:12,411 INFO L226 Difference]: Without dead ends: 2469058 [2019-09-10 07:20:12,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=319, Invalid=1321, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:20:15,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469058 states. [2019-09-10 07:20:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469058 to 571371. [2019-09-10 07:20:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571371 states. [2019-09-10 07:20:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571371 states to 571371 states and 792102 transitions. [2019-09-10 07:20:34,875 INFO L78 Accepts]: Start accepts. Automaton has 571371 states and 792102 transitions. Word has length 102 [2019-09-10 07:20:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:34,875 INFO L475 AbstractCegarLoop]: Abstraction has 571371 states and 792102 transitions. [2019-09-10 07:20:34,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:20:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 571371 states and 792102 transitions. [2019-09-10 07:20:34,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:20:34,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:34,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:20:34,892 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:34,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:34,893 INFO L82 PathProgramCache]: Analyzing trace with hash -919194271, now seen corresponding path program 1 times [2019-09-10 07:20:34,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:34,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:34,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:34,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:34,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:37,577 WARN L188 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-09-10 07:20:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:20:37,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:37,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:20:37,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:37,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:20:37,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:20:37,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:20:37,631 INFO L87 Difference]: Start difference. First operand 571371 states and 792102 transitions. Second operand 15 states. [2019-09-10 07:20:38,088 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 07:20:38,274 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:20:59,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:59,732 INFO L93 Difference]: Finished difference Result 1846477 states and 2550263 transitions. [2019-09-10 07:20:59,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:20:59,733 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 103 [2019-09-10 07:20:59,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:03,824 INFO L225 Difference]: With dead ends: 1846477 [2019-09-10 07:21:03,824 INFO L226 Difference]: Without dead ends: 1846477 [2019-09-10 07:21:03,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:21:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846477 states. [2019-09-10 07:21:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846477 to 571427. [2019-09-10 07:21:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571427 states. [2019-09-10 07:21:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571427 states to 571427 states and 792166 transitions. [2019-09-10 07:21:20,909 INFO L78 Accepts]: Start accepts. Automaton has 571427 states and 792166 transitions. Word has length 103 [2019-09-10 07:21:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:20,909 INFO L475 AbstractCegarLoop]: Abstraction has 571427 states and 792166 transitions. [2019-09-10 07:21:20,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:21:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 571427 states and 792166 transitions. [2019-09-10 07:21:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 07:21:20,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:20,977 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2019-09-10 07:21:20,978 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:20,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:20,978 INFO L82 PathProgramCache]: Analyzing trace with hash -713682917, now seen corresponding path program 1 times [2019-09-10 07:21:20,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:20,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:20,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:20,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:20,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:21:21,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:21,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:21:21,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:21,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:21:21,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:21:21,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:21:21,034 INFO L87 Difference]: Start difference. First operand 571427 states and 792166 transitions. Second operand 3 states.