java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec11_product15.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:39:04,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:39:04,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:39:04,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:39:04,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:39:04,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:39:04,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:39:04,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:39:04,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:39:04,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:39:04,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:39:04,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:39:04,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:39:04,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:39:04,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:39:04,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:39:04,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:39:04,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:39:04,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:39:04,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:39:04,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:39:04,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:39:04,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:39:04,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:39:04,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:39:04,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:39:04,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:39:04,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:39:04,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:39:04,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:39:04,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:39:04,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:39:04,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:39:04,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:39:04,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:39:04,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:39:04,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:39:04,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:39:04,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:39:04,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:39:04,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:39:04,814 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:39:04,829 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:39:04,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:39:04,830 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:39:04,830 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:39:04,830 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:39:04,831 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:39:04,831 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:39:04,831 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:39:04,831 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:39:04,831 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:39:04,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:39:04,832 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:39:04,833 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:39:04,833 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:39:04,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:39:04,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:39:04,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:39:04,834 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:39:04,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:39:04,834 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:39:04,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:39:04,834 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:39:04,835 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:39:04,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:39:04,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:39:04,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:39:04,835 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:39:04,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:39:04,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:39:04,836 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:39:04,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:39:04,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:39:04,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:39:04,909 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:39:04,909 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:39:04,910 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec11_product15.cil.c [2019-09-10 02:39:04,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57f8d4c7/52654e1bfe274c448d744956cdd95874/FLAG70ac9ab9f [2019-09-10 02:39:05,630 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:39:05,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product15.cil.c [2019-09-10 02:39:05,655 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57f8d4c7/52654e1bfe274c448d744956cdd95874/FLAG70ac9ab9f [2019-09-10 02:39:05,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57f8d4c7/52654e1bfe274c448d744956cdd95874 [2019-09-10 02:39:05,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:39:05,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:39:05,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:39:05,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:39:05,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:39:05,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:39:05" (1/1) ... [2019-09-10 02:39:05,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bcfa2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:39:05, skipping insertion in model container [2019-09-10 02:39:05,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:39:05" (1/1) ... [2019-09-10 02:39:05,788 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:39:05,881 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:39:06,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:39:06,696 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:39:06,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:39:06,949 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:39:06,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:39:06 WrapperNode [2019-09-10 02:39:06,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:39:06,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:39:06,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:39:06,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:39:06,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:39:06" (1/1) ... [2019-09-10 02:39:06,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:39:06" (1/1) ... [2019-09-10 02:39:07,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:39:06" (1/1) ... [2019-09-10 02:39:07,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:39:06" (1/1) ... [2019-09-10 02:39:07,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:39:06" (1/1) ... [2019-09-10 02:39:07,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:39:06" (1/1) ... [2019-09-10 02:39:07,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:39:06" (1/1) ... [2019-09-10 02:39:07,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:39:07,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:39:07,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:39:07,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:39:07,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:39:06" (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:39:07,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:39:07,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:39:07,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:39:07,246 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:39:07,247 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:39:07,247 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:39:07,247 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:39:07,248 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:39:07,248 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:39:07,249 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:39:07,249 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:39:07,250 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:39:07,250 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:39:07,251 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:39:07,251 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:39:07,252 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:39:07,253 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:39:07,253 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:39:07,253 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:39:07,253 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:39:07,254 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:39:07,254 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:39:07,254 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:39:07,254 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:39:07,255 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-09-10 02:39:07,256 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:39:07,256 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-10 02:39:07,256 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:39:07,256 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:39:07,257 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-10 02:39:07,257 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2019-09-10 02:39:07,257 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:39:07,257 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:39:07,257 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:39:07,258 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:39:07,258 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:39:07,258 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:39:07,258 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:39:07,259 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:39:07,259 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:39:07,259 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-10 02:39:07,259 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:39:07,259 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:39:07,260 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:39:07,260 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:39:07,260 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:39:07,260 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:39:07,260 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:39:07,261 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:39:07,261 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:39:07,261 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:39:07,261 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:39:07,261 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:39:07,261 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:39:07,262 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:39:07,262 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:39:07,262 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:39:07,262 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:39:07,262 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:39:07,263 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:39:07,263 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:39:07,263 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:39:07,263 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:39:07,263 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:39:07,264 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:39:07,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:39:07,265 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:39:07,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:39:07,265 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:39:07,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:39:07,265 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:39:07,266 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:39:07,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:39:07,267 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:39:07,267 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:39:07,267 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:39:07,267 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:39:07,268 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:39:07,268 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:39:07,268 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:39:07,270 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:39:07,270 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:39:07,270 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:39:07,270 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:39:07,270 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:39:07,271 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:39:07,271 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:39:07,272 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:39:07,272 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:39:07,272 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:39:07,273 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:39:07,273 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:39:07,273 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:39:07,273 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:39:07,274 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:39:07,274 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:39:07,274 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-10 02:39:07,274 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:39:07,274 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:39:07,275 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:39:07,275 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:39:07,275 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:39:07,275 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:39:07,275 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-10 02:39:07,276 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:39:07,276 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-10 02:39:07,276 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:39:07,276 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:39:07,276 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:39:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:39:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:39:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:39:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:39:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:39:07,278 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:39:07,278 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:39:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:39:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:39:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:39:07,280 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:39:07,280 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:39:07,280 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:39:07,281 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:39:07,282 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:39:07,282 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:39:07,282 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:39:07,282 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:39:07,283 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:39:07,283 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:39:07,283 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:39:07,283 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:39:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:39:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:39:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:39:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:39:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-09-10 02:39:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:39:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:39:07,286 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:39:07,290 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:39:07,291 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:39:07,291 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:39:07,291 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:39:07,299 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:39:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:39:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:39:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:39:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:39:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:39:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:39:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:39:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:39:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:39:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:39:07,302 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:39:07,302 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:39:07,302 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:39:07,302 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-10 02:39:07,302 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-10 02:39:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-10 02:39:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2019-09-10 02:39:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:39:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:39:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:39:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:39:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:39:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:39:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:39:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:39:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:39:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:39:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:39:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:39:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:39:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:39:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:39:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:39:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:39:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:39:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:39:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-10 02:39:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:39:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:39:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:39:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:39:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:39:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:39:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:39:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:39:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:39:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:39:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:39:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:39:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:39:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:39:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:39:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:39:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:39:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:39:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:39:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:39:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:39:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:39:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:39:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:39:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:39:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:39:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:39:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:39:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:39:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:39:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:39:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:39:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:39:07,311 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:39:07,311 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:39:07,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:39:07,311 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:39:07,311 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:39:07,311 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:39:07,311 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:39:07,312 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:39:07,312 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-10 02:39:07,312 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-10 02:39:07,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:39:07,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:39:07,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:39:09,331 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:39:09,332 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:39:09,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:39:09 BoogieIcfgContainer [2019-09-10 02:39:09,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:39:09,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:39:09,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:39:09,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:39:09,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:39:05" (1/3) ... [2019-09-10 02:39:09,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535d0846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:39:09, skipping insertion in model container [2019-09-10 02:39:09,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:39:06" (2/3) ... [2019-09-10 02:39:09,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535d0846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:39:09, skipping insertion in model container [2019-09-10 02:39:09,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:39:09" (3/3) ... [2019-09-10 02:39:09,341 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product15.cil.c [2019-09-10 02:39:09,351 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:39:09,361 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:39:09,378 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:39:09,407 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:39:09,407 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:39:09,408 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:39:09,408 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:39:09,408 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:39:09,408 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:39:09,408 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:39:09,408 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:39:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states. [2019-09-10 02:39:09,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 02:39:09,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:09,463 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:09,465 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:09,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:09,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1009460557, now seen corresponding path program 1 times [2019-09-10 02:39:09,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:09,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:09,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:39:10,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:10,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:39:10,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:10,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:39:10,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:39:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:39:10,107 INFO L87 Difference]: Start difference. First operand 463 states. Second operand 2 states. [2019-09-10 02:39:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:10,184 INFO L93 Difference]: Finished difference Result 436 states and 578 transitions. [2019-09-10 02:39:10,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:39:10,188 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 184 [2019-09-10 02:39:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:10,223 INFO L225 Difference]: With dead ends: 436 [2019-09-10 02:39:10,223 INFO L226 Difference]: Without dead ends: 427 [2019-09-10 02:39:10,226 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:39:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-10 02:39:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-09-10 02:39:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-10 02:39:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 567 transitions. [2019-09-10 02:39:10,382 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 567 transitions. Word has length 184 [2019-09-10 02:39:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:10,384 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 567 transitions. [2019-09-10 02:39:10,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:39:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 567 transitions. [2019-09-10 02:39:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 02:39:10,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:10,390 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:10,390 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:10,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:10,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1618025728, now seen corresponding path program 1 times [2019-09-10 02:39:10,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:10,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:10,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:10,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:10,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:39:10,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:10,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:39:10,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:10,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:39:10,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:39:10,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:39:10,671 INFO L87 Difference]: Start difference. First operand 427 states and 567 transitions. Second operand 3 states. [2019-09-10 02:39:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:10,726 INFO L93 Difference]: Finished difference Result 430 states and 570 transitions. [2019-09-10 02:39:10,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:39:10,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 02:39:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:10,733 INFO L225 Difference]: With dead ends: 430 [2019-09-10 02:39:10,733 INFO L226 Difference]: Without dead ends: 430 [2019-09-10 02:39:10,734 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:39:10,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-09-10 02:39:10,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 429. [2019-09-10 02:39:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-09-10 02:39:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 569 transitions. [2019-09-10 02:39:10,775 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 569 transitions. Word has length 185 [2019-09-10 02:39:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:10,776 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 569 transitions. [2019-09-10 02:39:10,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:39:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 569 transitions. [2019-09-10 02:39:10,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 02:39:10,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:10,785 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:10,785 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:10,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:10,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1065076368, now seen corresponding path program 1 times [2019-09-10 02:39:10,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:10,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:10,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:10,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:10,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:39:11,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:11,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:39:11,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:11,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:39:11,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:39:11,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:39:11,065 INFO L87 Difference]: Start difference. First operand 429 states and 569 transitions. Second operand 3 states. [2019-09-10 02:39:11,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:11,092 INFO L93 Difference]: Finished difference Result 470 states and 639 transitions. [2019-09-10 02:39:11,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:39:11,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-09-10 02:39:11,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:11,103 INFO L225 Difference]: With dead ends: 470 [2019-09-10 02:39:11,104 INFO L226 Difference]: Without dead ends: 470 [2019-09-10 02:39:11,104 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:39:11,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-10 02:39:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 469. [2019-09-10 02:39:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-09-10 02:39:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 638 transitions. [2019-09-10 02:39:11,135 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 638 transitions. Word has length 195 [2019-09-10 02:39:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:11,138 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 638 transitions. [2019-09-10 02:39:11,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:39:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 638 transitions. [2019-09-10 02:39:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 02:39:11,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:11,145 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:11,145 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:11,145 INFO L82 PathProgramCache]: Analyzing trace with hash 328316479, now seen corresponding path program 1 times [2019-09-10 02:39:11,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:11,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:11,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:11,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:11,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:39:11,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:11,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:39:11,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:11,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:39:11,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:39:11,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:39:11,296 INFO L87 Difference]: Start difference. First operand 469 states and 638 transitions. Second operand 3 states. [2019-09-10 02:39:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:11,322 INFO L93 Difference]: Finished difference Result 547 states and 771 transitions. [2019-09-10 02:39:11,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:39:11,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-10 02:39:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:11,331 INFO L225 Difference]: With dead ends: 547 [2019-09-10 02:39:11,331 INFO L226 Difference]: Without dead ends: 547 [2019-09-10 02:39:11,331 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:39:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-10 02:39:11,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 546. [2019-09-10 02:39:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-09-10 02:39:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 770 transitions. [2019-09-10 02:39:11,354 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 770 transitions. Word has length 196 [2019-09-10 02:39:11,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:11,355 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 770 transitions. [2019-09-10 02:39:11,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:39:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 770 transitions. [2019-09-10 02:39:11,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 02:39:11,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:11,360 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:11,361 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:11,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1785624336, now seen corresponding path program 1 times [2019-09-10 02:39:11,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:11,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:11,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:11,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:11,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:39:11,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:11,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:39:11,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:11,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:39:11,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:39:11,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:39:11,572 INFO L87 Difference]: Start difference. First operand 546 states and 770 transitions. Second operand 3 states. [2019-09-10 02:39:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:11,615 INFO L93 Difference]: Finished difference Result 695 states and 1023 transitions. [2019-09-10 02:39:11,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:39:11,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-09-10 02:39:11,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:11,624 INFO L225 Difference]: With dead ends: 695 [2019-09-10 02:39:11,624 INFO L226 Difference]: Without dead ends: 695 [2019-09-10 02:39:11,625 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:39:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-09-10 02:39:11,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 694. [2019-09-10 02:39:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-09-10 02:39:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1022 transitions. [2019-09-10 02:39:11,667 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1022 transitions. Word has length 197 [2019-09-10 02:39:11,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:11,668 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 1022 transitions. [2019-09-10 02:39:11,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:39:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1022 transitions. [2019-09-10 02:39:11,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 02:39:11,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:11,678 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:11,678 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:11,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:11,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1999560001, now seen corresponding path program 1 times [2019-09-10 02:39:11,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:11,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:11,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:11,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:11,984 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:39:11,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:11,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:39:11,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:11,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:39:11,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:39:11,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:39:11,987 INFO L87 Difference]: Start difference. First operand 694 states and 1022 transitions. Second operand 3 states. [2019-09-10 02:39:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:12,016 INFO L93 Difference]: Finished difference Result 979 states and 1503 transitions. [2019-09-10 02:39:12,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:39:12,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-09-10 02:39:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:12,024 INFO L225 Difference]: With dead ends: 979 [2019-09-10 02:39:12,024 INFO L226 Difference]: Without dead ends: 979 [2019-09-10 02:39:12,025 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:39:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-09-10 02:39:12,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 978. [2019-09-10 02:39:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2019-09-10 02:39:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1502 transitions. [2019-09-10 02:39:12,062 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1502 transitions. Word has length 198 [2019-09-10 02:39:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:12,064 INFO L475 AbstractCegarLoop]: Abstraction has 978 states and 1502 transitions. [2019-09-10 02:39:12,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:39:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1502 transitions. [2019-09-10 02:39:12,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 02:39:12,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:12,072 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:12,072 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:12,072 INFO L82 PathProgramCache]: Analyzing trace with hash 164433568, now seen corresponding path program 1 times [2019-09-10 02:39:12,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:12,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:12,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:12,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:12,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:39:12,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:12,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 02:39:12,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:12,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:39:12,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:39:12,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:39:12,534 INFO L87 Difference]: Start difference. First operand 978 states and 1502 transitions. Second operand 19 states. [2019-09-10 02:39:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:16,983 INFO L93 Difference]: Finished difference Result 2353 states and 3609 transitions. [2019-09-10 02:39:16,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:39:16,983 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 201 [2019-09-10 02:39:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:17,003 INFO L225 Difference]: With dead ends: 2353 [2019-09-10 02:39:17,003 INFO L226 Difference]: Without dead ends: 2353 [2019-09-10 02:39:17,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:39:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-09-10 02:39:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2316. [2019-09-10 02:39:17,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2316 states. [2019-09-10 02:39:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 3563 transitions. [2019-09-10 02:39:17,106 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 3563 transitions. Word has length 201 [2019-09-10 02:39:17,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:17,107 INFO L475 AbstractCegarLoop]: Abstraction has 2316 states and 3563 transitions. [2019-09-10 02:39:17,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:39:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 3563 transitions. [2019-09-10 02:39:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 02:39:17,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:17,120 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:17,120 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:17,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:17,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1129710859, now seen corresponding path program 1 times [2019-09-10 02:39:17,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:17,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:17,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:17,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:17,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:39:17,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:17,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:39:17,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:17,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:39:17,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:39:17,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:39:17,397 INFO L87 Difference]: Start difference. First operand 2316 states and 3563 transitions. Second operand 9 states. [2019-09-10 02:39:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:17,672 INFO L93 Difference]: Finished difference Result 2370 states and 3646 transitions. [2019-09-10 02:39:17,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:39:17,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 202 [2019-09-10 02:39:17,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:17,690 INFO L225 Difference]: With dead ends: 2370 [2019-09-10 02:39:17,690 INFO L226 Difference]: Without dead ends: 2362 [2019-09-10 02:39:17,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:39:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-09-10 02:39:17,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2019-09-10 02:39:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2019-09-10 02:39:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3636 transitions. [2019-09-10 02:39:17,781 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3636 transitions. Word has length 202 [2019-09-10 02:39:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:17,782 INFO L475 AbstractCegarLoop]: Abstraction has 2362 states and 3636 transitions. [2019-09-10 02:39:17,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:39:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3636 transitions. [2019-09-10 02:39:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 02:39:17,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:17,795 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:17,795 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:17,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1961451491, now seen corresponding path program 1 times [2019-09-10 02:39:17,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:17,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:17,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:17,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:17,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-10 02:39:18,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:18,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 02:39:18,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:18,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:39:18,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:39:18,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:39:18,072 INFO L87 Difference]: Start difference. First operand 2362 states and 3636 transitions. Second operand 14 states. [2019-09-10 02:39:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:18,347 INFO L93 Difference]: Finished difference Result 2418 states and 3702 transitions. [2019-09-10 02:39:18,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:39:18,348 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 202 [2019-09-10 02:39:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:18,365 INFO L225 Difference]: With dead ends: 2418 [2019-09-10 02:39:18,365 INFO L226 Difference]: Without dead ends: 2394 [2019-09-10 02:39:18,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:39:18,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2019-09-10 02:39:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2394. [2019-09-10 02:39:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2019-09-10 02:39:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3668 transitions. [2019-09-10 02:39:18,459 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3668 transitions. Word has length 202 [2019-09-10 02:39:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:18,460 INFO L475 AbstractCegarLoop]: Abstraction has 2394 states and 3668 transitions. [2019-09-10 02:39:18,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:39:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3668 transitions. [2019-09-10 02:39:18,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 02:39:18,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:18,473 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:18,474 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:18,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:18,474 INFO L82 PathProgramCache]: Analyzing trace with hash 193335460, now seen corresponding path program 1 times [2019-09-10 02:39:18,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:18,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:18,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:18,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:18,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:39:18,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:18,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 02:39:18,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:18,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:39:18,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:39:18,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:39:18,822 INFO L87 Difference]: Start difference. First operand 2394 states and 3668 transitions. Second operand 15 states. [2019-09-10 02:39:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:22,077 INFO L93 Difference]: Finished difference Result 2478 states and 3787 transitions. [2019-09-10 02:39:22,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 02:39:22,078 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 202 [2019-09-10 02:39:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:22,094 INFO L225 Difference]: With dead ends: 2478 [2019-09-10 02:39:22,094 INFO L226 Difference]: Without dead ends: 2478 [2019-09-10 02:39:22,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:39:22,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2019-09-10 02:39:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2423. [2019-09-10 02:39:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-09-10 02:39:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 3711 transitions. [2019-09-10 02:39:22,184 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 3711 transitions. Word has length 202 [2019-09-10 02:39:22,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:22,185 INFO L475 AbstractCegarLoop]: Abstraction has 2423 states and 3711 transitions. [2019-09-10 02:39:22,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:39:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 3711 transitions. [2019-09-10 02:39:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 02:39:22,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:22,196 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:22,197 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:22,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:22,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1971016039, now seen corresponding path program 1 times [2019-09-10 02:39:22,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:22,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:22,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:22,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:22,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:39:22,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:22,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:39:22,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:22,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:39:22,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:39:22,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:39:22,347 INFO L87 Difference]: Start difference. First operand 2423 states and 3711 transitions. Second operand 5 states. [2019-09-10 02:39:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:23,193 INFO L93 Difference]: Finished difference Result 4424 states and 6697 transitions. [2019-09-10 02:39:23,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:39:23,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2019-09-10 02:39:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:23,225 INFO L225 Difference]: With dead ends: 4424 [2019-09-10 02:39:23,226 INFO L226 Difference]: Without dead ends: 4396 [2019-09-10 02:39:23,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:39:23,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4396 states. [2019-09-10 02:39:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4396 to 4365. [2019-09-10 02:39:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4365 states. [2019-09-10 02:39:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 6623 transitions. [2019-09-10 02:39:23,471 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 6623 transitions. Word has length 202 [2019-09-10 02:39:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:23,473 INFO L475 AbstractCegarLoop]: Abstraction has 4365 states and 6623 transitions. [2019-09-10 02:39:23,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:39:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 6623 transitions. [2019-09-10 02:39:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 02:39:23,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:23,495 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:23,495 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:23,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:23,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1840275930, now seen corresponding path program 1 times [2019-09-10 02:39:23,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:23,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:23,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:23,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:23,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:39:23,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:23,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:39:23,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:23,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:39:23,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:39:23,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:39:23,788 INFO L87 Difference]: Start difference. First operand 4365 states and 6623 transitions. Second operand 7 states. [2019-09-10 02:39:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:25,396 INFO L93 Difference]: Finished difference Result 8499 states and 12224 transitions. [2019-09-10 02:39:25,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:39:25,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2019-09-10 02:39:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:25,450 INFO L225 Difference]: With dead ends: 8499 [2019-09-10 02:39:25,451 INFO L226 Difference]: Without dead ends: 8499 [2019-09-10 02:39:25,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:39:25,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8499 states. [2019-09-10 02:39:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8499 to 8461. [2019-09-10 02:39:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-09-10 02:39:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 12143 transitions. [2019-09-10 02:39:25,770 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 12143 transitions. Word has length 202 [2019-09-10 02:39:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:25,770 INFO L475 AbstractCegarLoop]: Abstraction has 8461 states and 12143 transitions. [2019-09-10 02:39:25,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:39:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 12143 transitions. [2019-09-10 02:39:25,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 02:39:25,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:25,789 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:25,790 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:25,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:25,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1975708119, now seen corresponding path program 1 times [2019-09-10 02:39:25,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:25,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:25,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:25,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:25,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:39:26,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:26,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 02:39:26,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:26,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:39:26,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:39:26,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:39:26,379 INFO L87 Difference]: Start difference. First operand 8461 states and 12143 transitions. Second operand 24 states. [2019-09-10 02:39:27,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:27,099 INFO L93 Difference]: Finished difference Result 9306 states and 13336 transitions. [2019-09-10 02:39:27,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:39:27,100 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 203 [2019-09-10 02:39:27,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:27,156 INFO L225 Difference]: With dead ends: 9306 [2019-09-10 02:39:27,157 INFO L226 Difference]: Without dead ends: 8814 [2019-09-10 02:39:27,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:39:27,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8814 states. [2019-09-10 02:39:27,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8814 to 8591. [2019-09-10 02:39:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8591 states. [2019-09-10 02:39:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8591 states to 8591 states and 12329 transitions. [2019-09-10 02:39:27,461 INFO L78 Accepts]: Start accepts. Automaton has 8591 states and 12329 transitions. Word has length 203 [2019-09-10 02:39:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:27,462 INFO L475 AbstractCegarLoop]: Abstraction has 8591 states and 12329 transitions. [2019-09-10 02:39:27,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:39:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 8591 states and 12329 transitions. [2019-09-10 02:39:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 02:39:27,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:27,483 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:27,483 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:27,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1635585549, now seen corresponding path program 1 times [2019-09-10 02:39:27,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:27,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:27,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:27,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:27,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:39:27,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:27,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:39:27,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:27,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:39:27,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:39:27,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:39:27,706 INFO L87 Difference]: Start difference. First operand 8591 states and 12329 transitions. Second operand 10 states. [2019-09-10 02:39:27,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:27,813 INFO L93 Difference]: Finished difference Result 8653 states and 12381 transitions. [2019-09-10 02:39:27,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:39:27,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 207 [2019-09-10 02:39:27,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:27,853 INFO L225 Difference]: With dead ends: 8653 [2019-09-10 02:39:27,853 INFO L226 Difference]: Without dead ends: 8442 [2019-09-10 02:39:27,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:39:27,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8442 states. [2019-09-10 02:39:28,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8442 to 8438. [2019-09-10 02:39:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8438 states. [2019-09-10 02:39:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8438 states to 8438 states and 12096 transitions. [2019-09-10 02:39:28,205 INFO L78 Accepts]: Start accepts. Automaton has 8438 states and 12096 transitions. Word has length 207 [2019-09-10 02:39:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:28,206 INFO L475 AbstractCegarLoop]: Abstraction has 8438 states and 12096 transitions. [2019-09-10 02:39:28,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:39:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 8438 states and 12096 transitions. [2019-09-10 02:39:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 02:39:28,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:28,228 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:28,228 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:28,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1032859762, now seen corresponding path program 1 times [2019-09-10 02:39:28,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:28,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:28,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:28,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:28,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:39:28,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:28,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:39:28,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:28,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:39:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:39:28,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:39:28,393 INFO L87 Difference]: Start difference. First operand 8438 states and 12096 transitions. Second operand 5 states. [2019-09-10 02:39:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:28,477 INFO L93 Difference]: Finished difference Result 8621 states and 12288 transitions. [2019-09-10 02:39:28,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:39:28,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-09-10 02:39:28,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:28,509 INFO L225 Difference]: With dead ends: 8621 [2019-09-10 02:39:28,510 INFO L226 Difference]: Without dead ends: 8621 [2019-09-10 02:39:28,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:39:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8621 states. [2019-09-10 02:39:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8621 to 8516. [2019-09-10 02:39:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-09-10 02:39:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 12137 transitions. [2019-09-10 02:39:28,744 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 12137 transitions. Word has length 212 [2019-09-10 02:39:28,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:28,744 INFO L475 AbstractCegarLoop]: Abstraction has 8516 states and 12137 transitions. [2019-09-10 02:39:28,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:39:28,745 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 12137 transitions. [2019-09-10 02:39:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-10 02:39:28,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:28,763 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:28,764 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:28,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:28,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1647701080, now seen corresponding path program 1 times [2019-09-10 02:39:28,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:28,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:28,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:28,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:28,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:39:28,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:28,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:39:28,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:28,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:39:28,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:39:28,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:39:28,912 INFO L87 Difference]: Start difference. First operand 8516 states and 12137 transitions. Second operand 6 states. [2019-09-10 02:39:29,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:29,445 INFO L93 Difference]: Finished difference Result 17105 states and 24677 transitions. [2019-09-10 02:39:29,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:39:29,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2019-09-10 02:39:29,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:29,515 INFO L225 Difference]: With dead ends: 17105 [2019-09-10 02:39:29,516 INFO L226 Difference]: Without dead ends: 17105 [2019-09-10 02:39:29,516 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:39:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17105 states. [2019-09-10 02:39:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17105 to 16858. [2019-09-10 02:39:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16858 states. [2019-09-10 02:39:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16858 states to 16858 states and 24372 transitions. [2019-09-10 02:39:30,169 INFO L78 Accepts]: Start accepts. Automaton has 16858 states and 24372 transitions. Word has length 213 [2019-09-10 02:39:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:30,169 INFO L475 AbstractCegarLoop]: Abstraction has 16858 states and 24372 transitions. [2019-09-10 02:39:30,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:39:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 16858 states and 24372 transitions. [2019-09-10 02:39:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 02:39:30,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:30,226 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:30,226 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash 200978423, now seen corresponding path program 1 times [2019-09-10 02:39:30,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:30,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:30,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:39:30,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:30,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:39:30,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:30,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:39:30,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:39:30,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:39:30,482 INFO L87 Difference]: Start difference. First operand 16858 states and 24372 transitions. Second operand 8 states. [2019-09-10 02:39:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:35,187 INFO L93 Difference]: Finished difference Result 34395 states and 53381 transitions. [2019-09-10 02:39:35,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:39:35,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2019-09-10 02:39:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:35,362 INFO L225 Difference]: With dead ends: 34395 [2019-09-10 02:39:35,362 INFO L226 Difference]: Without dead ends: 34395 [2019-09-10 02:39:35,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:39:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34395 states. [2019-09-10 02:39:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34395 to 34270. [2019-09-10 02:39:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34270 states. [2019-09-10 02:39:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34270 states to 34270 states and 52027 transitions. [2019-09-10 02:39:36,812 INFO L78 Accepts]: Start accepts. Automaton has 34270 states and 52027 transitions. Word has length 249 [2019-09-10 02:39:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:36,813 INFO L475 AbstractCegarLoop]: Abstraction has 34270 states and 52027 transitions. [2019-09-10 02:39:36,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:39:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 34270 states and 52027 transitions. [2019-09-10 02:39:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-10 02:39:36,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:36,902 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:36,902 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:36,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:36,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1837657716, now seen corresponding path program 1 times [2019-09-10 02:39:36,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:36,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:36,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:36,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:36,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:39:37,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:37,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:39:37,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:37,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:39:37,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:39:37,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:39:37,113 INFO L87 Difference]: Start difference. First operand 34270 states and 52027 transitions. Second operand 8 states. [2019-09-10 02:39:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:41,424 INFO L93 Difference]: Finished difference Result 70023 states and 113569 transitions. [2019-09-10 02:39:41,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:39:41,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2019-09-10 02:39:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:41,873 INFO L225 Difference]: With dead ends: 70023 [2019-09-10 02:39:41,873 INFO L226 Difference]: Without dead ends: 70023 [2019-09-10 02:39:41,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:39:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70023 states. [2019-09-10 02:39:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70023 to 64986. [2019-09-10 02:39:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64986 states. [2019-09-10 02:39:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64986 states to 64986 states and 104317 transitions. [2019-09-10 02:39:45,669 INFO L78 Accepts]: Start accepts. Automaton has 64986 states and 104317 transitions. Word has length 250 [2019-09-10 02:39:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:45,669 INFO L475 AbstractCegarLoop]: Abstraction has 64986 states and 104317 transitions. [2019-09-10 02:39:45,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:39:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 64986 states and 104317 transitions. [2019-09-10 02:39:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 02:39:45,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:45,798 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:45,798 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:45,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:45,799 INFO L82 PathProgramCache]: Analyzing trace with hash 870001194, now seen corresponding path program 1 times [2019-09-10 02:39:45,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:45,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:45,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:45,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:45,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:46,393 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:39:46,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:46,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:39:46,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:46,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:39:46,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:39:46,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:39:46,396 INFO L87 Difference]: Start difference. First operand 64986 states and 104317 transitions. Second operand 8 states. [2019-09-10 02:39:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:50,583 INFO L93 Difference]: Finished difference Result 132931 states and 227839 transitions. [2019-09-10 02:39:50,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:39:50,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 236 [2019-09-10 02:39:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:53,340 INFO L225 Difference]: With dead ends: 132931 [2019-09-10 02:39:53,340 INFO L226 Difference]: Without dead ends: 132931 [2019-09-10 02:39:53,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:39:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132931 states. [2019-09-10 02:39:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132931 to 117362. [2019-09-10 02:39:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117362 states. [2019-09-10 02:39:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117362 states to 117362 states and 201744 transitions. [2019-09-10 02:39:57,220 INFO L78 Accepts]: Start accepts. Automaton has 117362 states and 201744 transitions. Word has length 236 [2019-09-10 02:39:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:57,221 INFO L475 AbstractCegarLoop]: Abstraction has 117362 states and 201744 transitions. [2019-09-10 02:39:57,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:39:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 117362 states and 201744 transitions. [2019-09-10 02:39:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 02:39:57,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:57,461 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:57,461 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:57,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash -597043004, now seen corresponding path program 1 times [2019-09-10 02:39:57,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:57,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:57,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:57,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:57,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:39:57,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:39:57,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:39:57,623 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2019-09-10 02:39:57,626 INFO L207 CegarAbsIntRunner]: [72], [75], [85], [110], [126], [129], [138], [139], [142], [143], [144], [146], [228], [231], [237], [256], [258], [262], [265], [266], [267], [270], [276], [300], [302], [303], [306], [315], [326], [328], [331], [335], [336], [338], [339], [342], [352], [353], [354], [355], [357], [362], [393], [394], [397], [406], [578], [580], [581], [582], [618], [621], [635], [674], [676], [679], [680], [681], [684], [690], [714], [718], [721], [729], [732], [743], [765], [767], [770], [772], [775], [777], [779], [782], [798], [807], [811], [813], [815], [818], [825], [832], [835], [837], [971], [974], [988], [1096], [1150], [1152], [1154], [1161], [1183], [1194], [1197], [1200], [1206], [1209], [1210], [1213], [1217], [1221], [1247], [1248], [1250], [1319], [1322], [1328], [1329], [1332], [1342], [1363], [1366], [1380], [1388], [1391], [1400], [1589], [1591], [1593], [1595], [1596], [1618], [1628], [1629], [1630], [1631], [1632], [1633], [1636], [1637], [1638], [1639], [1640], [1642], [1643], [1644], [1645], [1652], [1653], [1658], [1659], [1662], [1663], [1664], [1665], [1666], [1672], [1673], [1690], [1691], [1704], [1705], [1706], [1708], [1709], [1710], [1711], [1712], [1713], [1714], [1715], [1716], [1718], [1719], [1720], [1721], [1730], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1756], [1757], [1772], [1774], [1775], [1776], [1777], [1782], [1784], [1785], [1786], [1787], [1788], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818] [2019-09-10 02:39:57,695 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:39:57,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:39:57,819 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:39:57,821 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 219 root evaluator evaluations with a maximum evaluation depth of 0. Performed 219 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 360 variables. [2019-09-10 02:39:57,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:57,826 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:39:57,904 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:39:57,905 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:39:57,913 INFO L420 sIntCurrentIteration]: We unified 231 AI predicates to 231 [2019-09-10 02:39:57,913 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:39:57,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:39:57,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 02:39:57,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:57,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:39:57,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:39:57,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:39:57,918 INFO L87 Difference]: Start difference. First operand 117362 states and 201744 transitions. Second operand 2 states. [2019-09-10 02:39:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:57,918 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:39:57,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:39:57,919 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 232 [2019-09-10 02:39:57,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:57,919 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:39:57,919 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:39:57,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 231 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:39:57,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:39:57,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:39:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:39:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:39:57,920 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2019-09-10 02:39:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:57,921 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:39:57,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:39:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:39:57,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:39:57,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:39:57 BoogieIcfgContainer [2019-09-10 02:39:57,927 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:39:57,931 INFO L168 Benchmark]: Toolchain (without parser) took 52158.44 ms. Allocated memory was 141.6 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 85.5 MB in the beginning and 882.7 MB in the end (delta: -797.2 MB). Peak memory consumption was 973.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:39:57,937 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 141.6 MB. Free memory is still 106.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 02:39:57,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1178.48 ms. Allocated memory was 141.6 MB in the beginning and 202.9 MB in the end (delta: 61.3 MB). Free memory was 85.1 MB in the beginning and 139.6 MB in the end (delta: -54.5 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:39:57,938 INFO L168 Benchmark]: Boogie Preprocessor took 207.41 ms. Allocated memory is still 202.9 MB. Free memory was 139.6 MB in the beginning and 129.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:39:57,939 INFO L168 Benchmark]: RCFGBuilder took 2175.55 ms. Allocated memory was 202.9 MB in the beginning and 257.4 MB in the end (delta: 54.5 MB). Free memory was 129.4 MB in the beginning and 174.1 MB in the end (delta: -44.7 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:39:57,941 INFO L168 Benchmark]: TraceAbstraction took 48592.82 ms. Allocated memory was 257.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 174.1 MB in the beginning and 882.7 MB in the end (delta: -708.7 MB). Peak memory consumption was 946.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:39:57,953 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.26 ms. Allocated memory is still 141.6 MB. Free memory is still 106.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1178.48 ms. Allocated memory was 141.6 MB in the beginning and 202.9 MB in the end (delta: 61.3 MB). Free memory was 85.1 MB in the beginning and 139.6 MB in the end (delta: -54.5 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 207.41 ms. Allocated memory is still 202.9 MB. Free memory was 139.6 MB in the beginning and 129.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2175.55 ms. Allocated memory was 202.9 MB in the beginning and 257.4 MB in the end (delta: 54.5 MB). Free memory was 129.4 MB in the beginning and 174.1 MB in the end (delta: -44.7 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48592.82 ms. Allocated memory was 257.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 174.1 MB in the beginning and 882.7 MB in the end (delta: -708.7 MB). Peak memory consumption was 946.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2079]: 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 109 procedures, 738 locations, 1 error locations. SAFE Result, 48.5s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 29.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12610 SDtfs, 9375 SDslu, 62227 SDs, 0 SdLazy, 17541 SolverSat, 2260 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 557 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117362occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.0043290043290045 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 11.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 21476 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 4168 NumberOfCodeBlocks, 4168 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4148 ConstructedInterpolants, 0 QuantifiedInterpolants, 1149200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 694/696 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...