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_spec0_product10.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:36:51,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:36:51,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:36:51,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:36:51,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:36:51,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:36:51,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:36:51,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:36:51,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:36:51,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:36:51,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:36:51,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:36:51,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:36:51,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:36:51,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:36:51,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:36:51,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:36:51,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:36:51,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:36:51,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:36:51,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:36:51,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:36:51,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:36:51,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:36:51,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:36:51,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:36:51,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:36:51,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:36:51,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:36:51,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:36:51,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:36:51,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:36:51,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:36:51,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:36:51,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:36:51,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:36:51,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:36:51,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:36:51,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:36:51,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:36:51,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:36:51,848 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:36:51,864 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:36:51,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:36:51,865 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:36:51,865 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:36:51,866 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:36:51,866 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:36:51,866 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:36:51,866 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:36:51,866 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:36:51,867 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:36:51,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:36:51,868 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:36:51,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:36:51,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:36:51,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:36:51,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:36:51,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:36:51,869 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:36:51,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:36:51,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:36:51,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:36:51,870 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:36:51,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:36:51,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:36:51,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:36:51,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:36:51,871 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:36:51,871 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:36:51,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:36:51,871 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:36:51,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:36:51,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:36:51,916 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:36:51,918 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:36:51,918 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:36:51,919 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product10.cil.c [2019-09-10 02:36:51,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36ab7b49/fcd9b9099e644ec696886421481f32fd/FLAG1e55d1c44 [2019-09-10 02:36:52,570 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:36:52,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product10.cil.c [2019-09-10 02:36:52,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36ab7b49/fcd9b9099e644ec696886421481f32fd/FLAG1e55d1c44 [2019-09-10 02:36:52,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36ab7b49/fcd9b9099e644ec696886421481f32fd [2019-09-10 02:36:52,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:36:52,768 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:36:52,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:36:52,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:36:52,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:36:52,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:36:52" (1/1) ... [2019-09-10 02:36:52,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5c848a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:52, skipping insertion in model container [2019-09-10 02:36:52,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:36:52" (1/1) ... [2019-09-10 02:36:52,787 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:36:52,869 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:36:53,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:36:53,474 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:36:53,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:36:53,714 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:36:53,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:53 WrapperNode [2019-09-10 02:36:53,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:36:53,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:36:53,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:36:53,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:36:53,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:53" (1/1) ... [2019-09-10 02:36:53,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:53" (1/1) ... [2019-09-10 02:36:53,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:53" (1/1) ... [2019-09-10 02:36:53,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:53" (1/1) ... [2019-09-10 02:36:53,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:53" (1/1) ... [2019-09-10 02:36:53,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:53" (1/1) ... [2019-09-10 02:36:53,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:53" (1/1) ... [2019-09-10 02:36:53,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:36:53,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:36:53,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:36:53,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:36:53,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:53" (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:36:53,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:36:53,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:36:53,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:36:53,977 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:36:53,978 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:36:53,978 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:36:53,978 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:36:53,978 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:36:53,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:36:53,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-09-10 02:36:53,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:36:53,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:36:53,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:36:53,980 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:36:53,980 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:36:53,980 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:36:53,980 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:36:53,981 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:36:53,981 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:36:53,981 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Base [2019-09-10 02:36:53,981 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2019-09-10 02:36:53,981 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:36:53,982 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:36:53,982 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:36:53,982 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:36:53,982 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:36:53,982 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:36:53,982 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:36:53,983 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-10 02:36:53,983 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-10 02:36:53,983 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:36:53,983 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:36:53,983 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:36:53,984 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:36:53,984 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:36:53,984 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:36:53,984 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:36:53,984 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-10 02:36:53,984 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-10 02:36:53,984 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:36:53,985 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:36:53,985 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:36:53,985 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:36:53,985 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:36:53,985 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:36:53,985 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:36:53,986 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:36:53,986 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:36:53,986 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:36:53,986 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:36:53,986 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:36:53,986 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:36:53,987 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:36:53,987 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:36:53,987 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:36:53,987 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:36:53,987 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:36:53,987 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:36:53,987 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:36:53,988 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:36:53,988 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:36:53,988 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:36:53,988 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:36:53,988 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:36:53,988 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:36:53,989 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:36:53,989 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:36:53,989 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:36:53,989 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:36:53,989 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:36:53,989 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:36:53,989 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:36:53,990 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:36:53,990 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:36:53,990 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:36:53,990 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:36:53,990 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:36:53,990 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:36:53,991 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:36:53,991 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:36:53,991 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:36:53,991 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:36:53,991 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:36:53,991 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:36:53,992 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:36:53,992 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:36:53,992 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:36:53,992 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:36:53,992 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:36:53,992 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:36:53,993 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:36:53,993 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:36:53,993 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:36:53,993 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:36:53,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:36:53,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:36:53,994 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:36:53,994 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:36:53,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:36:53,994 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:36:53,994 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:36:53,994 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:36:53,994 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:36:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:36:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:36:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:36:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-09-10 02:36:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:36:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:36:53,996 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:36:53,996 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:36:53,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:36:53,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:36:53,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:36:53,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:36:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:36:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:36:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:36:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:36:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:36:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:36:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:36:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:36:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:36:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:36:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:36:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:36:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:36:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:36:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:36:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:36:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:36:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:36:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:36:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:36:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:36:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:36:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:36:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:36:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:36:54,001 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:36:54,001 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:36:54,001 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:36:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-10 02:36:54,005 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-10 02:36:54,005 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Base [2019-09-10 02:36:54,005 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2019-09-10 02:36:54,005 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:36:54,006 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:36:54,006 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:36:54,006 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:36:54,006 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:36:54,006 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:36:54,007 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:36:54,007 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:36:54,007 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:36:54,007 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:36:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:36:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-10 02:36:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-10 02:36:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:36:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:36:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:36:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:36:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:36:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:36:54,010 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:36:54,010 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:36:54,010 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:36:54,010 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:36:54,011 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:36:54,011 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:36:54,011 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:36:54,011 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:36:54,011 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:36:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:36:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:36:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:36:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:36:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:36:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:36:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:36:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:36:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:36:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:36:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:36:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:36:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:36:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:36:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:36:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:36:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:36:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:36:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:36:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:36:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:36:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:36:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:36:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:36:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:36:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:36:54,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:36:54,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:36:56,218 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:36:56,219 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:36:56,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:36:56 BoogieIcfgContainer [2019-09-10 02:36:56,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:36:56,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:36:56,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:36:56,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:36:56,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:36:52" (1/3) ... [2019-09-10 02:36:56,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ac64ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:36:56, skipping insertion in model container [2019-09-10 02:36:56,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:53" (2/3) ... [2019-09-10 02:36:56,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ac64ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:36:56, skipping insertion in model container [2019-09-10 02:36:56,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:36:56" (3/3) ... [2019-09-10 02:36:56,235 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product10.cil.c [2019-09-10 02:36:56,245 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:36:56,255 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:36:56,272 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:36:56,306 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:36:56,306 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:36:56,306 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:36:56,306 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:36:56,306 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:36:56,307 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:36:56,307 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:36:56,307 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:36:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states. [2019-09-10 02:36:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 02:36:56,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:56,371 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:56,375 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:56,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:56,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1528307460, now seen corresponding path program 1 times [2019-09-10 02:36:56,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:56,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:56,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:56,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:56,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:36:56,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:56,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:36:56,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:56,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:36:56,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:36:56,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:36:57,002 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 2 states. [2019-09-10 02:36:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:57,076 INFO L93 Difference]: Finished difference Result 256 states and 320 transitions. [2019-09-10 02:36:57,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:36:57,079 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 141 [2019-09-10 02:36:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:57,109 INFO L225 Difference]: With dead ends: 256 [2019-09-10 02:36:57,109 INFO L226 Difference]: Without dead ends: 247 [2019-09-10 02:36:57,112 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:36:57,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-10 02:36:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-09-10 02:36:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-10 02:36:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2019-09-10 02:36:57,214 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 141 [2019-09-10 02:36:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:57,216 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2019-09-10 02:36:57,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:36:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2019-09-10 02:36:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 02:36:57,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:57,234 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:57,234 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:57,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:57,238 INFO L82 PathProgramCache]: Analyzing trace with hash 842452669, now seen corresponding path program 1 times [2019-09-10 02:36:57,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:57,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:57,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:57,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:57,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:36:57,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:57,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:36:57,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:57,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:36:57,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:36:57,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:36:57,426 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand 3 states. [2019-09-10 02:36:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:57,461 INFO L93 Difference]: Finished difference Result 250 states and 312 transitions. [2019-09-10 02:36:57,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:36:57,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-10 02:36:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:57,465 INFO L225 Difference]: With dead ends: 250 [2019-09-10 02:36:57,466 INFO L226 Difference]: Without dead ends: 250 [2019-09-10 02:36:57,467 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:36:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-10 02:36:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-09-10 02:36:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-10 02:36:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 311 transitions. [2019-09-10 02:36:57,496 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 311 transitions. Word has length 142 [2019-09-10 02:36:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:57,499 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 311 transitions. [2019-09-10 02:36:57,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:36:57,499 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 311 transitions. [2019-09-10 02:36:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 02:36:57,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:57,502 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:57,502 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:57,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:57,502 INFO L82 PathProgramCache]: Analyzing trace with hash 515777855, now seen corresponding path program 1 times [2019-09-10 02:36:57,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:57,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:57,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:36:57,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:57,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:57,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:57,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:57,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:57,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:57,806 INFO L87 Difference]: Start difference. First operand 249 states and 311 transitions. Second operand 6 states. [2019-09-10 02:36:58,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:58,249 INFO L93 Difference]: Finished difference Result 458 states and 579 transitions. [2019-09-10 02:36:58,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:36:58,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-09-10 02:36:58,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:58,256 INFO L225 Difference]: With dead ends: 458 [2019-09-10 02:36:58,256 INFO L226 Difference]: Without dead ends: 458 [2019-09-10 02:36:58,257 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:36:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-10 02:36:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 449. [2019-09-10 02:36:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-10 02:36:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 571 transitions. [2019-09-10 02:36:58,288 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 571 transitions. Word has length 147 [2019-09-10 02:36:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:58,289 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 571 transitions. [2019-09-10 02:36:58,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 571 transitions. [2019-09-10 02:36:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 02:36:58,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:58,292 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:58,292 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:58,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:58,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1213124858, now seen corresponding path program 1 times [2019-09-10 02:36:58,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:58,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:58,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:58,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:58,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:36:58,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:58,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:36:58,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:58,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:36:58,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:36:58,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:36:58,563 INFO L87 Difference]: Start difference. First operand 449 states and 571 transitions. Second operand 9 states. [2019-09-10 02:36:58,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:58,738 INFO L93 Difference]: Finished difference Result 479 states and 610 transitions. [2019-09-10 02:36:58,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:36:58,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2019-09-10 02:36:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:58,743 INFO L225 Difference]: With dead ends: 479 [2019-09-10 02:36:58,743 INFO L226 Difference]: Without dead ends: 479 [2019-09-10 02:36:58,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:36:58,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-10 02:36:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 469. [2019-09-10 02:36:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-09-10 02:36:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 597 transitions. [2019-09-10 02:36:58,770 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 597 transitions. Word has length 148 [2019-09-10 02:36:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:58,771 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 597 transitions. [2019-09-10 02:36:58,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:36:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 597 transitions. [2019-09-10 02:36:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 02:36:58,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:58,775 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:58,775 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:58,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:58,775 INFO L82 PathProgramCache]: Analyzing trace with hash -932352255, now seen corresponding path program 1 times [2019-09-10 02:36:58,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:58,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:58,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:58,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:58,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:36:58,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:58,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:58,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:58,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:58,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:58,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:58,966 INFO L87 Difference]: Start difference. First operand 469 states and 597 transitions. Second operand 6 states. [2019-09-10 02:36:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:59,308 INFO L93 Difference]: Finished difference Result 910 states and 1165 transitions. [2019-09-10 02:36:59,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:36:59,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-09-10 02:36:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:59,315 INFO L225 Difference]: With dead ends: 910 [2019-09-10 02:36:59,316 INFO L226 Difference]: Without dead ends: 910 [2019-09-10 02:36:59,316 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:36:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-09-10 02:36:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 889. [2019-09-10 02:36:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-09-10 02:36:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1145 transitions. [2019-09-10 02:36:59,360 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1145 transitions. Word has length 149 [2019-09-10 02:36:59,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:59,361 INFO L475 AbstractCegarLoop]: Abstraction has 889 states and 1145 transitions. [2019-09-10 02:36:59,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1145 transitions. [2019-09-10 02:36:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 02:36:59,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:59,365 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:59,365 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1577191424, now seen corresponding path program 1 times [2019-09-10 02:36:59,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:59,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:59,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:36:59,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:59,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:36:59,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:59,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:36:59,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:36:59,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:36:59,573 INFO L87 Difference]: Start difference. First operand 889 states and 1145 transitions. Second operand 9 states. [2019-09-10 02:36:59,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:59,734 INFO L93 Difference]: Finished difference Result 949 states and 1223 transitions. [2019-09-10 02:36:59,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:36:59,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2019-09-10 02:36:59,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:59,743 INFO L225 Difference]: With dead ends: 949 [2019-09-10 02:36:59,743 INFO L226 Difference]: Without dead ends: 949 [2019-09-10 02:36:59,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:36:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-09-10 02:36:59,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 929. [2019-09-10 02:36:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-10 02:36:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1197 transitions. [2019-09-10 02:36:59,793 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1197 transitions. Word has length 150 [2019-09-10 02:36:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:59,794 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 1197 transitions. [2019-09-10 02:36:59,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:36:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1197 transitions. [2019-09-10 02:36:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 02:36:59,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:59,800 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:59,801 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:59,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:59,801 INFO L82 PathProgramCache]: Analyzing trace with hash 671950143, now seen corresponding path program 1 times [2019-09-10 02:36:59,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:59,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:59,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:59,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:59,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:36:59,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:59,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:59,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:59,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:59,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:59,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:59,941 INFO L87 Difference]: Start difference. First operand 929 states and 1197 transitions. Second operand 6 states. [2019-09-10 02:37:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:00,329 INFO L93 Difference]: Finished difference Result 1802 states and 2332 transitions. [2019-09-10 02:37:00,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:37:00,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2019-09-10 02:37:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:00,344 INFO L225 Difference]: With dead ends: 1802 [2019-09-10 02:37:00,345 INFO L226 Difference]: Without dead ends: 1661 [2019-09-10 02:37:00,345 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:37:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2019-09-10 02:37:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1628. [2019-09-10 02:37:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-09-10 02:37:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2130 transitions. [2019-09-10 02:37:00,500 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2130 transitions. Word has length 151 [2019-09-10 02:37:00,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:00,500 INFO L475 AbstractCegarLoop]: Abstraction has 1628 states and 2130 transitions. [2019-09-10 02:37:00,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:37:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2130 transitions. [2019-09-10 02:37:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 02:37:00,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:00,506 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:00,507 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:00,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:00,507 INFO L82 PathProgramCache]: Analyzing trace with hash -680126903, now seen corresponding path program 1 times [2019-09-10 02:37:00,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:00,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:00,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:00,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:00,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:37:00,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:00,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:00,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:00,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:00,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:00,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:00,677 INFO L87 Difference]: Start difference. First operand 1628 states and 2130 transitions. Second operand 3 states. [2019-09-10 02:37:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:00,704 INFO L93 Difference]: Finished difference Result 1859 states and 2554 transitions. [2019-09-10 02:37:00,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:00,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-10 02:37:00,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:00,715 INFO L225 Difference]: With dead ends: 1859 [2019-09-10 02:37:00,715 INFO L226 Difference]: Without dead ends: 1859 [2019-09-10 02:37:00,716 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:37:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2019-09-10 02:37:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1852. [2019-09-10 02:37:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1852 states. [2019-09-10 02:37:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2547 transitions. [2019-09-10 02:37:00,796 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2547 transitions. Word has length 161 [2019-09-10 02:37:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:00,796 INFO L475 AbstractCegarLoop]: Abstraction has 1852 states and 2547 transitions. [2019-09-10 02:37:00,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2547 transitions. [2019-09-10 02:37:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 02:37:00,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:00,803 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:00,805 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:00,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:00,806 INFO L82 PathProgramCache]: Analyzing trace with hash -98177292, now seen corresponding path program 1 times [2019-09-10 02:37:00,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:00,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:00,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:00,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:00,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:37:00,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:00,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:00,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:00,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:00,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:00,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:00,923 INFO L87 Difference]: Start difference. First operand 1852 states and 2547 transitions. Second operand 3 states. [2019-09-10 02:37:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:00,953 INFO L93 Difference]: Finished difference Result 2267 states and 3316 transitions. [2019-09-10 02:37:00,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:00,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-09-10 02:37:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:00,966 INFO L225 Difference]: With dead ends: 2267 [2019-09-10 02:37:00,967 INFO L226 Difference]: Without dead ends: 2267 [2019-09-10 02:37:00,967 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:37:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2019-09-10 02:37:01,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2260. [2019-09-10 02:37:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2019-09-10 02:37:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3309 transitions. [2019-09-10 02:37:01,058 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3309 transitions. Word has length 162 [2019-09-10 02:37:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:01,058 INFO L475 AbstractCegarLoop]: Abstraction has 2260 states and 3309 transitions. [2019-09-10 02:37:01,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3309 transitions. [2019-09-10 02:37:01,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 02:37:01,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:01,066 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:01,066 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:01,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:01,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1588640761, now seen corresponding path program 1 times [2019-09-10 02:37:01,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:01,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:01,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:01,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:01,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:37:01,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:01,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:01,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:01,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:01,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:01,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:01,170 INFO L87 Difference]: Start difference. First operand 2260 states and 3309 transitions. Second operand 3 states. [2019-09-10 02:37:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:01,205 INFO L93 Difference]: Finished difference Result 3099 states and 4840 transitions. [2019-09-10 02:37:01,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:01,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-10 02:37:01,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:01,226 INFO L225 Difference]: With dead ends: 3099 [2019-09-10 02:37:01,226 INFO L226 Difference]: Without dead ends: 3099 [2019-09-10 02:37:01,227 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:37:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2019-09-10 02:37:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3092. [2019-09-10 02:37:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-09-10 02:37:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4833 transitions. [2019-09-10 02:37:01,352 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4833 transitions. Word has length 163 [2019-09-10 02:37:01,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:01,352 INFO L475 AbstractCegarLoop]: Abstraction has 3092 states and 4833 transitions. [2019-09-10 02:37:01,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4833 transitions. [2019-09-10 02:37:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 02:37:01,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:01,363 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:01,363 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:01,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:01,364 INFO L82 PathProgramCache]: Analyzing trace with hash -66197772, now seen corresponding path program 1 times [2019-09-10 02:37:01,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:01,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:01,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:01,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:01,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:37:01,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:01,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:01,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:01,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:01,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:01,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:01,522 INFO L87 Difference]: Start difference. First operand 3092 states and 4833 transitions. Second operand 3 states. [2019-09-10 02:37:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:01,569 INFO L93 Difference]: Finished difference Result 4731 states and 7792 transitions. [2019-09-10 02:37:01,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:01,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-10 02:37:01,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:01,601 INFO L225 Difference]: With dead ends: 4731 [2019-09-10 02:37:01,602 INFO L226 Difference]: Without dead ends: 4731 [2019-09-10 02:37:01,602 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:37:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2019-09-10 02:37:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 4724. [2019-09-10 02:37:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2019-09-10 02:37:01,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 7785 transitions. [2019-09-10 02:37:01,757 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 7785 transitions. Word has length 164 [2019-09-10 02:37:01,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:01,758 INFO L475 AbstractCegarLoop]: Abstraction has 4724 states and 7785 transitions. [2019-09-10 02:37:01,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 7785 transitions. [2019-09-10 02:37:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 02:37:01,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:01,774 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:01,774 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:01,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2084030075, now seen corresponding path program 1 times [2019-09-10 02:37:01,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:01,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:01,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:37:01,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:01,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:01,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:01,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:01,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:01,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:01,871 INFO L87 Difference]: Start difference. First operand 4724 states and 7785 transitions. Second operand 3 states. [2019-09-10 02:37:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:01,925 INFO L93 Difference]: Finished difference Result 7931 states and 13504 transitions. [2019-09-10 02:37:01,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:01,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-10 02:37:01,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:01,972 INFO L225 Difference]: With dead ends: 7931 [2019-09-10 02:37:01,973 INFO L226 Difference]: Without dead ends: 7931 [2019-09-10 02:37:01,973 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:37:01,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2019-09-10 02:37:02,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7924. [2019-09-10 02:37:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7924 states. [2019-09-10 02:37:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7924 states to 7924 states and 13497 transitions. [2019-09-10 02:37:02,363 INFO L78 Accepts]: Start accepts. Automaton has 7924 states and 13497 transitions. Word has length 165 [2019-09-10 02:37:02,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:02,364 INFO L475 AbstractCegarLoop]: Abstraction has 7924 states and 13497 transitions. [2019-09-10 02:37:02,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 7924 states and 13497 transitions. [2019-09-10 02:37:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 02:37:02,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:02,392 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:02,392 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:02,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2079468918, now seen corresponding path program 1 times [2019-09-10 02:37:02,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:02,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:02,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:02,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:02,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:37:02,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:02,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:37:02,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:02,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:37:02,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:37:02,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:37:02,558 INFO L87 Difference]: Start difference. First operand 7924 states and 13497 transitions. Second operand 8 states. [2019-09-10 02:37:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:02,631 INFO L93 Difference]: Finished difference Result 7921 states and 13488 transitions. [2019-09-10 02:37:02,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:37:02,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-09-10 02:37:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:02,633 INFO L225 Difference]: With dead ends: 7921 [2019-09-10 02:37:02,633 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:37:02,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:37:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:37:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:37:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:37:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:37:02,634 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 166 [2019-09-10 02:37:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:02,634 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:37:02,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:37:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:37:02,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:37:02,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:37:02 BoogieIcfgContainer [2019-09-10 02:37:02,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:37:02,643 INFO L168 Benchmark]: Toolchain (without parser) took 9873.57 ms. Allocated memory was 134.2 MB in the beginning and 444.6 MB in the end (delta: 310.4 MB). Free memory was 86.7 MB in the beginning and 274.7 MB in the end (delta: -188.0 MB). Peak memory consumption was 122.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:37:02,643 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 02:37:02,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 945.76 ms. Allocated memory was 134.2 MB in the beginning and 203.4 MB in the end (delta: 69.2 MB). Free memory was 86.7 MB in the beginning and 146.9 MB in the end (delta: -60.2 MB). Peak memory consumption was 34.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:37:02,645 INFO L168 Benchmark]: Boogie Preprocessor took 190.10 ms. Allocated memory is still 203.4 MB. Free memory was 146.9 MB in the beginning and 139.3 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:37:02,646 INFO L168 Benchmark]: RCFGBuilder took 2315.46 ms. Allocated memory was 203.4 MB in the beginning and 261.6 MB in the end (delta: 58.2 MB). Free memory was 138.3 MB in the beginning and 206.7 MB in the end (delta: -68.4 MB). Peak memory consumption was 95.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:37:02,647 INFO L168 Benchmark]: TraceAbstraction took 6417.83 ms. Allocated memory was 261.6 MB in the beginning and 444.6 MB in the end (delta: 183.0 MB). Free memory was 206.7 MB in the beginning and 274.7 MB in the end (delta: -68.0 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:37:02,650 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 945.76 ms. Allocated memory was 134.2 MB in the beginning and 203.4 MB in the end (delta: 69.2 MB). Free memory was 86.7 MB in the beginning and 146.9 MB in the end (delta: -60.2 MB). Peak memory consumption was 34.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 190.10 ms. Allocated memory is still 203.4 MB. Free memory was 146.9 MB in the beginning and 139.3 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2315.46 ms. Allocated memory was 203.4 MB in the beginning and 261.6 MB in the end (delta: 58.2 MB). Free memory was 138.3 MB in the beginning and 206.7 MB in the end (delta: -68.4 MB). Peak memory consumption was 95.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6417.83 ms. Allocated memory was 261.6 MB in the beginning and 444.6 MB in the end (delta: 183.0 MB). Free memory was 206.7 MB in the beginning and 274.7 MB in the end (delta: -68.0 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: 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 94 procedures, 622 locations, 1 error locations. SAFE Result, 6.3s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4133 SDtfs, 1085 SDslu, 11379 SDs, 0 SdLazy, 674 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7924occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 129 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2009 NumberOfCodeBlocks, 2009 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1996 ConstructedInterpolants, 0 QuantifiedInterpolants, 371068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 282/282 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...