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_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:53:36,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:53:36,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:53:36,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:53:36,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:53:36,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:53:36,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:53:36,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:53:36,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:53:36,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:53:36,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:53:36,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:53:36,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:53:36,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:53:36,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:53:36,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:53:36,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:53:36,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:53:36,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:53:36,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:53:36,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:53:36,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:53:36,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:53:36,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:53:36,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:53:36,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:53:36,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:53:36,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:53:36,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:53:36,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:53:36,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:53:36,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:53:36,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:53:36,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:53:36,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:53:36,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:53:36,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:53:36,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:53:36,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:53:36,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:53:36,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:53:36,896 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:36,917 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:53:36,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:53:36,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:53:36,918 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:53:36,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:53:36,919 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:53:36,919 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:53:36,919 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:53:36,919 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:53:36,920 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:53:36,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:53:36,921 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:53:36,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:53:36,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:53:36,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:53:36,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:53:36,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:53:36,922 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:53:36,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:53:36,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:53:36,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:53:36,923 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:53:36,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:53:36,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:53:36,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:53:36,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:53:36,924 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:53:36,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:53:36,925 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:53:36,925 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:53:36,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:53:36,988 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:53:36,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:53:36,994 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:53:36,995 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:53:36,996 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product20.cil.c [2019-10-03 02:53:37,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bdd7de22/33ae629e129342dc8277ee365c217772/FLAG535ec44e4 [2019-10-03 02:53:37,698 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:53:37,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product20.cil.c [2019-10-03 02:53:37,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bdd7de22/33ae629e129342dc8277ee365c217772/FLAG535ec44e4 [2019-10-03 02:53:37,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bdd7de22/33ae629e129342dc8277ee365c217772 [2019-10-03 02:53:37,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:53:37,853 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:53:37,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:53:37,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:53:37,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:53:37,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:53:37" (1/1) ... [2019-10-03 02:53:37,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18048b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:37, skipping insertion in model container [2019-10-03 02:53:37,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:53:37" (1/1) ... [2019-10-03 02:53:37,869 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:53:37,957 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:53:38,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:53:38,743 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:53:38,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:53:38,966 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:53:38,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:38 WrapperNode [2019-10-03 02:53:38,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:53:38,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:53:38,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:53:38,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:53:38,982 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:38" (1/1) ... [2019-10-03 02:53:38,982 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:38" (1/1) ... [2019-10-03 02:53:39,015 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:38" (1/1) ... [2019-10-03 02:53:39,015 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:38" (1/1) ... [2019-10-03 02:53:39,075 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:38" (1/1) ... [2019-10-03 02:53:39,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:38" (1/1) ... [2019-10-03 02:53:39,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:38" (1/1) ... [2019-10-03 02:53:39,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:53:39,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:53:39,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:53:39,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:53:39,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:38" (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:39,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:53:39,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:53:39,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:53:39,237 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:53:39,237 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:53:39,238 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:53:39,238 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:53:39,238 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:53:39,238 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:53:39,238 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:53:39,239 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:53:39,239 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:53:39,239 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:53:39,239 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:53:39,240 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:53:39,240 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:53:39,240 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:53:39,240 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:53:39,241 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:53:39,241 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:53:39,241 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:53:39,241 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:53:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:53:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:53:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:53:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:53:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:53:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:53:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:53:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:53:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:53:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:53:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:53:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:53:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:53:39,244 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:53:39,244 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:53:39,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:53:39,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:53:39,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:53:39,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:53:39,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:53:39,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:53:39,245 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:53:39,245 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:53:39,245 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:53:39,245 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:53:39,245 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:53:39,246 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:53:39,246 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:53:39,246 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:53:39,246 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:53:39,246 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:53:39,246 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:53:39,247 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:53:39,247 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:53:39,247 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:53:39,247 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:53:39,247 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:53:39,247 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:53:39,247 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:53:39,248 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:53:39,248 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:53:39,248 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:53:39,248 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-03 02:53:39,248 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-03 02:53:39,248 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:53:39,249 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:53:39,249 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:53:39,249 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:53:39,249 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:53:39,249 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:53:39,249 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:53:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:53:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:53:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:53:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:53:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:53:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:53:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:53:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:53:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:53:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:53:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:53:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:53:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:53:39,252 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-03 02:53:39,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:53:39,252 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:53:39,252 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:53:39,252 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:53:39,252 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:53:39,253 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:53:39,253 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-03 02:53:39,253 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-03 02:53:39,253 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:53:39,253 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:53:39,253 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:53:39,254 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:53:39,254 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:53:39,254 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:53:39,254 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:53:39,254 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:53:39,254 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:53:39,254 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:53:39,255 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-03 02:53:39,255 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:53:39,255 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:53:39,255 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:53:39,255 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:53:39,255 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:53:39,255 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:53:39,256 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:53:39,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:53:39,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:53:39,256 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:53:39,256 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:53:39,256 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:53:39,256 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:53:39,257 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:53:39,257 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:53:39,257 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:53:39,257 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:53:39,257 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:53:39,257 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:53:39,258 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-03 02:53:39,258 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:53:39,258 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:53:39,258 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:53:39,258 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:53:39,258 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:53:39,259 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:53:39,259 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:53:39,259 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:53:39,259 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:53:39,259 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:53:39,259 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:53:39,259 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:53:39,260 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:53:39,260 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:53:39,260 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:53:39,260 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:53:39,260 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:53:39,260 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:53:39,261 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:53:39,261 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:53:39,261 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:53:39,261 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:53:39,261 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:53:39,261 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:53:39,262 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:53:39,262 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:53:39,262 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:53:39,262 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:53:39,262 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:53:39,262 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:53:39,262 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:53:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:53:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:53:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:53:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:53:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:53:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:53:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:53:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:53:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:53:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:53:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:53:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:53:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:53:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:53:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:53:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:53:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:53:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:53:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:53:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:53:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:53:39,266 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:53:39,266 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:53:39,266 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:53:39,266 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:53:39,266 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:53:39,266 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:53:39,266 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:53:39,267 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:53:39,267 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:53:39,267 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:53:39,267 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:53:39,267 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:53:39,267 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:53:39,267 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:53:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:53:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:53:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:53:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:53:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:53:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:53:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:53:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:53:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:53:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-03 02:53:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-03 02:53:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:53:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:53:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:53:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:53:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:53:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:53:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:53:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:53:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:53:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:53:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:53:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:53:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:53:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:53:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:53:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:53:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:53:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:53:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:53:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:53:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:53:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:53:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:53:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:53:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-03 02:53:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:53:39,274 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:53:39,274 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-03 02:53:39,274 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-03 02:53:39,274 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:53:39,274 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:53:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:53:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:53:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:53:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:53:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:53:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:53:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:53:41,468 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:53:41,468 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:53:41,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:53:41 BoogieIcfgContainer [2019-10-03 02:53:41,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:53:41,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:53:41,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:53:41,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:53:41,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:53:37" (1/3) ... [2019-10-03 02:53:41,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684149c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:53:41, skipping insertion in model container [2019-10-03 02:53:41,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:38" (2/3) ... [2019-10-03 02:53:41,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684149c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:53:41, skipping insertion in model container [2019-10-03 02:53:41,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:53:41" (3/3) ... [2019-10-03 02:53:41,484 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product20.cil.c [2019-10-03 02:53:41,495 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:53:41,513 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:53:41,532 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:53:41,568 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:53:41,568 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:53:41,568 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:53:41,568 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:53:41,569 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:53:41,569 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:53:41,569 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:53:41,569 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:53:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states. [2019-10-03 02:53:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-03 02:53:41,655 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:41,658 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:41,662 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:41,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:41,676 INFO L82 PathProgramCache]: Analyzing trace with hash 493567878, now seen corresponding path program 1 times [2019-10-03 02:53:41,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:41,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:41,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:41,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:41,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:42,413 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:42,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:42,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:53:42,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:42,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:53:42,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:53:42,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:53:42,442 INFO L87 Difference]: Start difference. First operand 567 states. Second operand 2 states. [2019-10-03 02:53:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:42,497 INFO L93 Difference]: Finished difference Result 523 states and 718 transitions. [2019-10-03 02:53:42,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:53:42,499 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 185 [2019-10-03 02:53:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:42,523 INFO L225 Difference]: With dead ends: 523 [2019-10-03 02:53:42,523 INFO L226 Difference]: Without dead ends: 514 [2019-10-03 02:53:42,525 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:42,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-10-03 02:53:42,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2019-10-03 02:53:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-10-03 02:53:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 707 transitions. [2019-10-03 02:53:42,633 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 707 transitions. Word has length 185 [2019-10-03 02:53:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:42,640 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 707 transitions. [2019-10-03 02:53:42,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:53:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 707 transitions. [2019-10-03 02:53:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-03 02:53:42,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:42,649 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:42,650 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:42,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:42,652 INFO L82 PathProgramCache]: Analyzing trace with hash 532061428, now seen corresponding path program 1 times [2019-10-03 02:53:42,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:42,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:42,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:42,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:42,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:42,924 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:42,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:42,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:42,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:42,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:42,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:42,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:42,928 INFO L87 Difference]: Start difference. First operand 514 states and 707 transitions. Second operand 3 states. [2019-10-03 02:53:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:42,969 INFO L93 Difference]: Finished difference Result 517 states and 710 transitions. [2019-10-03 02:53:42,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:42,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-10-03 02:53:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:42,977 INFO L225 Difference]: With dead ends: 517 [2019-10-03 02:53:42,977 INFO L226 Difference]: Without dead ends: 517 [2019-10-03 02:53:42,979 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:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-10-03 02:53:43,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 516. [2019-10-03 02:53:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-10-03 02:53:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 709 transitions. [2019-10-03 02:53:43,019 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 709 transitions. Word has length 186 [2019-10-03 02:53:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:43,023 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 709 transitions. [2019-10-03 02:53:43,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 709 transitions. [2019-10-03 02:53:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-03 02:53:43,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:43,034 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] [2019-10-03 02:53:43,035 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:43,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:43,035 INFO L82 PathProgramCache]: Analyzing trace with hash -347325980, now seen corresponding path program 1 times [2019-10-03 02:53:43,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:43,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:43,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:43,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:43,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:43,367 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:43,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:43,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:43,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:43,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:43,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:43,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:43,375 INFO L87 Difference]: Start difference. First operand 516 states and 709 transitions. Second operand 3 states. [2019-10-03 02:53:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:43,431 INFO L93 Difference]: Finished difference Result 559 states and 782 transitions. [2019-10-03 02:53:43,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:43,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-03 02:53:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:43,441 INFO L225 Difference]: With dead ends: 559 [2019-10-03 02:53:43,442 INFO L226 Difference]: Without dead ends: 559 [2019-10-03 02:53:43,442 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:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-10-03 02:53:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 558. [2019-10-03 02:53:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-10-03 02:53:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 781 transitions. [2019-10-03 02:53:43,495 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 781 transitions. Word has length 196 [2019-10-03 02:53:43,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:43,497 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 781 transitions. [2019-10-03 02:53:43,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 781 transitions. [2019-10-03 02:53:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-03 02:53:43,504 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:43,504 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] [2019-10-03 02:53:43,505 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:43,505 INFO L82 PathProgramCache]: Analyzing trace with hash -326965868, now seen corresponding path program 1 times [2019-10-03 02:53:43,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:43,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:43,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:43,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:43,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:43,694 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:43,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:43,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:43,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:43,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:43,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:43,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:43,699 INFO L87 Difference]: Start difference. First operand 558 states and 781 transitions. Second operand 3 states. [2019-10-03 02:53:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:43,734 INFO L93 Difference]: Finished difference Result 640 states and 920 transitions. [2019-10-03 02:53:43,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:43,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-10-03 02:53:43,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:43,743 INFO L225 Difference]: With dead ends: 640 [2019-10-03 02:53:43,744 INFO L226 Difference]: Without dead ends: 640 [2019-10-03 02:53:43,744 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:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-10-03 02:53:43,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 639. [2019-10-03 02:53:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-03 02:53:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 919 transitions. [2019-10-03 02:53:43,773 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 919 transitions. Word has length 197 [2019-10-03 02:53:43,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:43,774 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 919 transitions. [2019-10-03 02:53:43,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:43,774 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 919 transitions. [2019-10-03 02:53:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-03 02:53:43,778 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:43,778 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] [2019-10-03 02:53:43,778 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:43,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:43,779 INFO L82 PathProgramCache]: Analyzing trace with hash 175812164, now seen corresponding path program 1 times [2019-10-03 02:53:43,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:43,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:43,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:43,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:43,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:44,043 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:44,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:44,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:44,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:44,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:44,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:44,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:44,051 INFO L87 Difference]: Start difference. First operand 639 states and 919 transitions. Second operand 3 states. [2019-10-03 02:53:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:44,088 INFO L93 Difference]: Finished difference Result 796 states and 1184 transitions. [2019-10-03 02:53:44,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:44,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-03 02:53:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:44,096 INFO L225 Difference]: With dead ends: 796 [2019-10-03 02:53:44,097 INFO L226 Difference]: Without dead ends: 796 [2019-10-03 02:53:44,097 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:44,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-10-03 02:53:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 795. [2019-10-03 02:53:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-10-03 02:53:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1183 transitions. [2019-10-03 02:53:44,139 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1183 transitions. Word has length 198 [2019-10-03 02:53:44,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:44,139 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1183 transitions. [2019-10-03 02:53:44,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1183 transitions. [2019-10-03 02:53:44,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-03 02:53:44,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:44,148 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] [2019-10-03 02:53:44,148 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:44,149 INFO L82 PathProgramCache]: Analyzing trace with hash 517583156, now seen corresponding path program 1 times [2019-10-03 02:53:44,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:44,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:44,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:44,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:44,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:44,376 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:44,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:44,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:44,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:44,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:44,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:44,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:44,379 INFO L87 Difference]: Start difference. First operand 795 states and 1183 transitions. Second operand 3 states. [2019-10-03 02:53:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:44,404 INFO L93 Difference]: Finished difference Result 1096 states and 1688 transitions. [2019-10-03 02:53:44,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:44,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-10-03 02:53:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:44,414 INFO L225 Difference]: With dead ends: 1096 [2019-10-03 02:53:44,415 INFO L226 Difference]: Without dead ends: 1096 [2019-10-03 02:53:44,415 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:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2019-10-03 02:53:44,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1095. [2019-10-03 02:53:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-10-03 02:53:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1687 transitions. [2019-10-03 02:53:44,453 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1687 transitions. Word has length 199 [2019-10-03 02:53:44,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:44,455 INFO L475 AbstractCegarLoop]: Abstraction has 1095 states and 1687 transitions. [2019-10-03 02:53:44,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:44,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1687 transitions. [2019-10-03 02:53:44,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-03 02:53:44,462 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:44,463 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] [2019-10-03 02:53:44,463 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:44,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:44,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2061438023, now seen corresponding path program 1 times [2019-10-03 02:53:44,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:44,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:44,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:44,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:44,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:44,896 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:44,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:44,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:53:44,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:44,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:53:44,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:53:44,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:53:44,899 INFO L87 Difference]: Start difference. First operand 1095 states and 1687 transitions. Second operand 11 states. [2019-10-03 02:53:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:50,505 INFO L93 Difference]: Finished difference Result 2842 states and 4216 transitions. [2019-10-03 02:53:50,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-03 02:53:50,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2019-10-03 02:53:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:50,524 INFO L225 Difference]: With dead ends: 2842 [2019-10-03 02:53:50,524 INFO L226 Difference]: Without dead ends: 2842 [2019-10-03 02:53:50,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 02:53:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2019-10-03 02:53:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2821. [2019-10-03 02:53:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2019-10-03 02:53:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 4142 transitions. [2019-10-03 02:53:50,629 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 4142 transitions. Word has length 202 [2019-10-03 02:53:50,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:50,630 INFO L475 AbstractCegarLoop]: Abstraction has 2821 states and 4142 transitions. [2019-10-03 02:53:50,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:53:50,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 4142 transitions. [2019-10-03 02:53:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-03 02:53:50,637 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:50,637 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:50,637 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:50,638 INFO L82 PathProgramCache]: Analyzing trace with hash 836940569, now seen corresponding path program 1 times [2019-10-03 02:53:50,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:50,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:50,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:50,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:50,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:50,966 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:50,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:50,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-03 02:53:50,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:50,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 02:53:50,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 02:53:50,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-03 02:53:50,969 INFO L87 Difference]: Start difference. First operand 2821 states and 4142 transitions. Second operand 18 states. [2019-10-03 02:53:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:51,459 INFO L93 Difference]: Finished difference Result 2856 states and 4244 transitions. [2019-10-03 02:53:51,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 02:53:51,459 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 203 [2019-10-03 02:53:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:51,489 INFO L225 Difference]: With dead ends: 2856 [2019-10-03 02:53:51,489 INFO L226 Difference]: Without dead ends: 2838 [2019-10-03 02:53:51,490 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-03 02:53:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2019-10-03 02:53:51,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2836. [2019-10-03 02:53:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2836 states. [2019-10-03 02:53:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 4143 transitions. [2019-10-03 02:53:51,601 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 4143 transitions. Word has length 203 [2019-10-03 02:53:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:51,604 INFO L475 AbstractCegarLoop]: Abstraction has 2836 states and 4143 transitions. [2019-10-03 02:53:51,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 02:53:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 4143 transitions. [2019-10-03 02:53:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 02:53:51,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:51,613 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] [2019-10-03 02:53:51,613 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:51,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:51,614 INFO L82 PathProgramCache]: Analyzing trace with hash -17476821, now seen corresponding path program 1 times [2019-10-03 02:53:51,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:51,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:51,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:51,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:51,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:51,959 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:51,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:51,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:53:51,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:51,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:53:51,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:53:51,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:53:51,964 INFO L87 Difference]: Start difference. First operand 2836 states and 4143 transitions. Second operand 6 states. [2019-10-03 02:53:52,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:52,676 INFO L93 Difference]: Finished difference Result 5759 states and 8581 transitions. [2019-10-03 02:53:52,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:53:52,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 212 [2019-10-03 02:53:52,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:52,712 INFO L225 Difference]: With dead ends: 5759 [2019-10-03 02:53:52,713 INFO L226 Difference]: Without dead ends: 5759 [2019-10-03 02:53:52,713 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:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5759 states. [2019-10-03 02:53:52,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5759 to 5688. [2019-10-03 02:53:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5688 states. [2019-10-03 02:53:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5688 states to 5688 states and 8455 transitions. [2019-10-03 02:53:52,915 INFO L78 Accepts]: Start accepts. Automaton has 5688 states and 8455 transitions. Word has length 212 [2019-10-03 02:53:52,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:52,916 INFO L475 AbstractCegarLoop]: Abstraction has 5688 states and 8455 transitions. [2019-10-03 02:53:52,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:53:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 5688 states and 8455 transitions. [2019-10-03 02:53:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:53:52,933 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:52,933 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] [2019-10-03 02:53:52,933 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:52,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:52,934 INFO L82 PathProgramCache]: Analyzing trace with hash -924380084, now seen corresponding path program 1 times [2019-10-03 02:53:52,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:52,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:52,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:52,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:52,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:53,191 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:53,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:53,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:53:53,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:53,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:53:53,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:53:53,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:53:53,194 INFO L87 Difference]: Start difference. First operand 5688 states and 8455 transitions. Second operand 11 states. [2019-10-03 02:53:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:53,639 INFO L93 Difference]: Finished difference Result 5742 states and 8509 transitions. [2019-10-03 02:53:53,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:53:53,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 213 [2019-10-03 02:53:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:53,675 INFO L225 Difference]: With dead ends: 5742 [2019-10-03 02:53:53,675 INFO L226 Difference]: Without dead ends: 5742 [2019-10-03 02:53:53,676 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:53,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5742 states. [2019-10-03 02:53:53,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5742 to 5724. [2019-10-03 02:53:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5724 states. [2019-10-03 02:53:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5724 states to 5724 states and 8491 transitions. [2019-10-03 02:53:53,942 INFO L78 Accepts]: Start accepts. Automaton has 5724 states and 8491 transitions. Word has length 213 [2019-10-03 02:53:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:53,943 INFO L475 AbstractCegarLoop]: Abstraction has 5724 states and 8491 transitions. [2019-10-03 02:53:53,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:53:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 5724 states and 8491 transitions. [2019-10-03 02:53:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:53:53,954 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:53,955 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] [2019-10-03 02:53:53,955 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:53,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:53,955 INFO L82 PathProgramCache]: Analyzing trace with hash -337603965, now seen corresponding path program 1 times [2019-10-03 02:53:53,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:53,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:53,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:53,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:53,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:54,135 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,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:54,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:53:54,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:54,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:53:54,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:53:54,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:53:54,137 INFO L87 Difference]: Start difference. First operand 5724 states and 8491 transitions. Second operand 5 states. [2019-10-03 02:53:55,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:55,380 INFO L93 Difference]: Finished difference Result 15284 states and 22572 transitions. [2019-10-03 02:53:55,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:53:55,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-10-03 02:53:55,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:55,457 INFO L225 Difference]: With dead ends: 15284 [2019-10-03 02:53:55,457 INFO L226 Difference]: Without dead ends: 15284 [2019-10-03 02:53:55,458 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:55,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15284 states. [2019-10-03 02:53:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15284 to 15172. [2019-10-03 02:53:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15172 states. [2019-10-03 02:53:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15172 states to 15172 states and 22439 transitions. [2019-10-03 02:53:55,912 INFO L78 Accepts]: Start accepts. Automaton has 15172 states and 22439 transitions. Word has length 213 [2019-10-03 02:53:55,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:55,913 INFO L475 AbstractCegarLoop]: Abstraction has 15172 states and 22439 transitions. [2019-10-03 02:53:55,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:53:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 15172 states and 22439 transitions. [2019-10-03 02:53:55,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-03 02:53:55,945 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:55,946 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] [2019-10-03 02:53:55,946 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:55,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:55,947 INFO L82 PathProgramCache]: Analyzing trace with hash 667026014, now seen corresponding path program 1 times [2019-10-03 02:53:55,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:55,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:55,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:55,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:55,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:56,792 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:56,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:56,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:53:56,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:56,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:53:56,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:53:56,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:53:56,796 INFO L87 Difference]: Start difference. First operand 15172 states and 22439 transitions. Second operand 8 states. [2019-10-03 02:54:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:01,768 INFO L93 Difference]: Finished difference Result 30775 states and 47353 transitions. [2019-10-03 02:54:01,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:01,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 235 [2019-10-03 02:54:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:01,906 INFO L225 Difference]: With dead ends: 30775 [2019-10-03 02:54:01,906 INFO L226 Difference]: Without dead ends: 30775 [2019-10-03 02:54:01,907 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:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30775 states. [2019-10-03 02:54:02,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30775 to 18756. [2019-10-03 02:54:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18756 states. [2019-10-03 02:54:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18756 states to 18756 states and 29827 transitions. [2019-10-03 02:54:02,937 INFO L78 Accepts]: Start accepts. Automaton has 18756 states and 29827 transitions. Word has length 235 [2019-10-03 02:54:02,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:02,937 INFO L475 AbstractCegarLoop]: Abstraction has 18756 states and 29827 transitions. [2019-10-03 02:54:02,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 18756 states and 29827 transitions. [2019-10-03 02:54:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-03 02:54:02,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:02,994 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, 1, 1, 1] [2019-10-03 02:54:02,994 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:02,995 INFO L82 PathProgramCache]: Analyzing trace with hash 974139492, now seen corresponding path program 1 times [2019-10-03 02:54:02,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:02,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:02,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:03,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:03,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:03,219 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:03,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:03,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:03,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:03,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:03,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:03,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:03,222 INFO L87 Difference]: Start difference. First operand 18756 states and 29827 transitions. Second operand 8 states. [2019-10-03 02:54:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:08,276 INFO L93 Difference]: Finished difference Result 38479 states and 64789 transitions. [2019-10-03 02:54:08,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:08,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 251 [2019-10-03 02:54:08,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:08,445 INFO L225 Difference]: With dead ends: 38479 [2019-10-03 02:54:08,445 INFO L226 Difference]: Without dead ends: 38479 [2019-10-03 02:54:08,446 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:08,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38479 states. [2019-10-03 02:54:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38479 to 26044. [2019-10-03 02:54:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26044 states. [2019-10-03 02:54:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26044 states to 26044 states and 45947 transitions. [2019-10-03 02:54:09,410 INFO L78 Accepts]: Start accepts. Automaton has 26044 states and 45947 transitions. Word has length 251 [2019-10-03 02:54:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:09,411 INFO L475 AbstractCegarLoop]: Abstraction has 26044 states and 45947 transitions. [2019-10-03 02:54:09,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 26044 states and 45947 transitions. [2019-10-03 02:54:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-03 02:54:09,614 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:09,614 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] [2019-10-03 02:54:09,615 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:09,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:09,615 INFO L82 PathProgramCache]: Analyzing trace with hash -396837894, now seen corresponding path program 1 times [2019-10-03 02:54:09,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:09,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:09,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:09,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:09,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:10,012 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:10,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:10,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:10,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:10,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:10,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:10,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:10,015 INFO L87 Difference]: Start difference. First operand 26044 states and 45947 transitions. Second operand 8 states. [2019-10-03 02:54:16,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:16,626 INFO L93 Difference]: Finished difference Result 54039 states and 102305 transitions. [2019-10-03 02:54:16,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:16,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 237 [2019-10-03 02:54:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:16,930 INFO L225 Difference]: With dead ends: 54039 [2019-10-03 02:54:16,931 INFO L226 Difference]: Without dead ends: 54039 [2019-10-03 02:54:16,933 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:16,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54039 states. [2019-10-03 02:54:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54039 to 40748. [2019-10-03 02:54:18,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40748 states. [2019-10-03 02:54:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40748 states to 40748 states and 80735 transitions. [2019-10-03 02:54:19,174 INFO L78 Accepts]: Start accepts. Automaton has 40748 states and 80735 transitions. Word has length 237 [2019-10-03 02:54:19,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:19,174 INFO L475 AbstractCegarLoop]: Abstraction has 40748 states and 80735 transitions. [2019-10-03 02:54:19,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:19,175 INFO L276 IsEmpty]: Start isEmpty. Operand 40748 states and 80735 transitions. [2019-10-03 02:54:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-03 02:54:19,672 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:19,673 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:19,673 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:19,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1411507826, now seen corresponding path program 1 times [2019-10-03 02:54:19,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:19,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:19,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:19,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:19,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-03 02:54:19,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:19,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:54:19,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:19,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:54:19,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:54:19,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:54:19,909 INFO L87 Difference]: Start difference. First operand 40748 states and 80735 transitions. Second operand 11 states. [2019-10-03 02:54:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:20,981 INFO L93 Difference]: Finished difference Result 52878 states and 99524 transitions. [2019-10-03 02:54:20,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:54:20,981 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 256 [2019-10-03 02:54:20,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:21,198 INFO L225 Difference]: With dead ends: 52878 [2019-10-03 02:54:21,198 INFO L226 Difference]: Without dead ends: 52842 [2019-10-03 02:54:21,199 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:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52842 states. [2019-10-03 02:54:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52842 to 52214. [2019-10-03 02:54:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52214 states. [2019-10-03 02:54:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52214 states to 52214 states and 98445 transitions. [2019-10-03 02:54:24,299 INFO L78 Accepts]: Start accepts. Automaton has 52214 states and 98445 transitions. Word has length 256 [2019-10-03 02:54:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:24,300 INFO L475 AbstractCegarLoop]: Abstraction has 52214 states and 98445 transitions. [2019-10-03 02:54:24,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:54:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 52214 states and 98445 transitions. [2019-10-03 02:54:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-03 02:54:24,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:24,433 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:24,433 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:24,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:24,434 INFO L82 PathProgramCache]: Analyzing trace with hash 494477452, now seen corresponding path program 1 times [2019-10-03 02:54:24,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:24,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:24,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:24,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:24,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:54:25,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:54:25,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:54:25,897 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2019-10-03 02:54:25,899 INFO L207 CegarAbsIntRunner]: [59], [62], [72], [92], [95], [96], [99], [109], [110], [126], [129], [138], [139], [142], [143], [144], [146], [242], [245], [251], [256], [258], [262], [265], [266], [267], [270], [276], [300], [302], [304], [307], [328], [331], [340], [351], [353], [354], [357], [367], [370], [372], [375], [377], [379], [410], [413], [422], [519], [522], [532], [594], [596], [597], [598], [614], [617], [631], [634], [637], [651], [680], [681], [692], [694], [696], [699], [703], [706], [708], [732], [736], [739], [747], [750], [781], [815], [824], [828], [830], [832], [835], [842], [849], [856], [863], [870], [877], [880], [882], [1064], [1067], [1070], [1114], [1115], [1118], [1121], [1124], [1168], [1187], [1189], [1206], [1210], [1221], [1224], [1225], [1228], [1231], [1262], [1265], [1267], [1350], [1353], [1359], [1380], [1383], [1397], [1405], [1408], [1417], [1484], [1487], [1489], [1491], [1493], [1498], [1505], [1507], [1508], [1636], [1638], [1640], [1642], [1643], [1659], [1660], [1661], [1662], [1663], [1664], [1665], [1675], [1676], [1677], [1678], [1679], [1680], [1683], [1684], [1685], [1686], [1687], [1689], [1690], [1691], [1692], [1699], [1700], [1701], [1702], [1703], [1704], [1705], [1706], [1707], [1719], [1720], [1721], [1722], [1723], [1724], [1749], [1750], [1763], [1764], [1765], [1766], [1767], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1779], [1780], [1781], [1782], [1797], [1821], [1822], [1835], [1837], [1838], [1855], [1857], [1858], [1859], [1860], [1861], [1862], [1863], [1871], [1872], [1873], [1874], [1875], [1876], [1877], [1879], [1880], [1895], [1896], [1897], [1898], [1899], [1900], [1901], [1902], [1903] [2019-10-03 02:54:25,948 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:54:25,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:54:26,120 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:54:26,122 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 273 root evaluator evaluations with a maximum evaluation depth of 0. Performed 273 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:26,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:26,127 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:54:26,234 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:54:26,234 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:54:26,241 INFO L420 sIntCurrentIteration]: We unified 241 AI predicates to 241 [2019-10-03 02:54:26,241 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:54:26,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:54:26,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [50] total 50 [2019-10-03 02:54:26,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:26,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:54:26,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:54:26,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:54:26,244 INFO L87 Difference]: Start difference. First operand 52214 states and 98445 transitions. Second operand 2 states. [2019-10-03 02:54:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:26,245 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:54:26,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:54:26,245 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 242 [2019-10-03 02:54:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:26,246 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:54:26,246 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:54:26,247 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 241 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:26,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:54:26,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:54:26,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:54:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:54:26,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 242 [2019-10-03 02:54:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:26,248 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:54:26,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:54:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:54:26,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:54:26,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:54:26 BoogieIcfgContainer [2019-10-03 02:54:26,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:54:26,257 INFO L168 Benchmark]: Toolchain (without parser) took 48402.53 ms. Allocated memory was 133.2 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 85.9 MB in the beginning and 512.2 MB in the end (delta: -426.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-10-03 02:54:26,258 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 107.2 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:26,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1113.02 ms. Allocated memory was 133.2 MB in the beginning and 202.4 MB in the end (delta: 69.2 MB). Free memory was 85.6 MB in the beginning and 132.6 MB in the end (delta: -47.0 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:26,260 INFO L168 Benchmark]: Boogie Preprocessor took 181.13 ms. Allocated memory is still 202.4 MB. Free memory was 132.6 MB in the beginning and 123.9 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:26,261 INFO L168 Benchmark]: RCFGBuilder took 2322.13 ms. Allocated memory was 202.4 MB in the beginning and 265.8 MB in the end (delta: 63.4 MB). Free memory was 123.9 MB in the beginning and 156.0 MB in the end (delta: -32.1 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:26,262 INFO L168 Benchmark]: TraceAbstraction took 44781.81 ms. Allocated memory was 265.8 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 156.0 MB in the beginning and 512.2 MB in the end (delta: -356.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-10-03 02:54:26,265 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.27 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 107.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1113.02 ms. Allocated memory was 133.2 MB in the beginning and 202.4 MB in the end (delta: 69.2 MB). Free memory was 85.6 MB in the beginning and 132.6 MB in the end (delta: -47.0 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 181.13 ms. Allocated memory is still 202.4 MB. Free memory was 132.6 MB in the beginning and 123.9 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2322.13 ms. Allocated memory was 202.4 MB in the beginning and 265.8 MB in the end (delta: 63.4 MB). Free memory was 123.9 MB in the beginning and 156.0 MB in the end (delta: -32.1 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44781.81 ms. Allocated memory was 265.8 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 156.0 MB in the beginning and 512.2 MB in the end (delta: -356.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2523]: 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, 779 locations, 1 error locations. SAFE Result, 44.6s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 27.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12493 SDtfs, 10245 SDslu, 43038 SDs, 0 SdLazy, 16932 SolverSat, 2691 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52214occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.066390041493776 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 38602 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 3425 NumberOfCodeBlocks, 3425 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3409 ConstructedInterpolants, 0 QuantifiedInterpolants, 1101729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 554/556 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...