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_spec9_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:47:05,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:47:05,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:47:05,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:47:05,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:47:05,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:47:05,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:47:05,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:47:05,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:47:05,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:47:05,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:47:05,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:47:05,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:47:05,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:47:05,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:47:05,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:47:05,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:47:05,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:47:05,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:47:05,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:47:05,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:47:05,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:47:05,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:47:05,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:47:05,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:47:05,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:47:05,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:47:05,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:47:05,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:47:05,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:47:05,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:47:05,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:47:05,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:47:05,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:47:05,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:47:05,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:47:05,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:47:05,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:47:05,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:47:05,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:47:05,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:47:05,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:47:05,750 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:47:05,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:47:05,751 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:47:05,751 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:47:05,752 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:47:05,752 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:47:05,753 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:47:05,753 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:47:05,753 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:47:05,753 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:47:05,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:47:05,754 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:47:05,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:47:05,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:47:05,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:47:05,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:47:05,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:47:05,755 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:47:05,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:47:05,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:47:05,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:47:05,756 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:47:05,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:47:05,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:47:05,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:47:05,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:47:05,757 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:47:05,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:47:05,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:47:05,758 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:47:05,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:47:05,804 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:47:05,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:47:05,809 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:47:05,810 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:47:05,811 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product35.cil.c [2019-09-10 02:47:05,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc49eb1a/b044ea0ae9694caa8460e1d1dd467f38/FLAG290a5df73 [2019-09-10 02:47:06,609 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:47:06,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product35.cil.c [2019-09-10 02:47:06,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc49eb1a/b044ea0ae9694caa8460e1d1dd467f38/FLAG290a5df73 [2019-09-10 02:47:06,730 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc49eb1a/b044ea0ae9694caa8460e1d1dd467f38 [2019-09-10 02:47:06,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:47:06,741 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:47:06,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:47:06,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:47:06,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:47:06,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:47:06" (1/1) ... [2019-09-10 02:47:06,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692b7d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:06, skipping insertion in model container [2019-09-10 02:47:06,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:47:06" (1/1) ... [2019-09-10 02:47:06,762 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:47:06,845 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:47:07,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:47:07,702 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:47:07,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:47:08,023 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:47:08,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:08 WrapperNode [2019-09-10 02:47:08,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:47:08,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:47:08,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:47:08,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:47:08,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:08" (1/1) ... [2019-09-10 02:47:08,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:08" (1/1) ... [2019-09-10 02:47:08,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:08" (1/1) ... [2019-09-10 02:47:08,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:08" (1/1) ... [2019-09-10 02:47:08,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:08" (1/1) ... [2019-09-10 02:47:08,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:08" (1/1) ... [2019-09-10 02:47:08,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:08" (1/1) ... [2019-09-10 02:47:08,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:47:08,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:47:08,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:47:08,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:47:08,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:47:08,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:47:08,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:47:08,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:47:08,312 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:47:08,312 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:47:08,312 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:47:08,312 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:47:08,313 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:47:08,313 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:47:08,313 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:47:08,313 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:47:08,314 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:47:08,314 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:47:08,315 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:47:08,315 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:47:08,316 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:47:08,316 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:47:08,317 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:47:08,317 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:47:08,317 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:47:08,317 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:47:08,317 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:47:08,318 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-10 02:47:08,318 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-10 02:47:08,318 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-10 02:47:08,319 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:47:08,319 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:47:08,319 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:47:08,319 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:47:08,319 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:47:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:47:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:47:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:47:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:47:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:47:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:47:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:47:08,321 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:47:08,321 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:47:08,321 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:47:08,322 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:47:08,322 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:47:08,322 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:47:08,322 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:47:08,322 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:47:08,322 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:47:08,322 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:47:08,323 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:47:08,323 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:47:08,323 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:47:08,323 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:47:08,323 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:47:08,324 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:47:08,324 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:47:08,324 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:47:08,324 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:47:08,324 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:47:08,324 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:47:08,325 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-10 02:47:08,325 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-10 02:47:08,325 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-10 02:47:08,325 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:47:08,325 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-10 02:47:08,325 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:47:08,325 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:47:08,326 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:47:08,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__1 [2019-09-10 02:47:08,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__2 [2019-09-10 02:47:08,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:47:08,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:47:08,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:47:08,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:47:08,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:47:08,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:47:08,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:47:08,328 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:47:08,328 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:47:08,329 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-10 02:47:08,329 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:47:08,330 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-10 02:47:08,330 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:47:08,330 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:47:08,330 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-10 02:47:08,330 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-10 02:47:08,331 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-10 02:47:08,332 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-10 02:47:08,332 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:47:08,333 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:47:08,333 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:47:08,333 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:47:08,333 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:47:08,333 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:47:08,334 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:47:08,334 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:47:08,334 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:47:08,334 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-10 02:47:08,334 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-10 02:47:08,335 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-10 02:47:08,335 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-10 02:47:08,335 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-10 02:47:08,335 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:47:08,335 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:47:08,336 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:47:08,336 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:47:08,336 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:47:08,336 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:47:08,336 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:47:08,336 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:47:08,337 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:47:08,337 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:47:08,337 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:47:08,337 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:47:08,337 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:47:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:47:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:47:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:47:08,339 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:47:08,339 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:47:08,340 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:47:08,340 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:47:08,340 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:47:08,340 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:47:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:47:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:47:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:47:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:47:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:47:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:47:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:47:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:47:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:47:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:47:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:47:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:47:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:47:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:47:08,345 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:47:08,345 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:47:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:47:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:47:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:47:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:47:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:47:08,356 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:47:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:47:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:47:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:47:08,359 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:47:08,359 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:47:08,359 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:47:08,359 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:47:08,359 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:47:08,359 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:47:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:47:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:47:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:47:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:47:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:47:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:47:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:47:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:47:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:47:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:47:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:47:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-10 02:47:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-10 02:47:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-10 02:47:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:47:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:47:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:47:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:47:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:47:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:47:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:47:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:47:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:47:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:47:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:47:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:47:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:47:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:47:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:47:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:47:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:47:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:47:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:47:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:47:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:47:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:47:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:47:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:47:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:47:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:47:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:47:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:47:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:47:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:47:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:47:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:47:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:47:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:47:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:47:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:47:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-10 02:47:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-10 02:47:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-10 02:47:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-10 02:47:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:47:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__1 [2019-09-10 02:47:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__2 [2019-09-10 02:47:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:47:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:47:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:47:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:47:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:47:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:47:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:47:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:47:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:47:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:47:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:47:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:47:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:47:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:47:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:47:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:47:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:47:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:47:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:47:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:47:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:47:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:47:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:47:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:47:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:47:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:47:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:47:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-10 02:47:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-10 02:47:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-10 02:47:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-10 02:47:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-10 02:47:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-10 02:47:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:47:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-10 02:47:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-10 02:47:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-10 02:47:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-10 02:47:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-10 02:47:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:47:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:47:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:47:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:47:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:47:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:47:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:47:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:47:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:47:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:47:10,533 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:47:10,533 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:47:10,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:47:10 BoogieIcfgContainer [2019-09-10 02:47:10,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:47:10,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:47:10,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:47:10,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:47:10,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:47:06" (1/3) ... [2019-09-10 02:47:10,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c4e72a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:47:10, skipping insertion in model container [2019-09-10 02:47:10,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:08" (2/3) ... [2019-09-10 02:47:10,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c4e72a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:47:10, skipping insertion in model container [2019-09-10 02:47:10,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:47:10" (3/3) ... [2019-09-10 02:47:10,555 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product35.cil.c [2019-09-10 02:47:10,569 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:47:10,578 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:47:10,596 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:47:10,628 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:47:10,629 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:47:10,629 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:47:10,629 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:47:10,629 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:47:10,629 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:47:10,629 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:47:10,629 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:47:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states. [2019-09-10 02:47:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 02:47:10,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:10,714 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:47:10,719 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:10,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:10,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1796376026, now seen corresponding path program 1 times [2019-09-10 02:47:10,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:10,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:10,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:10,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:10,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:11,393 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 02:47:11,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:11,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:47:11,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:11,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:47:11,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:47:11,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:47:11,421 INFO L87 Difference]: Start difference. First operand 687 states. Second operand 2 states. [2019-09-10 02:47:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:11,493 INFO L93 Difference]: Finished difference Result 667 states and 901 transitions. [2019-09-10 02:47:11,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:47:11,495 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 167 [2019-09-10 02:47:11,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:11,522 INFO L225 Difference]: With dead ends: 667 [2019-09-10 02:47:11,522 INFO L226 Difference]: Without dead ends: 658 [2019-09-10 02:47:11,524 INFO L628 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-09-10 02:47:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-09-10 02:47:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2019-09-10 02:47:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-10 02:47:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 890 transitions. [2019-09-10 02:47:11,646 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 890 transitions. Word has length 167 [2019-09-10 02:47:11,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:11,648 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 890 transitions. [2019-09-10 02:47:11,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:47:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 890 transitions. [2019-09-10 02:47:11,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:47:11,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:11,657 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:47:11,658 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:11,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:11,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1669127173, now seen corresponding path program 1 times [2019-09-10 02:47:11,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:11,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:11,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:11,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:11,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 02:47:12,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:12,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:47:12,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:12,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:47:12,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:47:12,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:12,016 INFO L87 Difference]: Start difference. First operand 658 states and 890 transitions. Second operand 3 states. [2019-09-10 02:47:12,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:12,133 INFO L93 Difference]: Finished difference Result 661 states and 893 transitions. [2019-09-10 02:47:12,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:47:12,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 02:47:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:12,147 INFO L225 Difference]: With dead ends: 661 [2019-09-10 02:47:12,149 INFO L226 Difference]: Without dead ends: 661 [2019-09-10 02:47:12,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:12,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-09-10 02:47:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 660. [2019-09-10 02:47:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-10 02:47:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 892 transitions. [2019-09-10 02:47:12,194 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 892 transitions. Word has length 168 [2019-09-10 02:47:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:12,195 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 892 transitions. [2019-09-10 02:47:12,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:47:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 892 transitions. [2019-09-10 02:47:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 02:47:12,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:12,199 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:47:12,199 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:12,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:12,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1780408052, now seen corresponding path program 1 times [2019-09-10 02:47:12,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:12,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:12,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:12,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:12,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:12,349 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 02:47:12,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:12,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:47:12,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:12,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:47:12,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:47:12,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:12,351 INFO L87 Difference]: Start difference. First operand 660 states and 892 transitions. Second operand 3 states. [2019-09-10 02:47:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:12,382 INFO L93 Difference]: Finished difference Result 705 states and 968 transitions. [2019-09-10 02:47:12,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:47:12,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 02:47:12,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:12,388 INFO L225 Difference]: With dead ends: 705 [2019-09-10 02:47:12,389 INFO L226 Difference]: Without dead ends: 705 [2019-09-10 02:47:12,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-09-10 02:47:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 704. [2019-09-10 02:47:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-09-10 02:47:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 967 transitions. [2019-09-10 02:47:12,417 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 967 transitions. Word has length 180 [2019-09-10 02:47:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:12,418 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 967 transitions. [2019-09-10 02:47:12,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:47:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 967 transitions. [2019-09-10 02:47:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 02:47:12,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:12,423 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:47:12,423 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:12,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1102871673, now seen corresponding path program 1 times [2019-09-10 02:47:12,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:12,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:12,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:12,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:12,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 02:47:12,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:12,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:47:12,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:12,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:47:12,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:47:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:12,567 INFO L87 Difference]: Start difference. First operand 704 states and 967 transitions. Second operand 3 states. [2019-09-10 02:47:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:12,597 INFO L93 Difference]: Finished difference Result 790 states and 1112 transitions. [2019-09-10 02:47:12,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:47:12,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-10 02:47:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:12,604 INFO L225 Difference]: With dead ends: 790 [2019-09-10 02:47:12,604 INFO L226 Difference]: Without dead ends: 790 [2019-09-10 02:47:12,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-09-10 02:47:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 789. [2019-09-10 02:47:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-10 02:47:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1111 transitions. [2019-09-10 02:47:12,639 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1111 transitions. Word has length 181 [2019-09-10 02:47:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:12,639 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1111 transitions. [2019-09-10 02:47:12,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:47:12,640 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1111 transitions. [2019-09-10 02:47:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 02:47:12,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:12,645 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:47:12,645 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:12,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:12,646 INFO L82 PathProgramCache]: Analyzing trace with hash -441168396, now seen corresponding path program 1 times [2019-09-10 02:47:12,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:12,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:12,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:12,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:12,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 02:47:12,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:12,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:47:12,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:12,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:47:12,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:47:12,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:12,929 INFO L87 Difference]: Start difference. First operand 789 states and 1111 transitions. Second operand 3 states. [2019-09-10 02:47:12,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:12,956 INFO L93 Difference]: Finished difference Result 954 states and 1388 transitions. [2019-09-10 02:47:12,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:47:12,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 02:47:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:12,965 INFO L225 Difference]: With dead ends: 954 [2019-09-10 02:47:12,965 INFO L226 Difference]: Without dead ends: 954 [2019-09-10 02:47:12,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-09-10 02:47:12,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 953. [2019-09-10 02:47:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-09-10 02:47:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1387 transitions. [2019-09-10 02:47:13,000 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1387 transitions. Word has length 182 [2019-09-10 02:47:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:13,001 INFO L475 AbstractCegarLoop]: Abstraction has 953 states and 1387 transitions. [2019-09-10 02:47:13,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:47:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1387 transitions. [2019-09-10 02:47:13,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 02:47:13,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:13,006 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:47:13,007 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:13,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:13,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1717289379, now seen corresponding path program 1 times [2019-09-10 02:47:13,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:13,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:13,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:13,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:13,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:13,185 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:47:13,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:13,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:47:13,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:13,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:47:13,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:47:13,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:13,187 INFO L87 Difference]: Start difference. First operand 953 states and 1387 transitions. Second operand 3 states. [2019-09-10 02:47:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:13,217 INFO L93 Difference]: Finished difference Result 1094 states and 1587 transitions. [2019-09-10 02:47:13,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:47:13,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-10 02:47:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:13,224 INFO L225 Difference]: With dead ends: 1094 [2019-09-10 02:47:13,224 INFO L226 Difference]: Without dead ends: 1094 [2019-09-10 02:47:13,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-09-10 02:47:13,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1093. [2019-09-10 02:47:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1093 states. [2019-09-10 02:47:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1584 transitions. [2019-09-10 02:47:13,286 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1584 transitions. Word has length 184 [2019-09-10 02:47:13,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:13,288 INFO L475 AbstractCegarLoop]: Abstraction has 1093 states and 1584 transitions. [2019-09-10 02:47:13,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:47:13,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1584 transitions. [2019-09-10 02:47:13,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-10 02:47:13,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:13,297 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:47:13,298 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:13,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:13,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1766872220, now seen corresponding path program 1 times [2019-09-10 02:47:13,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:13,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:13,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:13,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:13,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:13,634 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-10 02:47:13,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:13,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:47:13,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:13,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:47:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:47:13,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:47:13,637 INFO L87 Difference]: Start difference. First operand 1093 states and 1584 transitions. Second operand 6 states. [2019-09-10 02:47:14,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:14,605 INFO L93 Difference]: Finished difference Result 2137 states and 3120 transitions. [2019-09-10 02:47:14,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:47:14,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 340 [2019-09-10 02:47:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:14,620 INFO L225 Difference]: With dead ends: 2137 [2019-09-10 02:47:14,620 INFO L226 Difference]: Without dead ends: 2137 [2019-09-10 02:47:14,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:47:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-09-10 02:47:14,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2126. [2019-09-10 02:47:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-09-10 02:47:14,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 3110 transitions. [2019-09-10 02:47:14,712 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 3110 transitions. Word has length 340 [2019-09-10 02:47:14,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:14,714 INFO L475 AbstractCegarLoop]: Abstraction has 2126 states and 3110 transitions. [2019-09-10 02:47:14,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:47:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 3110 transitions. [2019-09-10 02:47:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-10 02:47:14,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:14,730 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:47:14,730 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:14,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:14,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1623250226, now seen corresponding path program 1 times [2019-09-10 02:47:14,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:14,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:14,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:14,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:14,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-10 02:47:15,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:15,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:47:15,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:15,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:47:15,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:47:15,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:47:15,085 INFO L87 Difference]: Start difference. First operand 2126 states and 3110 transitions. Second operand 11 states. [2019-09-10 02:47:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:15,607 INFO L93 Difference]: Finished difference Result 2114 states and 3080 transitions. [2019-09-10 02:47:15,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:47:15,607 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 341 [2019-09-10 02:47:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:15,621 INFO L225 Difference]: With dead ends: 2114 [2019-09-10 02:47:15,621 INFO L226 Difference]: Without dead ends: 2100 [2019-09-10 02:47:15,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:47:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-09-10 02:47:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2096. [2019-09-10 02:47:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2019-09-10 02:47:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3059 transitions. [2019-09-10 02:47:15,711 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 3059 transitions. Word has length 341 [2019-09-10 02:47:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:15,713 INFO L475 AbstractCegarLoop]: Abstraction has 2096 states and 3059 transitions. [2019-09-10 02:47:15,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:47:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3059 transitions. [2019-09-10 02:47:15,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-10 02:47:15,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:15,734 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:47:15,734 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:15,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:15,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1406225433, now seen corresponding path program 1 times [2019-09-10 02:47:15,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:15,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:15,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:15,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:15,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-10 02:47:16,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:16,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:47:16,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:16,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:47:16,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:47:16,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:16,013 INFO L87 Difference]: Start difference. First operand 2096 states and 3059 transitions. Second operand 3 states. [2019-09-10 02:47:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:16,054 INFO L93 Difference]: Finished difference Result 2730 states and 4125 transitions. [2019-09-10 02:47:16,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:47:16,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2019-09-10 02:47:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:16,072 INFO L225 Difference]: With dead ends: 2730 [2019-09-10 02:47:16,073 INFO L226 Difference]: Without dead ends: 2730 [2019-09-10 02:47:16,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:16,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2019-09-10 02:47:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2728. [2019-09-10 02:47:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2019-09-10 02:47:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 4123 transitions. [2019-09-10 02:47:16,236 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 4123 transitions. Word has length 381 [2019-09-10 02:47:16,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:16,237 INFO L475 AbstractCegarLoop]: Abstraction has 2728 states and 4123 transitions. [2019-09-10 02:47:16,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:47:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 4123 transitions. [2019-09-10 02:47:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-10 02:47:16,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:16,262 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:47:16,262 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1962098209, now seen corresponding path program 1 times [2019-09-10 02:47:16,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:16,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:16,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:16,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:16,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-10 02:47:16,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:16,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:47:16,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:16,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:47:16,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:47:16,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:16,486 INFO L87 Difference]: Start difference. First operand 2728 states and 4123 transitions. Second operand 3 states. [2019-09-10 02:47:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:16,528 INFO L93 Difference]: Finished difference Result 3946 states and 6157 transitions. [2019-09-10 02:47:16,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:47:16,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 367 [2019-09-10 02:47:16,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:16,554 INFO L225 Difference]: With dead ends: 3946 [2019-09-10 02:47:16,555 INFO L226 Difference]: Without dead ends: 3946 [2019-09-10 02:47:16,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2019-09-10 02:47:16,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3944. [2019-09-10 02:47:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3944 states. [2019-09-10 02:47:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 6155 transitions. [2019-09-10 02:47:16,691 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 6155 transitions. Word has length 367 [2019-09-10 02:47:16,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:16,692 INFO L475 AbstractCegarLoop]: Abstraction has 3944 states and 6155 transitions. [2019-09-10 02:47:16,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:47:16,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 6155 transitions. [2019-09-10 02:47:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-09-10 02:47:16,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:16,718 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:47:16,718 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:16,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:16,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1166569383, now seen corresponding path program 1 times [2019-09-10 02:47:16,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:16,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:16,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:16,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:16,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-10 02:47:17,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:17,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:47:17,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:17,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:47:17,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:47:17,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:17,019 INFO L87 Difference]: Start difference. First operand 3944 states and 6155 transitions. Second operand 3 states. [2019-09-10 02:47:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:17,066 INFO L93 Difference]: Finished difference Result 6282 states and 10029 transitions. [2019-09-10 02:47:17,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:47:17,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2019-09-10 02:47:17,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:17,108 INFO L225 Difference]: With dead ends: 6282 [2019-09-10 02:47:17,108 INFO L226 Difference]: Without dead ends: 6282 [2019-09-10 02:47:17,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:17,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6282 states. [2019-09-10 02:47:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6282 to 6280. [2019-09-10 02:47:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2019-09-10 02:47:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 10027 transitions. [2019-09-10 02:47:17,337 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 10027 transitions. Word has length 383 [2019-09-10 02:47:17,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:17,338 INFO L475 AbstractCegarLoop]: Abstraction has 6280 states and 10027 transitions. [2019-09-10 02:47:17,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:47:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 10027 transitions. [2019-09-10 02:47:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-09-10 02:47:17,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:17,395 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:47:17,396 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:17,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:17,397 INFO L82 PathProgramCache]: Analyzing trace with hash -463136878, now seen corresponding path program 1 times [2019-09-10 02:47:17,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:17,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:17,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-10 02:47:17,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:17,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:47:17,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:17,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:47:17,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:47:17,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:17,874 INFO L87 Difference]: Start difference. First operand 6280 states and 10027 transitions. Second operand 3 states. [2019-09-10 02:47:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:17,951 INFO L93 Difference]: Finished difference Result 10762 states and 17389 transitions. [2019-09-10 02:47:17,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:47:17,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 384 [2019-09-10 02:47:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:18,027 INFO L225 Difference]: With dead ends: 10762 [2019-09-10 02:47:18,027 INFO L226 Difference]: Without dead ends: 10762 [2019-09-10 02:47:18,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:47:18,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10762 states. [2019-09-10 02:47:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10762 to 10760. [2019-09-10 02:47:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10760 states. [2019-09-10 02:47:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10760 states to 10760 states and 17387 transitions. [2019-09-10 02:47:18,353 INFO L78 Accepts]: Start accepts. Automaton has 10760 states and 17387 transitions. Word has length 384 [2019-09-10 02:47:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:18,353 INFO L475 AbstractCegarLoop]: Abstraction has 10760 states and 17387 transitions. [2019-09-10 02:47:18,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:47:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 10760 states and 17387 transitions. [2019-09-10 02:47:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-10 02:47:18,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:18,431 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:47:18,431 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:18,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2032256724, now seen corresponding path program 1 times [2019-09-10 02:47:18,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:18,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:18,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:18,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:18,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-10 02:47:19,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:47:19,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:47:19,036 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 350 with the following transitions: [2019-09-10 02:47:19,040 INFO L207 CegarAbsIntRunner]: [29], [30], [44], [47], [54], [56], [72], [75], [85], [116], [119], [129], [130], [133], [138], [140], [142], [146], [149], [163], [164], [166], [276], [278], [281], [282], [285], [286], [287], [290], [296], [297], [298], [318], [321], [327], [329], [332], [334], [336], [343], [346], [347], [349], [360], [363], [372], [373], [375], [378], [382], [383], [385], [386], [389], [399], [400], [401], [428], [430], [442], [464], [466], [486], [489], [659], [661], [662], [663], [664], [666], [667], [673], [676], [678], [683], [687], [689], [722], [725], [739], [768], [769], [780], [782], [784], [786], [797], [799], [802], [806], [820], [824], [827], [845], [848], [872], [875], [885], [886], [889], [914], [917], [920], [929], [933], [935], [937], [940], [947], [954], [957], [959], [1097], [1099], [1116], [1119], [1120], [1123], [1137], [1245], [1317], [1320], [1321], [1332], [1335], [1336], [1339], [1342], [1373], [1376], [1378], [1380], [1447], [1450], [1460], [1461], [1464], [1470], [1491], [1494], [1508], [1514], [1517], [1526], [1540], [1541], [1720], [1722], [1724], [1726], [1727], [1739], [1740], [1741], [1742], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1773], [1774], [1775], [1776], [1777], [1778], [1781], [1782], [1783], [1784], [1785], [1786], [1787], [1788], [1789], [1790], [1797], [1798], [1799], [1800], [1803], [1804], [1805], [1806], [1811], [1812], [1813], [1814], [1819], [1820], [1823], [1824], [1829], [1830], [1843], [1844], [1845], [1846], [1847], [1848], [1869], [1870], [1871], [1872], [1879], [1880], [1881], [1891], [1892], [1893], [1894], [1895], [1896], [1897], [1898], [1903], [1904], [1905], [1906], [1907], [1908], [1909], [1910], [1911], [1913], [1914], [1915], [1916], [1937], [1938], [1939], [1940], [1951], [1952], [1957], [1958], [1977], [1979], [1980], [1997], [1998], [1999], [2000], [2001], [2002], [2003], [2004], [2005], [2006], [2007], [2008], [2009], [2010], [2029], [2030], [2031], [2032], [2033], [2034], [2035], [2036], [2037] [2019-09-10 02:47:19,134 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:47:19,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:47:19,386 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:47:19,387 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 216 root evaluator evaluations with a maximum evaluation depth of 0. Performed 216 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 398 variables. [2019-09-10 02:47:19,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:19,393 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:47:19,554 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:47:19,554 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:47:19,569 INFO L420 sIntCurrentIteration]: We unified 348 AI predicates to 348 [2019-09-10 02:47:19,569 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:47:19,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:47:19,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [22] total 22 [2019-09-10 02:47:19,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:19,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:47:19,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:47:19,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:47:19,573 INFO L87 Difference]: Start difference. First operand 10760 states and 17387 transitions. Second operand 2 states. [2019-09-10 02:47:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:19,573 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:47:19,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:47:19,573 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 349 [2019-09-10 02:47:19,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:19,574 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:47:19,574 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:47:19,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 348 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-09-10 02:47:19,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:47:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:47:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:47:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:47:19,575 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 349 [2019-09-10 02:47:19,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:19,575 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:47:19,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:47:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:47:19,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:47:19,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:47:19 BoogieIcfgContainer [2019-09-10 02:47:19,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:47:19,584 INFO L168 Benchmark]: Toolchain (without parser) took 12841.61 ms. Allocated memory was 136.3 MB in the beginning and 699.9 MB in the end (delta: 563.6 MB). Free memory was 88.1 MB in the beginning and 559.5 MB in the end (delta: -471.3 MB). Peak memory consumption was 92.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:47:19,586 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 136.3 MB. Free memory was 109.6 MB in the beginning and 109.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-10 02:47:19,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1281.74 ms. Allocated memory was 136.3 MB in the beginning and 205.0 MB in the end (delta: 68.7 MB). Free memory was 87.9 MB in the beginning and 128.9 MB in the end (delta: -41.0 MB). Peak memory consumption was 36.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:47:19,593 INFO L168 Benchmark]: Boogie Preprocessor took 210.75 ms. Allocated memory is still 205.0 MB. Free memory was 128.3 MB in the beginning and 118.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:47:19,594 INFO L168 Benchmark]: RCFGBuilder took 2299.38 ms. Allocated memory was 205.0 MB in the beginning and 256.9 MB in the end (delta: 51.9 MB). Free memory was 118.9 MB in the beginning and 118.1 MB in the end (delta: 806.8 kB). Peak memory consumption was 75.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:47:19,595 INFO L168 Benchmark]: TraceAbstraction took 9044.98 ms. Allocated memory was 256.9 MB in the beginning and 699.9 MB in the end (delta: 443.0 MB). Free memory was 116.2 MB in the beginning and 559.5 MB in the end (delta: -443.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 02:47:19,609 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.29 ms. Allocated memory is still 136.3 MB. Free memory was 109.6 MB in the beginning and 109.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1281.74 ms. Allocated memory was 136.3 MB in the beginning and 205.0 MB in the end (delta: 68.7 MB). Free memory was 87.9 MB in the beginning and 128.9 MB in the end (delta: -41.0 MB). Peak memory consumption was 36.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 210.75 ms. Allocated memory is still 205.0 MB. Free memory was 128.3 MB in the beginning and 118.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2299.38 ms. Allocated memory was 205.0 MB in the beginning and 256.9 MB in the end (delta: 51.9 MB). Free memory was 118.9 MB in the beginning and 118.1 MB in the end (delta: 806.8 kB). Peak memory consumption was 75.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9044.98 ms. Allocated memory was 256.9 MB in the beginning and 699.9 MB in the end (delta: 443.0 MB). Free memory was 116.2 MB in the beginning and 559.5 MB in the end (delta: -443.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2047]: 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 122 procedures, 846 locations, 1 error locations. SAFE Result, 8.9s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10954 SDtfs, 2648 SDslu, 18273 SDs, 0 SdLazy, 524 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10760occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.8218390804597702 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 28 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 3607 NumberOfCodeBlocks, 3607 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3594 ConstructedInterpolants, 0 QuantifiedInterpolants, 1306132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1040/1051 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...