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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec11_product33.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:48:32,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:48:32,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:48:32,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:48:32,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:48:32,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:48:32,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:48:32,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:48:32,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:48:32,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:48:32,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:48:32,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:48:32,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:48:32,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:48:32,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:48:32,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:48:32,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:48:32,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:48:32,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:48:32,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:48:32,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:48:32,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:48:32,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:48:32,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:48:32,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:48:32,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:48:32,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:48:32,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:48:32,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:48:32,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:48:32,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:48:32,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:48:32,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:48:32,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:48:32,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:48:32,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:48:32,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:48:32,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:48:32,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:48:32,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:48:32,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:48:32,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:48:32,709 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:48:32,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:48:32,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:48:32,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:48:32,713 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:48:32,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:48:32,714 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:48:32,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:48:32,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:48:32,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:48:32,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:48:32,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:48:32,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:48:32,718 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:48:32,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:48:32,718 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:48:32,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:48:32,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:48:32,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:48:32,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:48:32,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:48:32,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:48:32,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:48:32,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:48:32,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:48:32,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:48:32,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:48:32,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:48:32,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:48:32,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:48:32,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:48:32,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:48:32,779 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:48:32,780 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:48:32,780 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec11_product33.cil.c [2019-10-02 12:48:32,838 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2c7bb9e/b34fe9a720104688860be7801a640a2a/FLAG6b1b1da10 [2019-10-02 12:48:33,448 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:48:33,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product33.cil.c [2019-10-02 12:48:33,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2c7bb9e/b34fe9a720104688860be7801a640a2a/FLAG6b1b1da10 [2019-10-02 12:48:33,666 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2c7bb9e/b34fe9a720104688860be7801a640a2a [2019-10-02 12:48:33,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:48:33,680 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:48:33,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:48:33,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:48:33,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:48:33,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:48:33" (1/1) ... [2019-10-02 12:48:33,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21180631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:33, skipping insertion in model container [2019-10-02 12:48:33,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:48:33" (1/1) ... [2019-10-02 12:48:33,697 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:48:33,784 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:48:34,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:48:34,561 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:48:34,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:48:34,877 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:48:34,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:34 WrapperNode [2019-10-02 12:48:34,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:48:34,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:48:34,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:48:34,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:48:34,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:34" (1/1) ... [2019-10-02 12:48:34,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:34" (1/1) ... [2019-10-02 12:48:34,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:34" (1/1) ... [2019-10-02 12:48:34,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:34" (1/1) ... [2019-10-02 12:48:35,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:34" (1/1) ... [2019-10-02 12:48:35,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:34" (1/1) ... [2019-10-02 12:48:35,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:34" (1/1) ... [2019-10-02 12:48:35,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:48:35,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:48:35,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:48:35,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:48:35,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:34" (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-10-02 12:48:35,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:48:35,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:48:35,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:48:35,143 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:48:35,144 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:48:35,144 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:48:35,144 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:48:35,145 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:48:35,145 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:48:35,145 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:48:35,145 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:48:35,146 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:48:35,147 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:48:35,147 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:48:35,148 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:48:35,148 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:48:35,151 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:48:35,151 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:48:35,151 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:48:35,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:48:35,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:48:35,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:48:35,152 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:48:35,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:48:35,153 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:48:35,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:48:35,153 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:48:35,153 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:48:35,154 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:48:35,154 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:48:35,154 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:48:35,154 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:48:35,155 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:48:35,155 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-10-02 12:48:35,155 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 12:48:35,155 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:48:35,155 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:48:35,155 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:48:35,155 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:48:35,156 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:48:35,156 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:48:35,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:48:35,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:48:35,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:48:35,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:48:35,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:48:35,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:48:35,157 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:48:35,157 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:48:35,158 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:48:35,158 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:48:35,158 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:48:35,158 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 12:48:35,158 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 12:48:35,158 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 12:48:35,159 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 12:48:35,159 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:48:35,159 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:48:35,159 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:48:35,159 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:48:35,159 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:48:35,160 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:48:35,160 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:48:35,160 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:48:35,160 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:48:35,160 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 12:48:35,160 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 12:48:35,161 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 12:48:35,161 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 12:48:35,161 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:48:35,161 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:48:35,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:48:35,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:48:35,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:48:35,163 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:48:35,163 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:48:35,163 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:48:35,163 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:48:35,164 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:48:35,164 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:48:35,164 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:48:35,164 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:48:35,165 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:48:35,165 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:48:35,166 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:48:35,166 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:48:35,166 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:48:35,167 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:48:35,167 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:48:35,168 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:48:35,169 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-02 12:48:35,169 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:48:35,169 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:48:35,169 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:48:35,170 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:48:35,170 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:48:35,170 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:48:35,170 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:48:35,170 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:48:35,170 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:48:35,171 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:48:35,171 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:48:35,171 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:48:35,171 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:48:35,171 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:48:35,171 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:48:35,172 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:48:35,172 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:48:35,172 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:48:35,172 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:48:35,172 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 12:48:35,173 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 12:48:35,173 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:48:35,173 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:48:35,173 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:48:35,174 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:48:35,174 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:48:35,174 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:48:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:48:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:48:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:48:35,176 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:48:35,176 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:48:35,176 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:48:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:48:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:48:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:48:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:48:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:48:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:48:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:48:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:48:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:48:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:48:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:48:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:48:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:48:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:48:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:48:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:48:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:48:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:48:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:48:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:48:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:48:35,195 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:48:35,195 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:48:35,195 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:48:35,195 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:48:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:48:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:48:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:48:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:48:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:48:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:48:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:48:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:48:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:48:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:48:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:48:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:48:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:48:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:48:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:48:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:48:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:48:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-10-02 12:48:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 12:48:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:48:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:48:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:48:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:48:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:48:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:48:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:48:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:48:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:48:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:48:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:48:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:48:35,202 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:48:35,202 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:48:35,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:48:35,202 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:48:35,202 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:48:35,202 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:48:35,203 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:48:35,203 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:48:35,203 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:48:35,203 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:48:35,203 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:48:35,203 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:48:35,204 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:48:35,204 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:48:35,204 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:48:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:48:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:48:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:48:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:48:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:48:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:48:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:48:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:48:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:48:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 12:48:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 12:48:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 12:48:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 12:48:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:48:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:48:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 12:48:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 12:48:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 12:48:35,208 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 12:48:35,208 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-02 12:48:35,208 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:48:35,208 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:48:35,208 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:48:35,208 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:48:35,209 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:48:35,209 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:48:35,209 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:48:35,209 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:48:35,209 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:48:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:48:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:48:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:48:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:48:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:48:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:48:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:48:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:48:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:48:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:48:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:48:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:48:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:48:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:48:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:48:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:48:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:48:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:48:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 12:48:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 12:48:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:48:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:48:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:48:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:48:35,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:48:35,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:48:35,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:48:37,438 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:48:37,439 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:48:37,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:48:37 BoogieIcfgContainer [2019-10-02 12:48:37,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:48:37,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:48:37,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:48:37,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:48:37,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:48:33" (1/3) ... [2019-10-02 12:48:37,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fb92a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:48:37, skipping insertion in model container [2019-10-02 12:48:37,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:34" (2/3) ... [2019-10-02 12:48:37,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fb92a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:48:37, skipping insertion in model container [2019-10-02 12:48:37,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:48:37" (3/3) ... [2019-10-02 12:48:37,448 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product33.cil.c [2019-10-02 12:48:37,458 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:48:37,471 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:48:37,489 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:48:37,538 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:48:37,539 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:48:37,539 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:48:37,539 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:48:37,539 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:48:37,542 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:48:37,543 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:48:37,543 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:48:37,543 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:48:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states. [2019-10-02 12:48:37,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 12:48:37,628 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:37,631 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:37,634 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:37,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:37,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1359243450, now seen corresponding path program 1 times [2019-10-02 12:48:37,642 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:37,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:37,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:37,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:37,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:48:38,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:38,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:48:38,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:48:38,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:48:38,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:48:38,467 INFO L87 Difference]: Start difference. First operand 587 states. Second operand 2 states. [2019-10-02 12:48:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:38,546 INFO L93 Difference]: Finished difference Result 905 states and 1191 transitions. [2019-10-02 12:48:38,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:48:38,548 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 218 [2019-10-02 12:48:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:38,584 INFO L225 Difference]: With dead ends: 905 [2019-10-02 12:48:38,585 INFO L226 Difference]: Without dead ends: 564 [2019-10-02 12:48:38,597 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:48:38,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-02 12:48:38,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-10-02 12:48:38,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-02 12:48:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 744 transitions. [2019-10-02 12:48:38,738 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 744 transitions. Word has length 218 [2019-10-02 12:48:38,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:38,740 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 744 transitions. [2019-10-02 12:48:38,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:48:38,741 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 744 transitions. [2019-10-02 12:48:38,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 12:48:38,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:38,747 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:38,748 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:38,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:38,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1875979092, now seen corresponding path program 1 times [2019-10-02 12:48:38,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:38,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:38,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:38,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:38,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:48:39,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:39,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:48:39,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:48:39,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:48:39,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:48:39,018 INFO L87 Difference]: Start difference. First operand 564 states and 744 transitions. Second operand 3 states. [2019-10-02 12:48:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:39,101 INFO L93 Difference]: Finished difference Result 888 states and 1154 transitions. [2019-10-02 12:48:39,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:48:39,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-10-02 12:48:39,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:39,108 INFO L225 Difference]: With dead ends: 888 [2019-10-02 12:48:39,108 INFO L226 Difference]: Without dead ends: 567 [2019-10-02 12:48:39,122 INFO L640 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-10-02 12:48:39,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-10-02 12:48:39,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 566. [2019-10-02 12:48:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-02 12:48:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 746 transitions. [2019-10-02 12:48:39,182 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 746 transitions. Word has length 219 [2019-10-02 12:48:39,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:39,185 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 746 transitions. [2019-10-02 12:48:39,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:48:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 746 transitions. [2019-10-02 12:48:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 12:48:39,195 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:39,196 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:39,196 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:39,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:39,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1298446294, now seen corresponding path program 1 times [2019-10-02 12:48:39,196 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:39,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:39,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:39,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:39,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:48:39,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:39,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:48:39,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:48:39,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:48:39,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:48:39,606 INFO L87 Difference]: Start difference. First operand 566 states and 746 transitions. Second operand 3 states. [2019-10-02 12:48:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:39,652 INFO L93 Difference]: Finished difference Result 1110 states and 1493 transitions. [2019-10-02 12:48:39,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:48:39,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-02 12:48:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:39,661 INFO L225 Difference]: With dead ends: 1110 [2019-10-02 12:48:39,661 INFO L226 Difference]: Without dead ends: 609 [2019-10-02 12:48:39,663 INFO L640 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-10-02 12:48:39,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-10-02 12:48:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 608. [2019-10-02 12:48:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-10-02 12:48:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 818 transitions. [2019-10-02 12:48:39,703 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 818 transitions. Word has length 231 [2019-10-02 12:48:39,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:39,705 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 818 transitions. [2019-10-02 12:48:39,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:48:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 818 transitions. [2019-10-02 12:48:39,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 12:48:39,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:39,712 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:39,712 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:39,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:39,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1265412582, now seen corresponding path program 1 times [2019-10-02 12:48:39,714 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:39,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:39,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:39,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:39,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:48:39,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:39,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:48:39,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:48:39,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:48:39,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:48:39,926 INFO L87 Difference]: Start difference. First operand 608 states and 818 transitions. Second operand 3 states. [2019-10-02 12:48:39,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:39,972 INFO L93 Difference]: Finished difference Result 1233 states and 1704 transitions. [2019-10-02 12:48:39,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:48:39,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-10-02 12:48:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:39,979 INFO L225 Difference]: With dead ends: 1233 [2019-10-02 12:48:39,979 INFO L226 Difference]: Without dead ends: 690 [2019-10-02 12:48:39,982 INFO L640 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-10-02 12:48:39,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-10-02 12:48:40,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 689. [2019-10-02 12:48:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-10-02 12:48:40,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 956 transitions. [2019-10-02 12:48:40,018 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 956 transitions. Word has length 232 [2019-10-02 12:48:40,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:40,019 INFO L475 AbstractCegarLoop]: Abstraction has 689 states and 956 transitions. [2019-10-02 12:48:40,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:48:40,019 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 956 transitions. [2019-10-02 12:48:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 12:48:40,024 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:40,025 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:40,025 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:40,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:40,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1880948969, now seen corresponding path program 1 times [2019-10-02 12:48:40,026 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:40,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:40,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:40,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:40,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 12:48:40,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:40,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 12:48:40,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:48:40,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:48:40,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:48:40,662 INFO L87 Difference]: Start difference. First operand 689 states and 956 transitions. Second operand 19 states. [2019-10-02 12:48:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:45,378 INFO L93 Difference]: Finished difference Result 2335 states and 3224 transitions. [2019-10-02 12:48:45,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 12:48:45,379 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 235 [2019-10-02 12:48:45,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:45,393 INFO L225 Difference]: With dead ends: 2335 [2019-10-02 12:48:45,393 INFO L226 Difference]: Without dead ends: 2027 [2019-10-02 12:48:45,399 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 12:48:45,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-10-02 12:48:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1990. [2019-10-02 12:48:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1990 states. [2019-10-02 12:48:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2766 transitions. [2019-10-02 12:48:45,544 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2766 transitions. Word has length 235 [2019-10-02 12:48:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:45,547 INFO L475 AbstractCegarLoop]: Abstraction has 1990 states and 2766 transitions. [2019-10-02 12:48:45,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:48:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2766 transitions. [2019-10-02 12:48:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 12:48:45,555 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:45,555 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:45,555 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:45,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:45,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1271254735, now seen corresponding path program 1 times [2019-10-02 12:48:45,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:45,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:45,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:45,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:45,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 12:48:45,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:45,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:48:45,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:48:45,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:48:45,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:48:45,824 INFO L87 Difference]: Start difference. First operand 1990 states and 2766 transitions. Second operand 11 states. [2019-10-02 12:48:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:46,263 INFO L93 Difference]: Finished difference Result 3347 states and 4565 transitions. [2019-10-02 12:48:46,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:48:46,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 236 [2019-10-02 12:48:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:46,279 INFO L225 Difference]: With dead ends: 3347 [2019-10-02 12:48:46,279 INFO L226 Difference]: Without dead ends: 2048 [2019-10-02 12:48:46,284 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:48:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2019-10-02 12:48:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2019-10-02 12:48:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-10-02 12:48:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2859 transitions. [2019-10-02 12:48:46,382 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2859 transitions. Word has length 236 [2019-10-02 12:48:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:46,383 INFO L475 AbstractCegarLoop]: Abstraction has 2048 states and 2859 transitions. [2019-10-02 12:48:46,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:48:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2859 transitions. [2019-10-02 12:48:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 12:48:46,392 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:46,392 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:46,393 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:46,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:46,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1576503556, now seen corresponding path program 1 times [2019-10-02 12:48:46,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:46,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:46,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:46,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:46,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 12:48:46,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:46,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 12:48:46,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 12:48:46,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 12:48:46,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:48:46,672 INFO L87 Difference]: Start difference. First operand 2048 states and 2859 transitions. Second operand 16 states. [2019-10-02 12:48:47,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:47,154 INFO L93 Difference]: Finished difference Result 3423 states and 4679 transitions. [2019-10-02 12:48:47,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:48:47,155 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 236 [2019-10-02 12:48:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:47,172 INFO L225 Difference]: With dead ends: 3423 [2019-10-02 12:48:47,172 INFO L226 Difference]: Without dead ends: 2080 [2019-10-02 12:48:47,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-02 12:48:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2019-10-02 12:48:47,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 2080. [2019-10-02 12:48:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2080 states. [2019-10-02 12:48:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 2892 transitions. [2019-10-02 12:48:47,398 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 2892 transitions. Word has length 236 [2019-10-02 12:48:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:47,399 INFO L475 AbstractCegarLoop]: Abstraction has 2080 states and 2892 transitions. [2019-10-02 12:48:47,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 12:48:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 2892 transitions. [2019-10-02 12:48:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 12:48:47,412 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:47,412 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:47,412 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:47,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:47,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1218781435, now seen corresponding path program 1 times [2019-10-02 12:48:47,413 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:47,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:47,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:47,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:47,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 12:48:47,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:47,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 12:48:47,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:48:47,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:48:47,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:48:47,830 INFO L87 Difference]: Start difference. First operand 2080 states and 2892 transitions. Second operand 15 states. [2019-10-02 12:48:52,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:52,054 INFO L93 Difference]: Finished difference Result 3463 states and 4723 transitions. [2019-10-02 12:48:52,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 12:48:52,054 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 236 [2019-10-02 12:48:52,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:52,068 INFO L225 Difference]: With dead ends: 3463 [2019-10-02 12:48:52,068 INFO L226 Difference]: Without dead ends: 2164 [2019-10-02 12:48:52,074 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 12:48:52,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2019-10-02 12:48:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2109. [2019-10-02 12:48:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-10-02 12:48:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2939 transitions. [2019-10-02 12:48:52,198 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 2939 transitions. Word has length 236 [2019-10-02 12:48:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:52,200 INFO L475 AbstractCegarLoop]: Abstraction has 2109 states and 2939 transitions. [2019-10-02 12:48:52,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:48:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2939 transitions. [2019-10-02 12:48:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 12:48:52,217 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:52,218 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:52,218 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:52,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:52,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1072234906, now seen corresponding path program 1 times [2019-10-02 12:48:52,219 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:52,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:52,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:52,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:52,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 12:48:52,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:52,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:48:52,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:48:52,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:48:52,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:48:52,511 INFO L87 Difference]: Start difference. First operand 2109 states and 2939 transitions. Second operand 5 states. [2019-10-02 12:48:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:53,563 INFO L93 Difference]: Finished difference Result 5198 states and 7180 transitions. [2019-10-02 12:48:53,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:48:53,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2019-10-02 12:48:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:53,591 INFO L225 Difference]: With dead ends: 5198 [2019-10-02 12:48:53,592 INFO L226 Difference]: Without dead ends: 4515 [2019-10-02 12:48:53,597 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:48:53,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2019-10-02 12:48:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 4484. [2019-10-02 12:48:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4484 states. [2019-10-02 12:48:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6217 transitions. [2019-10-02 12:48:53,836 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6217 transitions. Word has length 236 [2019-10-02 12:48:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:53,837 INFO L475 AbstractCegarLoop]: Abstraction has 4484 states and 6217 transitions. [2019-10-02 12:48:53,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:48:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6217 transitions. [2019-10-02 12:48:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 12:48:53,850 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:53,851 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:53,851 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:53,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1057984761, now seen corresponding path program 1 times [2019-10-02 12:48:53,852 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:53,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:53,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:53,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:53,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 12:48:54,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:48:54,066 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:48:54,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:54,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 3032 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:48:54,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:48:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:48:54,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:48:54,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:48:54,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:48:54,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:48:54,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:48:54,969 INFO L87 Difference]: Start difference. First operand 4484 states and 6217 transitions. Second operand 14 states. [2019-10-02 12:49:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:01,716 INFO L93 Difference]: Finished difference Result 15772 states and 22605 transitions. [2019-10-02 12:49:01,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 12:49:01,732 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 236 [2019-10-02 12:49:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:01,800 INFO L225 Difference]: With dead ends: 15772 [2019-10-02 12:49:01,800 INFO L226 Difference]: Without dead ends: 11324 [2019-10-02 12:49:01,826 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:49:01,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11324 states. [2019-10-02 12:49:02,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11324 to 11290. [2019-10-02 12:49:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11290 states. [2019-10-02 12:49:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11290 states to 11290 states and 15805 transitions. [2019-10-02 12:49:02,663 INFO L78 Accepts]: Start accepts. Automaton has 11290 states and 15805 transitions. Word has length 236 [2019-10-02 12:49:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:02,665 INFO L475 AbstractCegarLoop]: Abstraction has 11290 states and 15805 transitions. [2019-10-02 12:49:02,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:49:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 11290 states and 15805 transitions. [2019-10-02 12:49:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 12:49:02,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:02,681 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:02,681 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:02,682 INFO L82 PathProgramCache]: Analyzing trace with hash -200454005, now seen corresponding path program 1 times [2019-10-02 12:49:02,682 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:02,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:02,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:02,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:02,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:49:03,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:49:03,318 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:49:03,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:03,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 3035 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:49:03,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:49:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:49:04,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:49:04,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2019-10-02 12:49:04,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 12:49:04,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 12:49:04,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2019-10-02 12:49:04,179 INFO L87 Difference]: Start difference. First operand 11290 states and 15805 transitions. Second operand 29 states. [2019-10-02 12:49:07,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:07,541 INFO L93 Difference]: Finished difference Result 22786 states and 32689 transitions. [2019-10-02 12:49:07,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 12:49:07,542 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 239 [2019-10-02 12:49:07,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:07,619 INFO L225 Difference]: With dead ends: 22786 [2019-10-02 12:49:07,619 INFO L226 Difference]: Without dead ends: 10597 [2019-10-02 12:49:07,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=177, Invalid=2579, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 12:49:07,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10597 states. [2019-10-02 12:49:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10597 to 10399. [2019-10-02 12:49:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10399 states. [2019-10-02 12:49:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10399 states to 10399 states and 14503 transitions. [2019-10-02 12:49:08,310 INFO L78 Accepts]: Start accepts. Automaton has 10399 states and 14503 transitions. Word has length 239 [2019-10-02 12:49:08,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:08,310 INFO L475 AbstractCegarLoop]: Abstraction has 10399 states and 14503 transitions. [2019-10-02 12:49:08,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 12:49:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 10399 states and 14503 transitions. [2019-10-02 12:49:08,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 12:49:08,325 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:08,325 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:08,326 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:08,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:08,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1949409007, now seen corresponding path program 1 times [2019-10-02 12:49:08,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:08,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:08,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:49:08,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:49:08,541 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:49:08,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:09,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 3051 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:49:09,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:49:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:49:09,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:49:09,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2019-10-02 12:49:09,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 12:49:09,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 12:49:09,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:49:09,474 INFO L87 Difference]: Start difference. First operand 10399 states and 14503 transitions. Second operand 17 states. [2019-10-02 12:49:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:11,673 INFO L93 Difference]: Finished difference Result 21347 states and 30159 transitions. [2019-10-02 12:49:11,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 12:49:11,678 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 244 [2019-10-02 12:49:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:11,729 INFO L225 Difference]: With dead ends: 21347 [2019-10-02 12:49:11,729 INFO L226 Difference]: Without dead ends: 11009 [2019-10-02 12:49:11,767 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:49:11,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11009 states. [2019-10-02 12:49:12,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11009 to 10529. [2019-10-02 12:49:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10529 states. [2019-10-02 12:49:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10529 states to 10529 states and 14674 transitions. [2019-10-02 12:49:12,295 INFO L78 Accepts]: Start accepts. Automaton has 10529 states and 14674 transitions. Word has length 244 [2019-10-02 12:49:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:12,295 INFO L475 AbstractCegarLoop]: Abstraction has 10529 states and 14674 transitions. [2019-10-02 12:49:12,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 12:49:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 10529 states and 14674 transitions. [2019-10-02 12:49:12,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 12:49:12,313 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:12,315 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:12,315 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:12,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:12,315 INFO L82 PathProgramCache]: Analyzing trace with hash -151930496, now seen corresponding path program 1 times [2019-10-02 12:49:12,315 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:12,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:12,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:12,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:12,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 12:49:13,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:49:13,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-10-02 12:49:13,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 12:49:13,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 12:49:13,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-10-02 12:49:13,015 INFO L87 Difference]: Start difference. First operand 10529 states and 14674 transitions. Second operand 30 states. [2019-10-02 12:49:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:14,481 INFO L93 Difference]: Finished difference Result 20057 states and 27793 transitions. [2019-10-02 12:49:14,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 12:49:14,482 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 252 [2019-10-02 12:49:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:14,531 INFO L225 Difference]: With dead ends: 20057 [2019-10-02 12:49:14,532 INFO L226 Difference]: Without dead ends: 10810 [2019-10-02 12:49:14,555 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=109, Invalid=1697, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 12:49:14,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10810 states. [2019-10-02 12:49:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10810 to 10769. [2019-10-02 12:49:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10769 states. [2019-10-02 12:49:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10769 states to 10769 states and 14974 transitions. [2019-10-02 12:49:15,059 INFO L78 Accepts]: Start accepts. Automaton has 10769 states and 14974 transitions. Word has length 252 [2019-10-02 12:49:15,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:15,060 INFO L475 AbstractCegarLoop]: Abstraction has 10769 states and 14974 transitions. [2019-10-02 12:49:15,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 12:49:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 10769 states and 14974 transitions. [2019-10-02 12:49:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 12:49:15,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:15,083 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:15,083 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:15,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:15,084 INFO L82 PathProgramCache]: Analyzing trace with hash -532914406, now seen corresponding path program 1 times [2019-10-02 12:49:15,084 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:15,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:15,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:15,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:15,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:49:15,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:49:15,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:49:15,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:49:15,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:49:15,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:49:15,311 INFO L87 Difference]: Start difference. First operand 10769 states and 14974 transitions. Second operand 5 states. [2019-10-02 12:49:15,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:15,728 INFO L93 Difference]: Finished difference Result 19293 states and 26515 transitions. [2019-10-02 12:49:15,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:49:15,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2019-10-02 12:49:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:15,769 INFO L225 Difference]: With dead ends: 19293 [2019-10-02 12:49:15,769 INFO L226 Difference]: Without dead ends: 10930 [2019-10-02 12:49:15,788 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:49:15,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10930 states. [2019-10-02 12:49:16,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10930 to 10815. [2019-10-02 12:49:16,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10815 states. [2019-10-02 12:49:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10815 states to 10815 states and 15024 transitions. [2019-10-02 12:49:16,365 INFO L78 Accepts]: Start accepts. Automaton has 10815 states and 15024 transitions. Word has length 249 [2019-10-02 12:49:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:16,366 INFO L475 AbstractCegarLoop]: Abstraction has 10815 states and 15024 transitions. [2019-10-02 12:49:16,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:49:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 10815 states and 15024 transitions. [2019-10-02 12:49:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-02 12:49:16,389 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:16,389 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:16,390 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:16,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash 930200836, now seen corresponding path program 1 times [2019-10-02 12:49:16,391 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:16,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:16,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:16,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:16,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:49:16,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:49:16,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:49:16,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:49:16,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:49:16,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:49:16,573 INFO L87 Difference]: Start difference. First operand 10815 states and 15024 transitions. Second operand 5 states. [2019-10-02 12:49:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:16,850 INFO L93 Difference]: Finished difference Result 18074 states and 24732 transitions. [2019-10-02 12:49:16,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:49:16,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 251 [2019-10-02 12:49:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:16,885 INFO L225 Difference]: With dead ends: 18074 [2019-10-02 12:49:16,886 INFO L226 Difference]: Without dead ends: 8812 [2019-10-02 12:49:16,906 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:49:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8812 states. [2019-10-02 12:49:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8812 to 8806. [2019-10-02 12:49:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8806 states. [2019-10-02 12:49:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8806 states to 8806 states and 12208 transitions. [2019-10-02 12:49:17,317 INFO L78 Accepts]: Start accepts. Automaton has 8806 states and 12208 transitions. Word has length 251 [2019-10-02 12:49:17,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:17,318 INFO L475 AbstractCegarLoop]: Abstraction has 8806 states and 12208 transitions. [2019-10-02 12:49:17,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:49:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 8806 states and 12208 transitions. [2019-10-02 12:49:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-02 12:49:17,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:17,332 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:17,333 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:17,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:17,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1247012548, now seen corresponding path program 1 times [2019-10-02 12:49:17,333 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:17,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:17,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:17,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:17,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:49:17,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:49:17,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:49:17,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:49:17,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:49:17,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:49:17,672 INFO L87 Difference]: Start difference. First operand 8806 states and 12208 transitions. Second operand 6 states. [2019-10-02 12:49:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:18,479 INFO L93 Difference]: Finished difference Result 24998 states and 34434 transitions. [2019-10-02 12:49:18,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:49:18,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 250 [2019-10-02 12:49:18,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:18,552 INFO L225 Difference]: With dead ends: 24998 [2019-10-02 12:49:18,553 INFO L226 Difference]: Without dead ends: 17603 [2019-10-02 12:49:18,578 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:49:18,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17603 states. [2019-10-02 12:49:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17603 to 17437. [2019-10-02 12:49:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17437 states. [2019-10-02 12:49:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17437 states to 17437 states and 24252 transitions. [2019-10-02 12:49:19,415 INFO L78 Accepts]: Start accepts. Automaton has 17437 states and 24252 transitions. Word has length 250 [2019-10-02 12:49:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:19,415 INFO L475 AbstractCegarLoop]: Abstraction has 17437 states and 24252 transitions. [2019-10-02 12:49:19,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:49:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 17437 states and 24252 transitions. [2019-10-02 12:49:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-02 12:49:19,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:19,448 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:19,448 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1860903153, now seen corresponding path program 1 times [2019-10-02 12:49:19,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:19,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:19,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:19,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:19,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:49:19,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:49:19,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:49:19,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:49:19,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:49:19,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:49:19,856 INFO L87 Difference]: Start difference. First operand 17437 states and 24252 transitions. Second operand 10 states. [2019-10-02 12:49:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:20,265 INFO L93 Difference]: Finished difference Result 17442 states and 24256 transitions. [2019-10-02 12:49:20,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:49:20,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 256 [2019-10-02 12:49:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:20,334 INFO L225 Difference]: With dead ends: 17442 [2019-10-02 12:49:20,334 INFO L226 Difference]: Without dead ends: 17437 [2019-10-02 12:49:20,347 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:49:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17437 states. [2019-10-02 12:49:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17437 to 17437. [2019-10-02 12:49:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17437 states. [2019-10-02 12:49:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17437 states to 17437 states and 24156 transitions. [2019-10-02 12:49:21,027 INFO L78 Accepts]: Start accepts. Automaton has 17437 states and 24156 transitions. Word has length 256 [2019-10-02 12:49:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:21,028 INFO L475 AbstractCegarLoop]: Abstraction has 17437 states and 24156 transitions. [2019-10-02 12:49:21,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:49:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 17437 states and 24156 transitions. [2019-10-02 12:49:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-02 12:49:21,058 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:21,058 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:21,059 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:21,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:21,059 INFO L82 PathProgramCache]: Analyzing trace with hash -58447414, now seen corresponding path program 1 times [2019-10-02 12:49:21,059 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:21,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:21,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:21,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:21,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:49:21,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:49:21,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:49:21,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:49:21,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:49:21,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:49:21,212 INFO L87 Difference]: Start difference. First operand 17437 states and 24156 transitions. Second operand 3 states. [2019-10-02 12:49:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:21,845 INFO L93 Difference]: Finished difference Result 35727 states and 50039 transitions. [2019-10-02 12:49:21,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:49:21,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2019-10-02 12:49:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:21,903 INFO L225 Difference]: With dead ends: 35727 [2019-10-02 12:49:21,903 INFO L226 Difference]: Without dead ends: 18379 [2019-10-02 12:49:21,935 INFO L640 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-10-02 12:49:21,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18379 states. [2019-10-02 12:49:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18379 to 18373. [2019-10-02 12:49:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18373 states. [2019-10-02 12:49:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18373 states to 18373 states and 25956 transitions. [2019-10-02 12:49:22,542 INFO L78 Accepts]: Start accepts. Automaton has 18373 states and 25956 transitions. Word has length 285 [2019-10-02 12:49:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:22,543 INFO L475 AbstractCegarLoop]: Abstraction has 18373 states and 25956 transitions. [2019-10-02 12:49:22,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:49:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 18373 states and 25956 transitions. [2019-10-02 12:49:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-02 12:49:22,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:22,562 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:22,562 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:22,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:22,563 INFO L82 PathProgramCache]: Analyzing trace with hash 476420126, now seen corresponding path program 1 times [2019-10-02 12:49:22,563 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:22,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:22,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:22,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:22,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:49:22,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:49:22,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:49:22,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:49:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:49:22,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:49:22,789 INFO L87 Difference]: Start difference. First operand 18373 states and 25956 transitions. Second operand 8 states. [2019-10-02 12:49:28,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:28,920 INFO L93 Difference]: Finished difference Result 55685 states and 81538 transitions. [2019-10-02 12:49:28,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:49:28,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 286 [2019-10-02 12:49:28,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:29,063 INFO L225 Difference]: With dead ends: 55685 [2019-10-02 12:49:29,063 INFO L226 Difference]: Without dead ends: 37401 [2019-10-02 12:49:29,103 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:49:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37401 states. [2019-10-02 12:49:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37401 to 33469. [2019-10-02 12:49:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33469 states. [2019-10-02 12:49:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33469 states to 33469 states and 49038 transitions. [2019-10-02 12:49:30,519 INFO L78 Accepts]: Start accepts. Automaton has 33469 states and 49038 transitions. Word has length 286 [2019-10-02 12:49:30,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:30,520 INFO L475 AbstractCegarLoop]: Abstraction has 33469 states and 49038 transitions. [2019-10-02 12:49:30,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:49:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 33469 states and 49038 transitions. [2019-10-02 12:49:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-02 12:49:30,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:30,569 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:30,569 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:30,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1536669876, now seen corresponding path program 1 times [2019-10-02 12:49:30,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:30,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:30,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:30,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:30,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-02 12:49:30,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:49:30,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:49:30,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:49:30,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:49:30,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:49:30,763 INFO L87 Difference]: Start difference. First operand 33469 states and 49038 transitions. Second operand 8 states. [2019-10-02 12:49:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:39,482 INFO L93 Difference]: Finished difference Result 101777 states and 154828 transitions. [2019-10-02 12:49:39,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:49:39,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 272 [2019-10-02 12:49:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:39,744 INFO L225 Difference]: With dead ends: 101777 [2019-10-02 12:49:39,745 INFO L226 Difference]: Without dead ends: 68397 [2019-10-02 12:49:39,810 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:49:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68397 states. [2019-10-02 12:49:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68397 to 63841. [2019-10-02 12:49:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63841 states. [2019-10-02 12:49:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63841 states to 63841 states and 96798 transitions. [2019-10-02 12:49:44,114 INFO L78 Accepts]: Start accepts. Automaton has 63841 states and 96798 transitions. Word has length 272 [2019-10-02 12:49:44,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:44,115 INFO L475 AbstractCegarLoop]: Abstraction has 63841 states and 96798 transitions. [2019-10-02 12:49:44,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:49:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 63841 states and 96798 transitions. [2019-10-02 12:49:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-02 12:49:44,193 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:44,194 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:44,194 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:44,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:44,194 INFO L82 PathProgramCache]: Analyzing trace with hash 313943810, now seen corresponding path program 1 times [2019-10-02 12:49:44,194 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:44,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:44,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:44,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:44,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:49:44,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:49:44,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:49:44,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:49:44,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:49:44,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:49:44,397 INFO L87 Difference]: Start difference. First operand 63841 states and 96798 transitions. Second operand 8 states. [2019-10-02 12:49:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:54,132 INFO L93 Difference]: Finished difference Result 194369 states and 306130 transitions. [2019-10-02 12:49:54,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:49:54,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 288 [2019-10-02 12:49:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:54,652 INFO L225 Difference]: With dead ends: 194369 [2019-10-02 12:49:54,652 INFO L226 Difference]: Without dead ends: 130617 [2019-10-02 12:49:54,792 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:49:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130617 states. [2019-10-02 12:50:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130617 to 120856. [2019-10-02 12:50:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120856 states. [2019-10-02 12:50:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120856 states to 120856 states and 190050 transitions. [2019-10-02 12:50:03,443 INFO L78 Accepts]: Start accepts. Automaton has 120856 states and 190050 transitions. Word has length 288 [2019-10-02 12:50:03,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:50:03,444 INFO L475 AbstractCegarLoop]: Abstraction has 120856 states and 190050 transitions. [2019-10-02 12:50:03,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:50:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 120856 states and 190050 transitions. [2019-10-02 12:50:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-10-02 12:50:03,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:50:03,629 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:50:03,630 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:50:03,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:50:03,630 INFO L82 PathProgramCache]: Analyzing trace with hash -754648841, now seen corresponding path program 1 times [2019-10-02 12:50:03,630 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:50:03,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:50:03,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:50:03,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:50:03,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:50:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:50:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 12:50:03,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:50:03,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:50:03,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:50:03,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:50:03,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:50:03,812 INFO L87 Difference]: Start difference. First operand 120856 states and 190050 transitions. Second operand 8 states. [2019-10-02 12:50:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:50:16,264 INFO L93 Difference]: Finished difference Result 339855 states and 517321 transitions. [2019-10-02 12:50:16,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:50:16,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 269 [2019-10-02 12:50:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:50:17,237 INFO L225 Difference]: With dead ends: 339855 [2019-10-02 12:50:17,237 INFO L226 Difference]: Without dead ends: 246810 [2019-10-02 12:50:17,442 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:50:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246810 states. [2019-10-02 12:50:32,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246810 to 232653. [2019-10-02 12:50:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232653 states. [2019-10-02 12:50:33,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232653 states to 232653 states and 369648 transitions. [2019-10-02 12:50:33,713 INFO L78 Accepts]: Start accepts. Automaton has 232653 states and 369648 transitions. Word has length 269 [2019-10-02 12:50:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:50:33,714 INFO L475 AbstractCegarLoop]: Abstraction has 232653 states and 369648 transitions. [2019-10-02 12:50:33,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:50:33,714 INFO L276 IsEmpty]: Start isEmpty. Operand 232653 states and 369648 transitions. [2019-10-02 12:50:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-02 12:50:34,094 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:50:34,094 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:50:34,095 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:50:34,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:50:34,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1287346663, now seen corresponding path program 1 times [2019-10-02 12:50:34,095 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:50:34,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:50:34,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:50:34,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:50:34,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:50:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:50:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 12:50:35,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:50:35,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 12:50:35,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:50:35,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:50:35,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:50:35,351 INFO L87 Difference]: Start difference. First operand 232653 states and 369648 transitions. Second operand 15 states. [2019-10-02 12:50:50,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:50:50,092 INFO L93 Difference]: Finished difference Result 394631 states and 588036 transitions. [2019-10-02 12:50:50,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 12:50:50,093 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 270 [2019-10-02 12:50:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:50:51,131 INFO L225 Difference]: With dead ends: 394631 [2019-10-02 12:50:51,131 INFO L226 Difference]: Without dead ends: 234668 [2019-10-02 12:50:51,378 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 12:50:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234668 states. [2019-10-02 12:51:02,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234668 to 212864. [2019-10-02 12:51:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212864 states. [2019-10-02 12:51:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212864 states to 212864 states and 342490 transitions. [2019-10-02 12:51:12,451 INFO L78 Accepts]: Start accepts. Automaton has 212864 states and 342490 transitions. Word has length 270 [2019-10-02 12:51:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:51:12,452 INFO L475 AbstractCegarLoop]: Abstraction has 212864 states and 342490 transitions. [2019-10-02 12:51:12,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:51:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 212864 states and 342490 transitions. [2019-10-02 12:51:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-02 12:51:12,788 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:51:12,788 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:51:12,789 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:51:12,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:51:12,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2123462879, now seen corresponding path program 1 times [2019-10-02 12:51:12,789 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:51:12,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:51:12,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:12,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:51:12,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:51:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:51:12,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:51:12,952 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:51:13,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:51:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:51:13,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 3146 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:51:13,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:51:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:51:13,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:51:13,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-10-02 12:51:13,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:51:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:51:13,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:51:13,708 INFO L87 Difference]: Start difference. First operand 212864 states and 342490 transitions. Second operand 13 states. [2019-10-02 12:51:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:51:29,253 INFO L93 Difference]: Finished difference Result 458798 states and 728069 transitions. [2019-10-02 12:51:29,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:51:29,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 270 [2019-10-02 12:51:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:51:30,008 INFO L225 Difference]: With dead ends: 458798 [2019-10-02 12:51:30,009 INFO L226 Difference]: Without dead ends: 245096 [2019-10-02 12:51:30,334 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:51:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245096 states. [2019-10-02 12:51:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245096 to 221784. [2019-10-02 12:51:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221784 states. [2019-10-02 12:51:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221784 states to 221784 states and 351613 transitions. [2019-10-02 12:51:52,145 INFO L78 Accepts]: Start accepts. Automaton has 221784 states and 351613 transitions. Word has length 270 [2019-10-02 12:51:52,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:51:52,146 INFO L475 AbstractCegarLoop]: Abstraction has 221784 states and 351613 transitions. [2019-10-02 12:51:52,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:51:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 221784 states and 351613 transitions. [2019-10-02 12:51:52,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-02 12:51:52,473 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:51:52,473 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:51:52,473 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:51:52,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:51:52,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1675199002, now seen corresponding path program 1 times [2019-10-02 12:51:52,474 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:51:52,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:51:52,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:52,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:51:52,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:51:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-02 12:51:52,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:51:52,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:51:52,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:51:52,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:51:52,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:51:52,605 INFO L87 Difference]: Start difference. First operand 221784 states and 351613 transitions. Second operand 3 states. [2019-10-02 12:52:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:05,959 INFO L93 Difference]: Finished difference Result 472272 states and 782597 transitions. [2019-10-02 12:52:05,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:52:05,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-10-02 12:52:05,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:06,865 INFO L225 Difference]: With dead ends: 472272 [2019-10-02 12:52:06,865 INFO L226 Difference]: Without dead ends: 250628 [2019-10-02 12:52:07,238 INFO L640 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-10-02 12:52:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250628 states. [2019-10-02 12:52:27,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250628 to 247549. [2019-10-02 12:52:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247549 states. [2019-10-02 12:52:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247549 states to 247549 states and 426338 transitions. [2019-10-02 12:52:29,223 INFO L78 Accepts]: Start accepts. Automaton has 247549 states and 426338 transitions. Word has length 279 [2019-10-02 12:52:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:29,224 INFO L475 AbstractCegarLoop]: Abstraction has 247549 states and 426338 transitions. [2019-10-02 12:52:29,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:52:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 247549 states and 426338 transitions. [2019-10-02 12:52:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 12:52:29,765 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:29,766 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:52:29,766 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:29,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:29,766 INFO L82 PathProgramCache]: Analyzing trace with hash 515152394, now seen corresponding path program 1 times [2019-10-02 12:52:29,766 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:29,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:29,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:29,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:29,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 12:52:29,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:29,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:52:29,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:52:29,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:52:29,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:52:29,955 INFO L87 Difference]: Start difference. First operand 247549 states and 426338 transitions. Second operand 6 states. [2019-10-02 12:52:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:53,448 INFO L93 Difference]: Finished difference Result 656946 states and 1068295 transitions. [2019-10-02 12:52:53,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:52:53,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 296 [2019-10-02 12:52:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:55,373 INFO L225 Difference]: With dead ends: 656946 [2019-10-02 12:52:55,373 INFO L226 Difference]: Without dead ends: 498268 [2019-10-02 12:52:56,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:52:57,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498268 states. [2019-10-02 12:53:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498268 to 496439. [2019-10-02 12:53:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496439 states. [2019-10-02 12:53:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496439 states to 496439 states and 854606 transitions. [2019-10-02 12:53:46,163 INFO L78 Accepts]: Start accepts. Automaton has 496439 states and 854606 transitions. Word has length 296 [2019-10-02 12:53:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:46,164 INFO L475 AbstractCegarLoop]: Abstraction has 496439 states and 854606 transitions. [2019-10-02 12:53:46,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:53:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 496439 states and 854606 transitions. [2019-10-02 12:53:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 12:53:58,981 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:58,981 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:58,982 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:58,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:58,982 INFO L82 PathProgramCache]: Analyzing trace with hash -976500575, now seen corresponding path program 1 times [2019-10-02 12:53:58,982 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:58,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:58,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:58,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:58,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-02 12:53:59,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:59,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-02 12:53:59,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 12:53:59,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 12:53:59,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:53:59,500 INFO L87 Difference]: Start difference. First operand 496439 states and 854606 transitions. Second operand 23 states. [2019-10-02 12:54:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:25,926 INFO L93 Difference]: Finished difference Result 610905 states and 1072103 transitions. [2019-10-02 12:54:25,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 12:54:25,927 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 297 [2019-10-02 12:54:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:28,170 INFO L225 Difference]: With dead ends: 610905 [2019-10-02 12:54:28,170 INFO L226 Difference]: Without dead ends: 594182 [2019-10-02 12:54:28,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=262, Invalid=3044, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 12:54:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594182 states. [2019-10-02 12:55:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594182 to 574474. [2019-10-02 12:55:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574474 states. [2019-10-02 12:55:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574474 states to 574474 states and 1023809 transitions. [2019-10-02 12:55:24,333 INFO L78 Accepts]: Start accepts. Automaton has 574474 states and 1023809 transitions. Word has length 297 [2019-10-02 12:55:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:24,333 INFO L475 AbstractCegarLoop]: Abstraction has 574474 states and 1023809 transitions. [2019-10-02 12:55:24,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 12:55:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 574474 states and 1023809 transitions. [2019-10-02 12:55:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 12:55:27,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:27,394 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:55:27,394 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:27,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:27,394 INFO L82 PathProgramCache]: Analyzing trace with hash 724992597, now seen corresponding path program 1 times [2019-10-02 12:55:27,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:27,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:27,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:27,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:27,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:55:27,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:27,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:55:27,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:55:27,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:55:27,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:55:27,556 INFO L87 Difference]: Start difference. First operand 574474 states and 1023809 transitions. Second operand 7 states. [2019-10-02 12:56:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:46,978 INFO L93 Difference]: Finished difference Result 1287071 states and 2492317 transitions. [2019-10-02 12:56:46,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:56:46,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 280 [2019-10-02 12:56:46,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:52,779 INFO L225 Difference]: With dead ends: 1287071 [2019-10-02 12:56:52,780 INFO L226 Difference]: Without dead ends: 1129670 [2019-10-02 12:56:54,170 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:56:54,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129670 states.