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_spec11_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:50:34,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:50:34,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:50:34,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:50:34,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:50:34,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:50:34,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:50:34,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:50:35,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:50:35,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:50:35,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:50:35,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:50:35,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:50:35,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:50:35,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:50:35,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:50:35,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:50:35,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:50:35,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:50:35,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:50:35,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:50:35,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:50:35,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:50:35,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:50:35,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:50:35,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:50:35,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:50:35,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:50:35,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:50:35,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:50:35,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:50:35,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:50:35,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:50:35,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:50:35,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:50:35,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:50:35,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:50:35,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:50:35,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:50:35,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:50:35,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:50:35,032 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:50:35,048 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:50:35,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:50:35,048 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:50:35,049 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:50:35,049 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:50:35,050 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:50:35,050 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:50:35,050 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:50:35,050 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:50:35,050 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:50:35,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:50:35,051 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:50:35,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:50:35,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:50:35,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:50:35,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:50:35,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:50:35,052 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:50:35,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:50:35,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:50:35,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:50:35,053 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:50:35,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:50:35,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:50:35,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:50:35,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:50:35,054 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:50:35,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:50:35,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:50:35,055 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:50:35,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:50:35,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:50:35,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:50:35,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:50:35,104 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:50:35,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec11_product32.cil.c [2019-10-03 02:50:35,166 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba10ccda2/fa9bc799d58d490fb1bf029542647688/FLAG5a1a385db [2019-10-03 02:50:35,798 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:50:35,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product32.cil.c [2019-10-03 02:50:35,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba10ccda2/fa9bc799d58d490fb1bf029542647688/FLAG5a1a385db [2019-10-03 02:50:36,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba10ccda2/fa9bc799d58d490fb1bf029542647688 [2019-10-03 02:50:36,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:50:36,045 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:50:36,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:50:36,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:50:36,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:50:36,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:50:36" (1/1) ... [2019-10-03 02:50:36,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c301fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:36, skipping insertion in model container [2019-10-03 02:50:36,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:50:36" (1/1) ... [2019-10-03 02:50:36,063 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:50:36,159 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:50:36,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:50:36,903 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:50:37,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:50:37,211 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:50:37,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37 WrapperNode [2019-10-03 02:50:37,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:50:37,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:50:37,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:50:37,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:50:37,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... [2019-10-03 02:50:37,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... [2019-10-03 02:50:37,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... [2019-10-03 02:50:37,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... [2019-10-03 02:50:37,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... [2019-10-03 02:50:37,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... [2019-10-03 02:50:37,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... [2019-10-03 02:50:37,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:50:37,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:50:37,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:50:37,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:50:37,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (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:50:37,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:50:37,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:50:37,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:50:37,500 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:50:37,500 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:50:37,500 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:50:37,500 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:50:37,501 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:50:37,502 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:50:37,502 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:50:37,502 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:50:37,502 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:50:37,503 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:50:37,504 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:50:37,504 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:50:37,505 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:50:37,505 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:50:37,505 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:50:37,506 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:50:37,506 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:50:37,506 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:50:37,506 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:50:37,506 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:50:37,507 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:50:37,507 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:50:37,508 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:50:37,508 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:50:37,508 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:50:37,508 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:50:37,508 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:50:37,508 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:50:37,508 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:50:37,508 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:50:37,509 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:50:37,509 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:50:37,509 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:50:37,509 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:50:37,509 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:50:37,509 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:50:37,510 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:50:37,510 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:50:37,510 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:50:37,510 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:50:37,510 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:50:37,510 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:50:37,510 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:50:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:50:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:50:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:50:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:50:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:50:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:50:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-03 02:50:37,512 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:50:37,512 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:50:37,512 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:50:37,512 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:50:37,512 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:50:37,512 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-03 02:50:37,513 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-03 02:50:37,513 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:50:37,513 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:50:37,513 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:50:37,513 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:50:37,513 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:50:37,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:50:37,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:50:37,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:50:37,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:50:37,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:50:37,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:50:37,514 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:50:37,515 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:50:37,515 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:50:37,515 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:50:37,515 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:50:37,515 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-03 02:50:37,515 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:50:37,515 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:50:37,516 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-03 02:50:37,516 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-03 02:50:37,516 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-03 02:50:37,516 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:50:37,516 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:50:37,516 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:50:37,517 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:50:37,517 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:50:37,517 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:50:37,517 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:50:37,517 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:50:37,517 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:50:37,517 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:50:37,518 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-03 02:50:37,518 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-03 02:50:37,518 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-03 02:50:37,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-03 02:50:37,518 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:50:37,518 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:50:37,519 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:50:37,519 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:50:37,519 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:50:37,519 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:50:37,519 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:50:37,519 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:50:37,519 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:50:37,520 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:50:37,520 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:50:37,520 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:50:37,520 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:50:37,520 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:50:37,520 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:50:37,520 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:50:37,521 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:50:37,521 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:50:37,521 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:50:37,521 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:50:37,521 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:50:37,521 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:50:37,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:50:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:50:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:50:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:50:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:50:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:50:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:50:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:50:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:50:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:50:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:50:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:50:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:50:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:50:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:50:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:50:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:50:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:50:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:50:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:50:37,525 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:50:37,525 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:50:37,525 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:50:37,525 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:50:37,525 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:50:37,525 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:50:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:50:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:50:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:50:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:50:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:50:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:50:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:50:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:50:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:50:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:50:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:50:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:50:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:50:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:50:37,528 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:50:37,528 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:50:37,528 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:50:37,528 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:50:37,528 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:50:37,528 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:50:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:50:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:50:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:50:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:50:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:50:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:50:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:50:37,530 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:50:37,530 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:50:37,530 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:50:37,530 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:50:37,530 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:50:37,530 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:50:37,531 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:50:37,531 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-03 02:50:37,531 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:50:37,531 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:50:37,531 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:50:37,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:50:37,532 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:50:37,532 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:50:37,532 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:50:37,532 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:50:37,532 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:50:37,532 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:50:37,533 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:50:37,533 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:50:37,533 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:50:37,533 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:50:37,533 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:50:37,533 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:50:37,534 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:50:37,534 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:50:37,534 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:50:37,534 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:50:37,534 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-03 02:50:37,534 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-03 02:50:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:50:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:50:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:50:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:50:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:50:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:50:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:50:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:50:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:50:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:50:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:50:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:50:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:50:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:50:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:50:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:50:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:50:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:50:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:50:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:50:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:50:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:50:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:50:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:50:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:50:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:50:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:50:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:50:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:50:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:50:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:50:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-03 02:50:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-03 02:50:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-03 02:50:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:50:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:50:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-03 02:50:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-03 02:50:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-03 02:50:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-03 02:50:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-03 02:50:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:50:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:50:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:50:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:50:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:50:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:50:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:50:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:50:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:50:39,848 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:50:39,848 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:50:39,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:39 BoogieIcfgContainer [2019-10-03 02:50:39,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:50:39,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:50:39,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:50:39,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:50:39,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:50:36" (1/3) ... [2019-10-03 02:50:39,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156fbecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:39, skipping insertion in model container [2019-10-03 02:50:39,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (2/3) ... [2019-10-03 02:50:39,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156fbecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:39, skipping insertion in model container [2019-10-03 02:50:39,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:39" (3/3) ... [2019-10-03 02:50:39,859 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product32.cil.c [2019-10-03 02:50:39,869 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:50:39,882 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:50:39,898 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:50:39,930 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:50:39,931 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:50:39,931 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:50:39,931 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:50:39,931 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:50:39,931 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:50:39,931 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:50:39,932 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:50:39,972 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states. [2019-10-03 02:50:40,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-03 02:50:40,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:40,020 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:40,022 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:40,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:40,028 INFO L82 PathProgramCache]: Analyzing trace with hash 524711374, now seen corresponding path program 1 times [2019-10-03 02:50:40,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:40,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:40,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:40,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:40,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 02:50:40,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:40,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:50:40,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:40,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:50:40,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:50:40,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:40,669 INFO L87 Difference]: Start difference. First operand 634 states. Second operand 2 states. [2019-10-03 02:50:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:40,720 INFO L93 Difference]: Finished difference Result 586 states and 798 transitions. [2019-10-03 02:50:40,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:50:40,722 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 225 [2019-10-03 02:50:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:40,746 INFO L225 Difference]: With dead ends: 586 [2019-10-03 02:50:40,746 INFO L226 Difference]: Without dead ends: 577 [2019-10-03 02:50:40,748 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:50:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-03 02:50:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-03 02:50:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-03 02:50:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 787 transitions. [2019-10-03 02:50:40,840 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 787 transitions. Word has length 225 [2019-10-03 02:50:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:40,843 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 787 transitions. [2019-10-03 02:50:40,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:50:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 787 transitions. [2019-10-03 02:50:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-03 02:50:40,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:40,849 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:40,850 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:40,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:40,850 INFO L82 PathProgramCache]: Analyzing trace with hash 426124943, now seen corresponding path program 1 times [2019-10-03 02:50:40,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:40,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:40,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:40,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:40,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 02:50:41,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:41,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:41,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:41,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:41,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:41,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:41,184 INFO L87 Difference]: Start difference. First operand 577 states and 787 transitions. Second operand 3 states. [2019-10-03 02:50:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:41,235 INFO L93 Difference]: Finished difference Result 580 states and 790 transitions. [2019-10-03 02:50:41,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:41,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-10-03 02:50:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:41,242 INFO L225 Difference]: With dead ends: 580 [2019-10-03 02:50:41,242 INFO L226 Difference]: Without dead ends: 580 [2019-10-03 02:50:41,243 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:50:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-03 02:50:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 579. [2019-10-03 02:50:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-03 02:50:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 789 transitions. [2019-10-03 02:50:41,286 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 789 transitions. Word has length 226 [2019-10-03 02:50:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:41,290 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 789 transitions. [2019-10-03 02:50:41,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 789 transitions. [2019-10-03 02:50:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-03 02:50:41,297 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:41,298 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:41,298 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:41,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:41,299 INFO L82 PathProgramCache]: Analyzing trace with hash -478434401, now seen corresponding path program 1 times [2019-10-03 02:50:41,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:41,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:41,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:41,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:41,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 02:50:41,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:41,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:41,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:41,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:41,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:41,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:41,575 INFO L87 Difference]: Start difference. First operand 579 states and 789 transitions. Second operand 3 states. [2019-10-03 02:50:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:41,629 INFO L93 Difference]: Finished difference Result 622 states and 862 transitions. [2019-10-03 02:50:41,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:41,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-10-03 02:50:41,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:41,643 INFO L225 Difference]: With dead ends: 622 [2019-10-03 02:50:41,643 INFO L226 Difference]: Without dead ends: 622 [2019-10-03 02:50:41,644 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:50:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-03 02:50:41,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 621. [2019-10-03 02:50:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-03 02:50:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 861 transitions. [2019-10-03 02:50:41,706 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 861 transitions. Word has length 236 [2019-10-03 02:50:41,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:41,709 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 861 transitions. [2019-10-03 02:50:41,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 861 transitions. [2019-10-03 02:50:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-03 02:50:41,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:41,721 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:41,721 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:41,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:41,722 INFO L82 PathProgramCache]: Analyzing trace with hash 28118044, now seen corresponding path program 1 times [2019-10-03 02:50:41,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:41,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:41,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:41,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:41,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 02:50:42,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:42,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:42,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:42,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:42,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:42,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:42,130 INFO L87 Difference]: Start difference. First operand 621 states and 861 transitions. Second operand 3 states. [2019-10-03 02:50:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:42,164 INFO L93 Difference]: Finished difference Result 703 states and 1000 transitions. [2019-10-03 02:50:42,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:42,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-10-03 02:50:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:42,171 INFO L225 Difference]: With dead ends: 703 [2019-10-03 02:50:42,171 INFO L226 Difference]: Without dead ends: 703 [2019-10-03 02:50:42,172 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:50:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-10-03 02:50:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 702. [2019-10-03 02:50:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-10-03 02:50:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 999 transitions. [2019-10-03 02:50:42,201 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 999 transitions. Word has length 237 [2019-10-03 02:50:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:42,202 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 999 transitions. [2019-10-03 02:50:42,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 999 transitions. [2019-10-03 02:50:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-03 02:50:42,207 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:42,208 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:42,208 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:42,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:42,209 INFO L82 PathProgramCache]: Analyzing trace with hash 280680863, now seen corresponding path program 1 times [2019-10-03 02:50:42,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:42,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:42,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:42,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:42,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 02:50:42,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:42,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:42,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:42,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:42,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:42,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:42,395 INFO L87 Difference]: Start difference. First operand 702 states and 999 transitions. Second operand 3 states. [2019-10-03 02:50:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:42,427 INFO L93 Difference]: Finished difference Result 859 states and 1264 transitions. [2019-10-03 02:50:42,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:42,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-10-03 02:50:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:42,436 INFO L225 Difference]: With dead ends: 859 [2019-10-03 02:50:42,436 INFO L226 Difference]: Without dead ends: 859 [2019-10-03 02:50:42,437 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:50:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-10-03 02:50:42,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 858. [2019-10-03 02:50:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-10-03 02:50:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1263 transitions. [2019-10-03 02:50:42,473 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1263 transitions. Word has length 238 [2019-10-03 02:50:42,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:42,473 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1263 transitions. [2019-10-03 02:50:42,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1263 transitions. [2019-10-03 02:50:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-03 02:50:42,485 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:42,485 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:42,486 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:42,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:42,486 INFO L82 PathProgramCache]: Analyzing trace with hash 407261724, now seen corresponding path program 1 times [2019-10-03 02:50:42,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:42,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:42,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:42,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:42,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 02:50:42,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:42,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:42,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:42,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:42,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:42,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:42,858 INFO L87 Difference]: Start difference. First operand 858 states and 1263 transitions. Second operand 3 states. [2019-10-03 02:50:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:42,886 INFO L93 Difference]: Finished difference Result 1159 states and 1768 transitions. [2019-10-03 02:50:42,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:42,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-10-03 02:50:42,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:42,894 INFO L225 Difference]: With dead ends: 1159 [2019-10-03 02:50:42,894 INFO L226 Difference]: Without dead ends: 1159 [2019-10-03 02:50:42,895 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:50:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-10-03 02:50:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1158. [2019-10-03 02:50:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2019-10-03 02:50:42,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1767 transitions. [2019-10-03 02:50:42,930 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1767 transitions. Word has length 239 [2019-10-03 02:50:42,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:42,931 INFO L475 AbstractCegarLoop]: Abstraction has 1158 states and 1767 transitions. [2019-10-03 02:50:42,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:42,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1767 transitions. [2019-10-03 02:50:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-03 02:50:42,940 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:42,940 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:42,941 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:42,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:42,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1311842207, now seen corresponding path program 1 times [2019-10-03 02:50:42,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:42,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:42,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:42,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:42,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 02:50:43,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:43,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:43,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:43,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:43,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:43,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:43,145 INFO L87 Difference]: Start difference. First operand 1158 states and 1767 transitions. Second operand 3 states. [2019-10-03 02:50:43,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:43,187 INFO L93 Difference]: Finished difference Result 1735 states and 2728 transitions. [2019-10-03 02:50:43,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:43,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-10-03 02:50:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:43,201 INFO L225 Difference]: With dead ends: 1735 [2019-10-03 02:50:43,202 INFO L226 Difference]: Without dead ends: 1735 [2019-10-03 02:50:43,202 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:50:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2019-10-03 02:50:43,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1734. [2019-10-03 02:50:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1734 states. [2019-10-03 02:50:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2727 transitions. [2019-10-03 02:50:43,290 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2727 transitions. Word has length 240 [2019-10-03 02:50:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:43,291 INFO L475 AbstractCegarLoop]: Abstraction has 1734 states and 2727 transitions. [2019-10-03 02:50:43,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2727 transitions. [2019-10-03 02:50:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-03 02:50:43,307 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:43,308 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:43,309 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:43,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:43,309 INFO L82 PathProgramCache]: Analyzing trace with hash 689298150, now seen corresponding path program 1 times [2019-10-03 02:50:43,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:43,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:43,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:43,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:43,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-03 02:50:43,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:43,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 02:50:43,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:43,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 02:50:43,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 02:50:43,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:50:43,864 INFO L87 Difference]: Start difference. First operand 1734 states and 2727 transitions. Second operand 19 states. [2019-10-03 02:50:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:49,046 INFO L93 Difference]: Finished difference Result 4077 states and 6433 transitions. [2019-10-03 02:50:49,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-03 02:50:49,047 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 242 [2019-10-03 02:50:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:49,074 INFO L225 Difference]: With dead ends: 4077 [2019-10-03 02:50:49,075 INFO L226 Difference]: Without dead ends: 4077 [2019-10-03 02:50:49,076 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:50:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4077 states. [2019-10-03 02:50:49,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4077 to 4040. [2019-10-03 02:50:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4040 states. [2019-10-03 02:50:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4040 states to 4040 states and 6381 transitions. [2019-10-03 02:50:49,247 INFO L78 Accepts]: Start accepts. Automaton has 4040 states and 6381 transitions. Word has length 242 [2019-10-03 02:50:49,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:49,249 INFO L475 AbstractCegarLoop]: Abstraction has 4040 states and 6381 transitions. [2019-10-03 02:50:49,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 02:50:49,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4040 states and 6381 transitions. [2019-10-03 02:50:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-03 02:50:49,271 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:49,271 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:49,272 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:49,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash -179274695, now seen corresponding path program 1 times [2019-10-03 02:50:49,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:49,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:49,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:49,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:49,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-03 02:50:49,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:49,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 02:50:49,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:49,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:50:49,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:50:49,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:50:49,645 INFO L87 Difference]: Start difference. First operand 4040 states and 6381 transitions. Second operand 13 states. [2019-10-03 02:50:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:50,198 INFO L93 Difference]: Finished difference Result 4190 states and 6627 transitions. [2019-10-03 02:50:50,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:50:50,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 243 [2019-10-03 02:50:50,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:50,222 INFO L225 Difference]: With dead ends: 4190 [2019-10-03 02:50:50,223 INFO L226 Difference]: Without dead ends: 4174 [2019-10-03 02:50:50,223 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-10-03 02:50:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4174 states. [2019-10-03 02:50:50,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4174 to 4174. [2019-10-03 02:50:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-10-03 02:50:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 6598 transitions. [2019-10-03 02:50:50,360 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 6598 transitions. Word has length 243 [2019-10-03 02:50:50,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:50,361 INFO L475 AbstractCegarLoop]: Abstraction has 4174 states and 6598 transitions. [2019-10-03 02:50:50,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:50:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 6598 transitions. [2019-10-03 02:50:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-03 02:50:50,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:50,381 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:50,382 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:50,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:50,382 INFO L82 PathProgramCache]: Analyzing trace with hash 766207055, now seen corresponding path program 1 times [2019-10-03 02:50:50,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:50,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:50,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:50,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:50,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-03 02:50:50,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:50,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:50:50,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:50,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:50:50,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:50:50,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:50:50,744 INFO L87 Difference]: Start difference. First operand 4174 states and 6598 transitions. Second operand 15 states. [2019-10-03 02:50:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:54,775 INFO L93 Difference]: Finished difference Result 4292 states and 6788 transitions. [2019-10-03 02:50:54,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-03 02:50:54,776 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 243 [2019-10-03 02:50:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:54,798 INFO L225 Difference]: With dead ends: 4292 [2019-10-03 02:50:54,798 INFO L226 Difference]: Without dead ends: 4292 [2019-10-03 02:50:54,799 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-03 02:50:54,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2019-10-03 02:50:54,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 4255. [2019-10-03 02:50:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4255 states. [2019-10-03 02:50:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 6736 transitions. [2019-10-03 02:50:54,937 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 6736 transitions. Word has length 243 [2019-10-03 02:50:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:54,938 INFO L475 AbstractCegarLoop]: Abstraction has 4255 states and 6736 transitions. [2019-10-03 02:50:54,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:50:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 6736 transitions. [2019-10-03 02:50:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-03 02:50:54,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:54,964 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 02:50:54,965 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:54,965 INFO L82 PathProgramCache]: Analyzing trace with hash -804199253, now seen corresponding path program 1 times [2019-10-03 02:50:54,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:54,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:54,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:54,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:54,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-03 02:50:55,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:55,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:55,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:55,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:55,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:55,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:55,192 INFO L87 Difference]: Start difference. First operand 4255 states and 6736 transitions. Second operand 5 states. [2019-10-03 02:50:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:55,339 INFO L93 Difference]: Finished difference Result 3873 states and 6186 transitions. [2019-10-03 02:50:55,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:50:55,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-10-03 02:50:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:55,364 INFO L225 Difference]: With dead ends: 3873 [2019-10-03 02:50:55,364 INFO L226 Difference]: Without dead ends: 3870 [2019-10-03 02:50:55,366 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:50:55,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2019-10-03 02:50:55,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3870. [2019-10-03 02:50:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3870 states. [2019-10-03 02:50:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 6182 transitions. [2019-10-03 02:50:55,489 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 6182 transitions. Word has length 246 [2019-10-03 02:50:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:55,490 INFO L475 AbstractCegarLoop]: Abstraction has 3870 states and 6182 transitions. [2019-10-03 02:50:55,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 6182 transitions. [2019-10-03 02:50:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-03 02:50:55,511 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:55,511 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:55,512 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:55,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:55,512 INFO L82 PathProgramCache]: Analyzing trace with hash 381795678, now seen corresponding path program 1 times [2019-10-03 02:50:55,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:55,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:55,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:55,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:55,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-03 02:50:55,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:55,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-03 02:50:55,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:55,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 02:50:55,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 02:50:55,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-03 02:50:55,878 INFO L87 Difference]: Start difference. First operand 3870 states and 6182 transitions. Second operand 18 states. [2019-10-03 02:50:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:56,622 INFO L93 Difference]: Finished difference Result 3902 states and 6213 transitions. [2019-10-03 02:50:56,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 02:50:56,622 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 243 [2019-10-03 02:50:56,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:56,665 INFO L225 Difference]: With dead ends: 3902 [2019-10-03 02:50:56,665 INFO L226 Difference]: Without dead ends: 3902 [2019-10-03 02:50:56,665 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-03 02:50:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3902 states. [2019-10-03 02:50:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3902 to 3900. [2019-10-03 02:50:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3900 states. [2019-10-03 02:50:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 6210 transitions. [2019-10-03 02:50:56,792 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 6210 transitions. Word has length 243 [2019-10-03 02:50:56,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:56,793 INFO L475 AbstractCegarLoop]: Abstraction has 3900 states and 6210 transitions. [2019-10-03 02:50:56,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 02:50:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 6210 transitions. [2019-10-03 02:50:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-03 02:50:56,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:56,812 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:56,812 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:56,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:56,812 INFO L82 PathProgramCache]: Analyzing trace with hash 632036331, now seen corresponding path program 1 times [2019-10-03 02:50:56,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:56,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:56,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:56,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:56,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-03 02:50:56,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:56,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:56,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:56,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:56,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:56,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:56,983 INFO L87 Difference]: Start difference. First operand 3900 states and 6210 transitions. Second operand 5 states. [2019-10-03 02:50:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:58,227 INFO L93 Difference]: Finished difference Result 7056 states and 11214 transitions. [2019-10-03 02:50:58,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:50:58,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2019-10-03 02:50:58,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:58,261 INFO L225 Difference]: With dead ends: 7056 [2019-10-03 02:50:58,261 INFO L226 Difference]: Without dead ends: 7056 [2019-10-03 02:50:58,262 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:50:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7056 states. [2019-10-03 02:50:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7056 to 7042. [2019-10-03 02:50:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7042 states. [2019-10-03 02:50:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7042 states to 7042 states and 11195 transitions. [2019-10-03 02:50:58,439 INFO L78 Accepts]: Start accepts. Automaton has 7042 states and 11195 transitions. Word has length 243 [2019-10-03 02:50:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:58,440 INFO L475 AbstractCegarLoop]: Abstraction has 7042 states and 11195 transitions. [2019-10-03 02:50:58,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:58,440 INFO L276 IsEmpty]: Start isEmpty. Operand 7042 states and 11195 transitions. [2019-10-03 02:50:58,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-03 02:50:58,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:58,467 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:58,467 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:58,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:58,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1570567946, now seen corresponding path program 1 times [2019-10-03 02:50:58,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:58,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:58,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:58,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:58,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-03 02:50:58,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:50:58,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:50:58,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2019-10-03 02:50:58,765 INFO L207 CegarAbsIntRunner]: [59], [62], [72], [103], [106], [116], [117], [133], [136], [150], [151], [153], [263], [265], [269], [272], [273], [274], [277], [283], [305], [308], [311], [319], [321], [323], [330], [334], [336], [347], [350], [359], [360], [362], [365], [369], [370], [372], [373], [376], [386], [387], [388], [399], [401], [406], [433], [435], [447], [469], [471], [491], [660], [662], [663], [664], [700], [703], [717], [746], [747], [758], [760], [773], [775], [778], [782], [796], [800], [803], [821], [824], [835], [857], [859], [884], [890], [899], [903], [905], [907], [910], [917], [924], [927], [929], [1065], [1067], [1084], [1088], [1091], [1105], [1213], [1285], [1289], [1300], [1303], [1304], [1307], [1311], [1315], [1341], [1344], [1346], [1415], [1418], [1428], [1429], [1432], [1438], [1459], [1462], [1476], [1482], [1485], [1494], [1688], [1690], [1692], [1694], [1695], [1723], [1733], [1734], [1735], [1736], [1737], [1738], [1741], [1742], [1743], [1744], [1745], [1747], [1748], [1749], [1750], [1757], [1758], [1759], [1760], [1761], [1763], [1764], [1765], [1766], [1771], [1773], [1774], [1779], [1780], [1783], [1784], [1789], [1790], [1791], [1799], [1800], [1813], [1814], [1815], [1816], [1817], [1835], [1836], [1849], [1850], [1851], [1853], [1854], [1859], [1860], [1861], [1862], [1863], [1864], [1865], [1866], [1867], [1869], [1870], [1871], [1872], [1881], [1889], [1890], [1901], [1907], [1908], [1925], [1927], [1928], [1945], [1947], [1948], [1949], [1951], [1952], [1953], [1954], [1955], [1956], [1957], [1977], [1978], [1979], [1980], [1981], [1982], [1983], [1984], [1985] [2019-10-03 02:50:58,836 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:50:58,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:50:59,041 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:50:59,043 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 380 variables. [2019-10-03 02:50:59,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:59,048 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:50:59,187 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:50:59,188 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:50:59,199 INFO L420 sIntCurrentIteration]: We unified 242 AI predicates to 242 [2019-10-03 02:50:59,199 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:50:59,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:50:59,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-10-03 02:50:59,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:59,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:50:59,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:50:59,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:59,202 INFO L87 Difference]: Start difference. First operand 7042 states and 11195 transitions. Second operand 2 states. [2019-10-03 02:50:59,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:59,203 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:50:59,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:50:59,203 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 243 [2019-10-03 02:50:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:59,203 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:50:59,204 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:50:59,205 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 242 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:50:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:50:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:50:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:50:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:50:59,206 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 243 [2019-10-03 02:50:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:59,206 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:50:59,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:50:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:50:59,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:50:59,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:50:59 BoogieIcfgContainer [2019-10-03 02:50:59,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:50:59,216 INFO L168 Benchmark]: Toolchain (without parser) took 23170.30 ms. Allocated memory was 133.7 MB in the beginning and 775.4 MB in the end (delta: 641.7 MB). Free memory was 86.9 MB in the beginning and 105.0 MB in the end (delta: -18.1 MB). Peak memory consumption was 623.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:59,218 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 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:50:59,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1166.18 ms. Allocated memory was 133.7 MB in the beginning and 202.4 MB in the end (delta: 68.7 MB). Free memory was 86.7 MB in the beginning and 130.2 MB in the end (delta: -43.5 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:59,225 INFO L168 Benchmark]: Boogie Preprocessor took 217.77 ms. Allocated memory is still 202.4 MB. Free memory was 130.2 MB in the beginning and 120.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:59,226 INFO L168 Benchmark]: RCFGBuilder took 2419.38 ms. Allocated memory was 202.4 MB in the beginning and 265.3 MB in the end (delta: 62.9 MB). Free memory was 120.9 MB in the beginning and 144.8 MB in the end (delta: -23.9 MB). Peak memory consumption was 80.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:59,228 INFO L168 Benchmark]: TraceAbstraction took 19361.42 ms. Allocated memory was 265.3 MB in the beginning and 775.4 MB in the end (delta: 510.1 MB). Free memory was 144.8 MB in the beginning and 105.0 MB in the end (delta: 39.8 MB). Peak memory consumption was 549.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:59,243 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1166.18 ms. Allocated memory was 133.7 MB in the beginning and 202.4 MB in the end (delta: 68.7 MB). Free memory was 86.7 MB in the beginning and 130.2 MB in the end (delta: -43.5 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 217.77 ms. Allocated memory is still 202.4 MB. Free memory was 130.2 MB in the beginning and 120.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2419.38 ms. Allocated memory was 202.4 MB in the beginning and 265.3 MB in the end (delta: 62.9 MB). Free memory was 120.9 MB in the beginning and 144.8 MB in the end (delta: -23.9 MB). Peak memory consumption was 80.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19361.42 ms. Allocated memory was 265.3 MB in the beginning and 775.4 MB in the end (delta: 510.1 MB). Free memory was 144.8 MB in the beginning and 105.0 MB in the end (delta: 39.8 MB). Peak memory consumption was 549.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2010]: 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 118 procedures, 820 locations, 1 error locations. SAFE Result, 19.2s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11901 SDtfs, 6369 SDslu, 61769 SDs, 0 SdLazy, 7834 SolverSat, 1094 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 450 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7042occurred in iteration=13, 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.0826446280991737 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 96 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 3344 NumberOfCodeBlocks, 3344 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3330 ConstructedInterpolants, 0 QuantifiedInterpolants, 997214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 663/669 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...