java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec6_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:53:39,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:53:39,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:53:39,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:53:39,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:53:39,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:53:39,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:53:39,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:53:39,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:53:39,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:53:39,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:53:39,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:53:39,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:53:39,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:53:39,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:53:39,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:53:39,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:53:39,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:53:39,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:53:39,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:53:39,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:53:39,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:53:39,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:53:39,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:53:39,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:53:39,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:53:39,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:53:39,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:53:39,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:53:39,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:53:39,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:53:39,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:53:39,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:53:39,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:53:39,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:53:39,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:53:39,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:53:39,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:53:39,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:53:39,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:53:39,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:53:39,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:53:39,768 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:53:39,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:53:39,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:53:39,768 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:53:39,769 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:53:39,769 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:53:39,770 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:53:39,770 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:53:39,770 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:53:39,770 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:53:39,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:53:39,771 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:53:39,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:53:39,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:53:39,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:53:39,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:53:39,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:53:39,772 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:53:39,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:53:39,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:53:39,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:53:39,773 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:53:39,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:53:39,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:53:39,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:53:39,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:53:39,774 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:53:39,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:53:39,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:53:39,775 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:53:39,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:53:39,818 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:53:39,821 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:53:39,822 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:53:39,822 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:53:39,823 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product21.cil.c [2019-10-03 02:53:39,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1911167cd/9dcf70dc0e984c348f7c0370782099b1/FLAGb7cca9794 [2019-10-03 02:53:40,597 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:53:40,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product21.cil.c [2019-10-03 02:53:40,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1911167cd/9dcf70dc0e984c348f7c0370782099b1/FLAGb7cca9794 [2019-10-03 02:53:40,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1911167cd/9dcf70dc0e984c348f7c0370782099b1 [2019-10-03 02:53:40,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:53:40,840 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:53:40,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:53:40,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:53:40,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:53:40,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:53:40" (1/1) ... [2019-10-03 02:53:40,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602e7f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:40, skipping insertion in model container [2019-10-03 02:53:40,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:53:40" (1/1) ... [2019-10-03 02:53:40,861 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:53:40,949 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:53:41,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:53:41,694 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:53:41,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:53:41,970 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:53:41,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:41 WrapperNode [2019-10-03 02:53:41,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:53:41,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:53:41,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:53:41,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:53:41,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:41" (1/1) ... [2019-10-03 02:53:41,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:41" (1/1) ... [2019-10-03 02:53:42,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:41" (1/1) ... [2019-10-03 02:53:42,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:41" (1/1) ... [2019-10-03 02:53:42,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:41" (1/1) ... [2019-10-03 02:53:42,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:41" (1/1) ... [2019-10-03 02:53:42,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:41" (1/1) ... [2019-10-03 02:53:42,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:53:42,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:53:42,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:53:42,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:53:42,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:41" (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-03 02:53:42,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:53:42,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:53:42,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:53:42,244 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:53:42,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-03 02:53:42,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-03 02:53:42,245 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:53:42,245 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:53:42,245 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:53:42,246 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:53:42,246 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:53:42,247 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:53:42,247 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:53:42,248 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:53:42,249 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-03 02:53:42,250 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:53:42,250 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:53:42,250 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-03 02:53:42,251 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-03 02:53:42,251 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:53:42,251 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:53:42,252 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:53:42,252 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:53:42,252 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:53:42,252 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:53:42,253 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:53:42,254 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:53:42,254 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:53:42,254 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-03 02:53:42,254 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-03 02:53:42,254 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:53:42,255 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:53:42,255 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:53:42,255 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:53:42,255 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:53:42,255 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:53:42,255 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:53:42,256 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:53:42,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:53:42,256 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:53:42,256 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:53:42,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:53:42,256 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:53:42,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:53:42,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:53:42,257 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:53:42,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:53:42,257 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:53:42,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:53:42,257 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:53:42,258 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:53:42,258 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:53:42,258 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:53:42,259 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:53:42,259 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:53:42,259 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:53:42,259 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:53:42,259 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:53:42,260 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:53:42,260 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:53:42,260 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:53:42,260 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:53:42,260 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:53:42,260 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:53:42,261 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:53:42,261 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:53:42,261 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:53:42,261 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:53:42,262 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:53:42,262 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:53:42,262 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:53:42,262 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:53:42,262 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:53:42,263 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:53:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:53:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:53:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:53:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:53:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:53:42,265 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:53:42,265 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:53:42,266 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:53:42,266 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:53:42,266 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-03 02:53:42,266 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-03 02:53:42,267 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:53:42,268 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:53:42,269 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:53:42,269 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:53:42,269 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:53:42,269 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:53:42,269 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:53:42,270 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:53:42,270 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:53:42,270 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:53:42,270 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:53:42,270 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:53:42,270 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:53:42,271 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:53:42,271 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:53:42,271 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:53:42,271 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:53:42,271 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:53:42,271 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:53:42,271 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:53:42,272 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:53:42,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:53:42,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:53:42,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:53:42,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:53:42,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:53:42,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:53:42,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:53:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:53:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:53:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:53:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:53:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:53:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:53:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:53:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:53:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:53:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:53:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:53:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-03 02:53:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-03 02:53:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:53:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:53:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:53:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:53:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:53:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:53:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:53:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:53:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:53:42,281 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:53:42,281 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:53:42,281 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:53:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:53:42,285 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:53:42,286 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:53:42,286 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:53:42,286 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:53:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:53:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:53:42,294 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:53:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:53:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:53:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:53:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:53:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:53:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:53:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:53:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:53:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:53:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:53:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:53:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-03 02:53:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-03 02:53:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:53:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-03 02:53:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-03 02:53:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-03 02:53:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:53:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:53:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:53:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:53:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:53:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:53:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:53:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:53:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:53:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:53:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:53:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:53:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:53:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:53:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:53:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:53:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:53:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:53:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:53:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:53:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:53:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:53:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:53:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:53:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:53:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:53:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:53:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:53:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:53:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-03 02:53:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:53:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-03 02:53:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:53:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:53:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:53:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:53:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:53:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:53:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:53:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:53:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:53:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:53:42,305 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:53:42,305 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:53:42,305 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:53:42,305 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:53:42,305 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:53:42,305 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:53:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:53:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:53:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:53:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:53:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:53:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:53:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:53:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:53:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:53:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:53:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:53:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:53:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:53:42,308 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:53:42,308 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:53:42,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:53:42,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:53:42,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:53:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:53:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:53:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:53:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:53:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:53:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:53:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:53:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:53:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:53:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:53:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:53:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:53:44,709 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:53:44,710 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:53:44,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:53:44 BoogieIcfgContainer [2019-10-03 02:53:44,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:53:44,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:53:44,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:53:44,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:53:44,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:53:40" (1/3) ... [2019-10-03 02:53:44,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5282d0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:53:44, skipping insertion in model container [2019-10-03 02:53:44,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:41" (2/3) ... [2019-10-03 02:53:44,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5282d0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:53:44, skipping insertion in model container [2019-10-03 02:53:44,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:53:44" (3/3) ... [2019-10-03 02:53:44,722 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product21.cil.c [2019-10-03 02:53:44,732 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:53:44,742 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:53:44,761 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:53:44,792 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:53:44,792 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:53:44,792 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:53:44,793 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:53:44,793 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:53:44,793 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:53:44,793 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:53:44,793 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:53:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states. [2019-10-03 02:53:44,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-03 02:53:44,855 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:44,856 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:53:44,859 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:44,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:44,866 INFO L82 PathProgramCache]: Analyzing trace with hash -818881657, now seen corresponding path program 1 times [2019-10-03 02:53:44,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:44,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:44,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:44,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:44,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:53:45,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:45,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:53:45,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:45,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:53:45,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:53:45,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:53:45,587 INFO L87 Difference]: Start difference. First operand 577 states. Second operand 2 states. [2019-10-03 02:53:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:45,645 INFO L93 Difference]: Finished difference Result 557 states and 759 transitions. [2019-10-03 02:53:45,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:53:45,647 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 185 [2019-10-03 02:53:45,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:45,670 INFO L225 Difference]: With dead ends: 557 [2019-10-03 02:53:45,670 INFO L226 Difference]: Without dead ends: 548 [2019-10-03 02:53:45,672 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-03 02:53:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-10-03 02:53:45,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-10-03 02:53:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-10-03 02:53:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 748 transitions. [2019-10-03 02:53:45,764 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 748 transitions. Word has length 185 [2019-10-03 02:53:45,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:45,766 INFO L475 AbstractCegarLoop]: Abstraction has 548 states and 748 transitions. [2019-10-03 02:53:45,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:53:45,767 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 748 transitions. [2019-10-03 02:53:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-03 02:53:45,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:45,777 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:53:45,778 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:45,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:45,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1630438931, now seen corresponding path program 1 times [2019-10-03 02:53:45,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:45,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:45,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:45,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:45,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:53:46,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:46,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:46,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:46,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:46,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:46,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:46,032 INFO L87 Difference]: Start difference. First operand 548 states and 748 transitions. Second operand 3 states. [2019-10-03 02:53:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:46,094 INFO L93 Difference]: Finished difference Result 551 states and 751 transitions. [2019-10-03 02:53:46,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:46,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-10-03 02:53:46,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:46,101 INFO L225 Difference]: With dead ends: 551 [2019-10-03 02:53:46,101 INFO L226 Difference]: Without dead ends: 551 [2019-10-03 02:53:46,104 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-03 02:53:46,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-03 02:53:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 550. [2019-10-03 02:53:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-03 02:53:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 750 transitions. [2019-10-03 02:53:46,146 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 750 transitions. Word has length 186 [2019-10-03 02:53:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:46,147 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 750 transitions. [2019-10-03 02:53:46,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 750 transitions. [2019-10-03 02:53:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-03 02:53:46,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:46,152 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:53:46,152 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:46,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:46,153 INFO L82 PathProgramCache]: Analyzing trace with hash -160158177, now seen corresponding path program 1 times [2019-10-03 02:53:46,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:46,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:46,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:46,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:46,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:53:46,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:46,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:46,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:46,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:46,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:46,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:46,405 INFO L87 Difference]: Start difference. First operand 550 states and 750 transitions. Second operand 3 states. [2019-10-03 02:53:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:46,462 INFO L93 Difference]: Finished difference Result 593 states and 823 transitions. [2019-10-03 02:53:46,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:46,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-03 02:53:46,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:46,477 INFO L225 Difference]: With dead ends: 593 [2019-10-03 02:53:46,477 INFO L226 Difference]: Without dead ends: 593 [2019-10-03 02:53:46,477 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-03 02:53:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-03 02:53:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 592. [2019-10-03 02:53:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-03 02:53:46,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 822 transitions. [2019-10-03 02:53:46,535 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 822 transitions. Word has length 192 [2019-10-03 02:53:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:46,537 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 822 transitions. [2019-10-03 02:53:46,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 822 transitions. [2019-10-03 02:53:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-03 02:53:46,551 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:46,552 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:53:46,552 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:46,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:46,553 INFO L82 PathProgramCache]: Analyzing trace with hash 245663473, now seen corresponding path program 1 times [2019-10-03 02:53:46,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:46,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:46,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:46,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:53:47,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:47,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:53:47,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:47,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:53:47,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:53:47,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:53:47,007 INFO L87 Difference]: Start difference. First operand 592 states and 822 transitions. Second operand 11 states. [2019-10-03 02:53:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:53,578 INFO L93 Difference]: Finished difference Result 2611 states and 3697 transitions. [2019-10-03 02:53:53,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-03 02:53:53,583 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 193 [2019-10-03 02:53:53,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:53,605 INFO L225 Difference]: With dead ends: 2611 [2019-10-03 02:53:53,605 INFO L226 Difference]: Without dead ends: 2611 [2019-10-03 02:53:53,606 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 02:53:53,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2019-10-03 02:53:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2590. [2019-10-03 02:53:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2019-10-03 02:53:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 3623 transitions. [2019-10-03 02:53:53,738 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 3623 transitions. Word has length 193 [2019-10-03 02:53:53,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:53,739 INFO L475 AbstractCegarLoop]: Abstraction has 2590 states and 3623 transitions. [2019-10-03 02:53:53,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:53:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 3623 transitions. [2019-10-03 02:53:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-03 02:53:53,743 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:53,743 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:53:53,744 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:53,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash 5932126, now seen corresponding path program 1 times [2019-10-03 02:53:53,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:53,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:53,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:53,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:53,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:53:54,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:54,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-03 02:53:54,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:54,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 02:53:54,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 02:53:54,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-03 02:53:54,196 INFO L87 Difference]: Start difference. First operand 2590 states and 3623 transitions. Second operand 18 states. [2019-10-03 02:53:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:54,793 INFO L93 Difference]: Finished difference Result 2625 states and 3731 transitions. [2019-10-03 02:53:54,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 02:53:54,794 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 194 [2019-10-03 02:53:54,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:54,812 INFO L225 Difference]: With dead ends: 2625 [2019-10-03 02:53:54,813 INFO L226 Difference]: Without dead ends: 2607 [2019-10-03 02:53:54,813 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-03 02:53:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2019-10-03 02:53:54,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2605. [2019-10-03 02:53:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2019-10-03 02:53:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 3628 transitions. [2019-10-03 02:53:54,909 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 3628 transitions. Word has length 194 [2019-10-03 02:53:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:54,912 INFO L475 AbstractCegarLoop]: Abstraction has 2605 states and 3628 transitions. [2019-10-03 02:53:54,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 02:53:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3628 transitions. [2019-10-03 02:53:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-03 02:53:54,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:54,916 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:53:54,917 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:54,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:54,917 INFO L82 PathProgramCache]: Analyzing trace with hash -129887982, now seen corresponding path program 1 times [2019-10-03 02:53:54,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:54,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:54,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:54,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:54,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:53:55,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:55,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:53:55,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:55,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:53:55,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:53:55,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:53:55,181 INFO L87 Difference]: Start difference. First operand 2605 states and 3628 transitions. Second operand 6 states. [2019-10-03 02:53:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:55,837 INFO L93 Difference]: Finished difference Result 5297 states and 7496 transitions. [2019-10-03 02:53:55,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:53:55,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-10-03 02:53:55,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:55,880 INFO L225 Difference]: With dead ends: 5297 [2019-10-03 02:53:55,880 INFO L226 Difference]: Without dead ends: 5297 [2019-10-03 02:53:55,881 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-03 02:53:55,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5297 states. [2019-10-03 02:53:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5297 to 5226. [2019-10-03 02:53:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5226 states. [2019-10-03 02:53:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 7370 transitions. [2019-10-03 02:53:56,120 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 7370 transitions. Word has length 203 [2019-10-03 02:53:56,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:56,123 INFO L475 AbstractCegarLoop]: Abstraction has 5226 states and 7370 transitions. [2019-10-03 02:53:56,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:53:56,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 7370 transitions. [2019-10-03 02:53:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-03 02:53:56,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:56,130 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:53:56,131 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:56,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:56,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1737216113, now seen corresponding path program 1 times [2019-10-03 02:53:56,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:56,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:56,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:56,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:56,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:53:56,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:56,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:53:56,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:56,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:53:56,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:53:56,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:53:56,453 INFO L87 Difference]: Start difference. First operand 5226 states and 7370 transitions. Second operand 11 states. [2019-10-03 02:53:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:56,911 INFO L93 Difference]: Finished difference Result 5280 states and 7424 transitions. [2019-10-03 02:53:56,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:53:56,912 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 204 [2019-10-03 02:53:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:56,950 INFO L225 Difference]: With dead ends: 5280 [2019-10-03 02:53:56,951 INFO L226 Difference]: Without dead ends: 5280 [2019-10-03 02:53:56,951 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-03 02:53:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2019-10-03 02:53:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 5262. [2019-10-03 02:53:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5262 states. [2019-10-03 02:53:57,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5262 states to 5262 states and 7406 transitions. [2019-10-03 02:53:57,147 INFO L78 Accepts]: Start accepts. Automaton has 5262 states and 7406 transitions. Word has length 204 [2019-10-03 02:53:57,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:57,148 INFO L475 AbstractCegarLoop]: Abstraction has 5262 states and 7406 transitions. [2019-10-03 02:53:57,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:53:57,148 INFO L276 IsEmpty]: Start isEmpty. Operand 5262 states and 7406 transitions. [2019-10-03 02:53:57,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-03 02:53:57,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:57,154 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:53:57,154 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:57,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:57,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1970975064, now seen corresponding path program 1 times [2019-10-03 02:53:57,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:57,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:57,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:57,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:57,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:53:57,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:57,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:53:57,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:57,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:53:57,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:53:57,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:53:57,360 INFO L87 Difference]: Start difference. First operand 5262 states and 7406 transitions. Second operand 5 states. [2019-10-03 02:53:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:58,677 INFO L93 Difference]: Finished difference Result 14972 states and 21019 transitions. [2019-10-03 02:53:58,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:53:58,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-10-03 02:53:58,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:58,771 INFO L225 Difference]: With dead ends: 14972 [2019-10-03 02:53:58,771 INFO L226 Difference]: Without dead ends: 14972 [2019-10-03 02:53:58,772 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-03 02:53:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14972 states. [2019-10-03 02:53:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14972 to 14860. [2019-10-03 02:53:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14860 states. [2019-10-03 02:53:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14860 states to 14860 states and 20886 transitions. [2019-10-03 02:53:59,250 INFO L78 Accepts]: Start accepts. Automaton has 14860 states and 20886 transitions. Word has length 204 [2019-10-03 02:53:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:59,250 INFO L475 AbstractCegarLoop]: Abstraction has 14860 states and 20886 transitions. [2019-10-03 02:53:59,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:53:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 14860 states and 20886 transitions. [2019-10-03 02:53:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-03 02:53:59,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:59,265 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:53:59,265 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:59,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:59,266 INFO L82 PathProgramCache]: Analyzing trace with hash -705130534, now seen corresponding path program 1 times [2019-10-03 02:53:59,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:59,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:59,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:59,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:59,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:53:59,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:59,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:59,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:59,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:59,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:59,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:59,448 INFO L87 Difference]: Start difference. First operand 14860 states and 20886 transitions. Second operand 3 states. [2019-10-03 02:53:59,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:59,615 INFO L93 Difference]: Finished difference Result 15204 states and 21511 transitions. [2019-10-03 02:53:59,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:59,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-03 02:53:59,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:59,697 INFO L225 Difference]: With dead ends: 15204 [2019-10-03 02:53:59,697 INFO L226 Difference]: Without dead ends: 15204 [2019-10-03 02:53:59,698 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-03 02:53:59,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15204 states. [2019-10-03 02:54:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15204 to 15200. [2019-10-03 02:54:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15200 states. [2019-10-03 02:54:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15200 states to 15200 states and 21507 transitions. [2019-10-03 02:54:00,129 INFO L78 Accepts]: Start accepts. Automaton has 15200 states and 21507 transitions. Word has length 233 [2019-10-03 02:54:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:00,129 INFO L475 AbstractCegarLoop]: Abstraction has 15200 states and 21507 transitions. [2019-10-03 02:54:00,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 15200 states and 21507 transitions. [2019-10-03 02:54:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-03 02:54:00,145 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:00,146 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:54:00,146 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:00,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:00,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1132130108, now seen corresponding path program 1 times [2019-10-03 02:54:00,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:00,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:00,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:00,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:00,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:00,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:00,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:00,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:00,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:00,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:00,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:00,349 INFO L87 Difference]: Start difference. First operand 15200 states and 21507 transitions. Second operand 3 states. [2019-10-03 02:54:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:00,430 INFO L93 Difference]: Finished difference Result 15844 states and 22681 transitions. [2019-10-03 02:54:00,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:00,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-10-03 02:54:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:00,490 INFO L225 Difference]: With dead ends: 15844 [2019-10-03 02:54:00,491 INFO L226 Difference]: Without dead ends: 15844 [2019-10-03 02:54:00,491 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-03 02:54:00,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15844 states. [2019-10-03 02:54:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15844 to 15840. [2019-10-03 02:54:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15840 states. [2019-10-03 02:54:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15840 states to 15840 states and 22677 transitions. [2019-10-03 02:54:01,078 INFO L78 Accepts]: Start accepts. Automaton has 15840 states and 22677 transitions. Word has length 240 [2019-10-03 02:54:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:01,079 INFO L475 AbstractCegarLoop]: Abstraction has 15840 states and 22677 transitions. [2019-10-03 02:54:01,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 15840 states and 22677 transitions. [2019-10-03 02:54:01,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-03 02:54:01,097 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:01,097 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-03 02:54:01,097 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:01,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:01,098 INFO L82 PathProgramCache]: Analyzing trace with hash 722288488, now seen corresponding path program 1 times [2019-10-03 02:54:01,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:01,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:01,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:01,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:01,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:01,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:01,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:01,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:01,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:01,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:01,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:01,408 INFO L87 Difference]: Start difference. First operand 15840 states and 22677 transitions. Second operand 8 states. [2019-10-03 02:54:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:07,005 INFO L93 Difference]: Finished difference Result 32111 states and 47073 transitions. [2019-10-03 02:54:07,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:07,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 241 [2019-10-03 02:54:07,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:07,129 INFO L225 Difference]: With dead ends: 32111 [2019-10-03 02:54:07,129 INFO L226 Difference]: Without dead ends: 32111 [2019-10-03 02:54:07,130 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-03 02:54:07,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32111 states. [2019-10-03 02:54:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32111 to 18256. [2019-10-03 02:54:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18256 states. [2019-10-03 02:54:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18256 states to 18256 states and 27453 transitions. [2019-10-03 02:54:07,786 INFO L78 Accepts]: Start accepts. Automaton has 18256 states and 27453 transitions. Word has length 241 [2019-10-03 02:54:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:07,787 INFO L475 AbstractCegarLoop]: Abstraction has 18256 states and 27453 transitions. [2019-10-03 02:54:07,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 18256 states and 27453 transitions. [2019-10-03 02:54:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-03 02:54:07,829 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:07,829 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:54:07,829 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:07,830 INFO L82 PathProgramCache]: Analyzing trace with hash -229240649, now seen corresponding path program 1 times [2019-10-03 02:54:07,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:07,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:07,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:07,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:07,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:08,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:08,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:08,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:08,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:08,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:08,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:08,115 INFO L87 Difference]: Start difference. First operand 18256 states and 27453 transitions. Second operand 8 states. [2019-10-03 02:54:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:13,128 INFO L93 Difference]: Finished difference Result 37479 states and 58529 transitions. [2019-10-03 02:54:13,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:13,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-10-03 02:54:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:13,279 INFO L225 Difference]: With dead ends: 37479 [2019-10-03 02:54:13,279 INFO L226 Difference]: Without dead ends: 37479 [2019-10-03 02:54:13,279 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-03 02:54:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37479 states. [2019-10-03 02:54:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37479 to 23208. [2019-10-03 02:54:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23208 states. [2019-10-03 02:54:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23208 states to 23208 states and 37845 transitions. [2019-10-03 02:54:15,227 INFO L78 Accepts]: Start accepts. Automaton has 23208 states and 37845 transitions. Word has length 242 [2019-10-03 02:54:15,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:15,227 INFO L475 AbstractCegarLoop]: Abstraction has 23208 states and 37845 transitions. [2019-10-03 02:54:15,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 23208 states and 37845 transitions. [2019-10-03 02:54:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-03 02:54:15,303 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:15,303 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:54:15,303 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:15,304 INFO L82 PathProgramCache]: Analyzing trace with hash 361328068, now seen corresponding path program 1 times [2019-10-03 02:54:15,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:15,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:15,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:15,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:15,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:15,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:15,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:15,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:15,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:15,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:15,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:15,557 INFO L87 Difference]: Start difference. First operand 23208 states and 37845 transitions. Second operand 8 states. [2019-10-03 02:54:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:21,614 INFO L93 Difference]: Finished difference Result 48367 states and 83077 transitions. [2019-10-03 02:54:21,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:21,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 243 [2019-10-03 02:54:21,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:21,887 INFO L225 Difference]: With dead ends: 48367 [2019-10-03 02:54:21,887 INFO L226 Difference]: Without dead ends: 48367 [2019-10-03 02:54:21,888 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-03 02:54:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48367 states. [2019-10-03 02:54:22,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48367 to 33240. [2019-10-03 02:54:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33240 states. [2019-10-03 02:54:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33240 states to 33240 states and 60169 transitions. [2019-10-03 02:54:23,073 INFO L78 Accepts]: Start accepts. Automaton has 33240 states and 60169 transitions. Word has length 243 [2019-10-03 02:54:23,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:23,073 INFO L475 AbstractCegarLoop]: Abstraction has 33240 states and 60169 transitions. [2019-10-03 02:54:23,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 33240 states and 60169 transitions. [2019-10-03 02:54:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-03 02:54:23,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:23,161 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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-03 02:54:23,162 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:23,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:23,162 INFO L82 PathProgramCache]: Analyzing trace with hash -815071318, now seen corresponding path program 1 times [2019-10-03 02:54:23,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:23,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:23,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:23,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:23,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-03 02:54:23,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:23,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:54:23,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:23,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:54:23,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:54:23,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:54:23,599 INFO L87 Difference]: Start difference. First operand 33240 states and 60169 transitions. Second operand 11 states. [2019-10-03 02:54:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:24,716 INFO L93 Difference]: Finished difference Result 47206 states and 81412 transitions. [2019-10-03 02:54:24,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:54:24,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 258 [2019-10-03 02:54:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:24,947 INFO L225 Difference]: With dead ends: 47206 [2019-10-03 02:54:24,947 INFO L226 Difference]: Without dead ends: 47170 [2019-10-03 02:54:24,948 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-10-03 02:54:25,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47170 states. [2019-10-03 02:54:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47170 to 46542. [2019-10-03 02:54:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46542 states. [2019-10-03 02:54:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46542 states to 46542 states and 80241 transitions. [2019-10-03 02:54:26,309 INFO L78 Accepts]: Start accepts. Automaton has 46542 states and 80241 transitions. Word has length 258 [2019-10-03 02:54:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:26,310 INFO L475 AbstractCegarLoop]: Abstraction has 46542 states and 80241 transitions. [2019-10-03 02:54:26,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:54:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 46542 states and 80241 transitions. [2019-10-03 02:54:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-03 02:54:27,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:27,983 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:54:27,983 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:27,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:27,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1801130968, now seen corresponding path program 1 times [2019-10-03 02:54:27,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:27,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:27,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:27,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:27,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:54:28,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:28,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:28,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:28,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:28,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:28,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:28,172 INFO L87 Difference]: Start difference. First operand 46542 states and 80241 transitions. Second operand 3 states. [2019-10-03 02:54:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:28,474 INFO L93 Difference]: Finished difference Result 56402 states and 103925 transitions. [2019-10-03 02:54:28,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:28,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2019-10-03 02:54:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:28,771 INFO L225 Difference]: With dead ends: 56402 [2019-10-03 02:54:28,771 INFO L226 Difference]: Without dead ends: 56402 [2019-10-03 02:54:28,774 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-03 02:54:28,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56402 states. [2019-10-03 02:54:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56402 to 56398. [2019-10-03 02:54:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56398 states. [2019-10-03 02:54:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56398 states to 56398 states and 103921 transitions. [2019-10-03 02:54:30,374 INFO L78 Accepts]: Start accepts. Automaton has 56398 states and 103921 transitions. Word has length 243 [2019-10-03 02:54:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:30,375 INFO L475 AbstractCegarLoop]: Abstraction has 56398 states and 103921 transitions. [2019-10-03 02:54:30,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 56398 states and 103921 transitions. [2019-10-03 02:54:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-03 02:54:30,570 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:30,570 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-03 02:54:30,570 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:30,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1347042441, now seen corresponding path program 1 times [2019-10-03 02:54:30,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:30,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:30,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:30,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:30,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:54:30,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:30,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:54:30,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:30,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:54:30,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:54:30,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:54:30,796 INFO L87 Difference]: Start difference. First operand 56398 states and 103921 transitions. Second operand 12 states. [2019-10-03 02:54:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:31,328 INFO L93 Difference]: Finished difference Result 56358 states and 103741 transitions. [2019-10-03 02:54:31,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:54:31,328 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 242 [2019-10-03 02:54:31,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:31,599 INFO L225 Difference]: With dead ends: 56358 [2019-10-03 02:54:31,600 INFO L226 Difference]: Without dead ends: 56358 [2019-10-03 02:54:31,600 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:54:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56358 states. [2019-10-03 02:54:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56358 to 56358. [2019-10-03 02:54:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56358 states. [2019-10-03 02:54:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56358 states to 56358 states and 103741 transitions. [2019-10-03 02:54:33,453 INFO L78 Accepts]: Start accepts. Automaton has 56358 states and 103741 transitions. Word has length 242 [2019-10-03 02:54:33,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:33,454 INFO L475 AbstractCegarLoop]: Abstraction has 56358 states and 103741 transitions. [2019-10-03 02:54:33,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:54:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 56358 states and 103741 transitions. [2019-10-03 02:54:33,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-03 02:54:33,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:33,567 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:54:33,567 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:33,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash 788552935, now seen corresponding path program 1 times [2019-10-03 02:54:33,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:33,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:33,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:33,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:33,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-03 02:54:35,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:54:35,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:54:35,120 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 249 with the following transitions: [2019-10-03 02:54:35,123 INFO L207 CegarAbsIntRunner]: [72], [75], [85], [105], [108], [109], [112], [122], [123], [139], [142], [151], [152], [155], [156], [157], [159], [241], [244], [250], [269], [271], [275], [278], [279], [280], [283], [289], [313], [316], [325], [346], [348], [349], [352], [362], [365], [367], [370], [372], [374], [394], [397], [406], [507], [510], [520], [582], [584], [585], [586], [604], [607], [621], [624], [627], [641], [670], [672], [674], [677], [678], [689], [693], [696], [698], [722], [726], [729], [737], [740], [765], [799], [808], [812], [814], [816], [819], [826], [833], [836], [841], [845], [852], [859], [862], [864], [1048], [1051], [1054], [1098], [1099], [1102], [1105], [1108], [1152], [1153], [1155], [1172], [1194], [1205], [1208], [1209], [1212], [1215], [1246], [1247], [1249], [1251], [1254], [1264], [1266], [1335], [1338], [1344], [1379], [1382], [1396], [1404], [1407], [1416], [1432], [1435], [1437], [1439], [1441], [1446], [1504], [1506], [1507], [1635], [1637], [1639], [1641], [1642], [1666], [1667], [1668], [1669], [1670], [1671], [1672], [1682], [1683], [1684], [1685], [1686], [1687], [1690], [1691], [1692], [1693], [1694], [1696], [1697], [1698], [1699], [1714], [1715], [1716], [1717], [1718], [1719], [1742], [1743], [1758], [1759], [1760], [1761], [1762], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1774], [1775], [1776], [1777], [1786], [1808], [1809], [1824], [1826], [1827], [1844], [1846], [1847], [1848], [1849], [1850], [1851], [1852], [1853], [1854], [1855], [1856], [1857], [1858], [1860], [1861], [1862], [1870], [1871], [1872], [1873], [1874], [1875], [1876], [1878], [1879], [1894], [1895], [1896], [1897], [1898], [1899], [1900], [1901], [1902] [2019-10-03 02:54:35,166 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:54:35,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:54:35,276 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:54:35,278 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 194 root evaluator evaluations with a maximum evaluation depth of 0. Performed 194 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 382 variables. [2019-10-03 02:54:35,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:35,281 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:54:35,356 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:54:35,356 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:54:35,362 INFO L420 sIntCurrentIteration]: We unified 247 AI predicates to 247 [2019-10-03 02:54:35,362 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:54:35,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:54:35,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [50] total 50 [2019-10-03 02:54:35,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:35,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:54:35,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:54:35,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:54:35,364 INFO L87 Difference]: Start difference. First operand 56358 states and 103741 transitions. Second operand 2 states. [2019-10-03 02:54:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:35,365 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:54:35,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:54:35,365 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 248 [2019-10-03 02:54:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:35,366 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:54:35,366 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:54:35,366 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 247 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-03 02:54:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:54:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:54:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:54:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:54:35,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2019-10-03 02:54:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:35,367 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:54:35,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:54:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:54:35,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:54:35,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:54:35 BoogieIcfgContainer [2019-10-03 02:54:35,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:54:35,379 INFO L168 Benchmark]: Toolchain (without parser) took 54537.50 ms. Allocated memory was 132.6 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 85.3 MB in the beginning and 405.0 MB in the end (delta: -319.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-10-03 02:54:35,381 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:54:35,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1129.60 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 85.1 MB in the beginning and 130.4 MB in the end (delta: -45.3 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:35,385 INFO L168 Benchmark]: Boogie Preprocessor took 177.42 ms. Allocated memory is still 199.8 MB. Free memory was 130.4 MB in the beginning and 121.7 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:35,386 INFO L168 Benchmark]: RCFGBuilder took 2562.94 ms. Allocated memory was 199.8 MB in the beginning and 266.3 MB in the end (delta: 66.6 MB). Free memory was 121.0 MB in the beginning and 155.3 MB in the end (delta: -34.3 MB). Peak memory consumption was 82.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:35,387 INFO L168 Benchmark]: TraceAbstraction took 50663.45 ms. Allocated memory was 266.3 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 155.3 MB in the beginning and 405.0 MB in the end (delta: -249.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-10-03 02:54:35,392 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1129.60 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 85.1 MB in the beginning and 130.4 MB in the end (delta: -45.3 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 177.42 ms. Allocated memory is still 199.8 MB. Free memory was 130.4 MB in the beginning and 121.7 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2562.94 ms. Allocated memory was 199.8 MB in the beginning and 266.3 MB in the end (delta: 66.6 MB). Free memory was 121.0 MB in the beginning and 155.3 MB in the end (delta: -34.3 MB). Peak memory consumption was 82.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50663.45 ms. Allocated memory was 266.3 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 155.3 MB in the beginning and 405.0 MB in the end (delta: -249.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2587]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 113 procedures, 778 locations, 1 error locations. SAFE Result, 50.5s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 30.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14059 SDtfs, 11612 SDslu, 53460 SDs, 0 SdLazy, 18708 SolverSat, 3381 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 482 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56398occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.0242914979757085 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 10.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 44119 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 3751 NumberOfCodeBlocks, 3751 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3734 ConstructedInterpolants, 0 QuantifiedInterpolants, 1234061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 634/636 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...