java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec6_product34.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:54:12,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:54:12,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:54:12,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:54:12,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:54:12,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:54:12,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:54:12,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:54:12,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:54:12,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:54:12,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:54:12,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:54:12,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:54:12,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:54:12,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:54:12,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:54:12,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:54:12,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:54:12,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:54:12,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:54:12,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:54:12,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:54:12,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:54:12,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:54:12,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:54:12,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:54:12,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:54:12,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:54:12,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:54:12,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:54:12,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:54:12,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:54:12,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:54:12,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:54:12,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:54:12,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:54:12,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:54:12,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:54:12,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:54:12,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:54:12,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:54:12,501 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:54:12,524 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:54:12,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:54:12,525 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:54:12,526 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:54:12,526 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:54:12,527 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:54:12,527 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:54:12,527 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:54:12,527 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:54:12,527 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:54:12,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:54:12,530 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:54:12,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:54:12,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:54:12,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:54:12,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:54:12,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:54:12,531 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:54:12,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:54:12,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:54:12,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:54:12,532 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:54:12,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:54:12,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:54:12,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:54:12,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:54:12,534 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:54:12,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:54:12,534 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:54:12,534 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:54:12,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:54:12,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:54:12,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:54:12,599 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:54:12,600 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:54:12,601 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product34.cil.c [2019-10-03 02:54:12,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53bdcfadd/fb23090e1d4846de9e7f1cfc32f10b88/FLAG6286842f5 [2019-10-03 02:54:13,328 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:54:13,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product34.cil.c [2019-10-03 02:54:13,353 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53bdcfadd/fb23090e1d4846de9e7f1cfc32f10b88/FLAG6286842f5 [2019-10-03 02:54:13,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53bdcfadd/fb23090e1d4846de9e7f1cfc32f10b88 [2019-10-03 02:54:13,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:54:13,528 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:54:13,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:54:13,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:54:13,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:54:13,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:54:13" (1/1) ... [2019-10-03 02:54:13,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35299c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:13, skipping insertion in model container [2019-10-03 02:54:13,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:54:13" (1/1) ... [2019-10-03 02:54:13,545 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:54:13,632 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:54:14,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:54:14,359 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:54:14,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:54:14,650 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:54:14,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:14 WrapperNode [2019-10-03 02:54:14,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:54:14,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:54:14,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:54:14,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:54:14,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:14" (1/1) ... [2019-10-03 02:54:14,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:14" (1/1) ... [2019-10-03 02:54:14,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:14" (1/1) ... [2019-10-03 02:54:14,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:14" (1/1) ... [2019-10-03 02:54:14,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:14" (1/1) ... [2019-10-03 02:54:14,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:14" (1/1) ... [2019-10-03 02:54:14,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:14" (1/1) ... [2019-10-03 02:54:14,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:54:14,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:54:14,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:54:14,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:54:14,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:54:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:54:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:54:14,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:54:14,982 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:54:14,982 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:54:14,982 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:54:14,982 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:54:14,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-03 02:54:14,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-03 02:54:14,983 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:54:14,983 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:54:14,984 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-03 02:54:14,984 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-03 02:54:14,985 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:54:14,985 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:54:14,986 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-03 02:54:14,986 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-03 02:54:14,986 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-03 02:54:14,986 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:54:14,987 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:54:14,987 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:54:14,987 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:54:14,988 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:54:14,988 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:54:14,988 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:54:14,989 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:54:14,989 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:54:14,990 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-03 02:54:14,990 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-03 02:54:14,990 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-03 02:54:14,990 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-03 02:54:14,990 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:54:14,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:54:14,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:54:14,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:54:14,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:54:14,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:54:14,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:54:14,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:54:14,991 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:54:14,992 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:54:14,992 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:54:14,992 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:54:14,993 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:54:14,993 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:54:14,993 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:54:14,993 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:54:14,993 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:54:14,993 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:54:14,994 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:54:14,994 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:54:14,994 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:54:14,994 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:54:14,994 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:54:14,994 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:54:14,994 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:54:14,995 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:54:14,995 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:54:14,995 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:54:14,995 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:54:14,995 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:54:14,995 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-03 02:54:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-03 02:54:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:54:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:54:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:54:14,997 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:54:14,997 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:54:14,997 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:54:14,997 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:54:14,997 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:54:14,997 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:54:14,998 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:54:14,998 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:54:14,999 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:54:14,999 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:54:14,999 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:54:14,999 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:54:14,999 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:54:15,000 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:54:15,001 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:54:15,001 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:54:15,001 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:54:15,001 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:54:15,001 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:54:15,002 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:54:15,003 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:54:15,004 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:54:15,004 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:54:15,004 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:54:15,004 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:54:15,004 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:54:15,004 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:54:15,005 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:54:15,005 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:54:15,005 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:54:15,005 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:54:15,005 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:54:15,006 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:54:15,006 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:54:15,006 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:54:15,006 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:54:15,006 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:54:15,007 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:54:15,007 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:54:15,007 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:54:15,007 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:54:15,007 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:54:15,008 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:54:15,008 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:54:15,008 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:54:15,008 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:54:15,008 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:54:15,009 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:54:15,009 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:54:15,009 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:54:15,010 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-03 02:54:15,010 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-03 02:54:15,011 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:54:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:54:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:54:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:54:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:54:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:54:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:54:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:54:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:54:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:54:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:54:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:54:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:54:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:54:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-03 02:54:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:54:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-03 02:54:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:54:15,017 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:54:15,017 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:54:15,018 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:54:15,021 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:54:15,022 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:54:15,022 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:54:15,022 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:54:15,030 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:54:15,030 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:54:15,030 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:54:15,031 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:54:15,031 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:54:15,031 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:54:15,031 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:54:15,032 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:54:15,032 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:54:15,032 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:54:15,033 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:54:15,033 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:54:15,033 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:54:15,033 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:54:15,033 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:54:15,033 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:54:15,034 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:54:15,034 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:54:15,034 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:54:15,034 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:54:15,034 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:54:15,034 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:54:15,035 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:54:15,035 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:54:15,035 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-03 02:54:15,035 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-03 02:54:15,035 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-03 02:54:15,035 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-03 02:54:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:54:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-03 02:54:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-03 02:54:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-03 02:54:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-03 02:54:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-03 02:54:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:54:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:54:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:54:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:54:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:54:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:54:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:54:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:54:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:54:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:54:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:54:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:54:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:54:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:54:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:54:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:54:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:54:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:54:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:54:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:54:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:54:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:54:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:54:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:54:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:54:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:54:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:54:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-03 02:54:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-03 02:54:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:54:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:54:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:54:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:54:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:54:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:54:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:54:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:54:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:54:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:54:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:54:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:54:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:54:15,044 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:54:15,044 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:54:15,044 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:54:15,044 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:54:15,044 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:54:15,044 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:54:15,045 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:54:15,045 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:54:15,045 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:54:15,045 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:54:15,045 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:54:15,045 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:54:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:54:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:54:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:54:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:54:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:54:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:54:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:54:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:54:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:54:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:54:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:54:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:54:15,048 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:54:15,048 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:54:15,048 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-03 02:54:15,048 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-03 02:54:15,048 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:54:15,048 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:54:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:54:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:54:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:54:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:54:17,280 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:54:17,280 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:54:17,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:54:17 BoogieIcfgContainer [2019-10-03 02:54:17,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:54:17,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:54:17,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:54:17,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:54:17,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:54:13" (1/3) ... [2019-10-03 02:54:17,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1946f27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:54:17, skipping insertion in model container [2019-10-03 02:54:17,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:14" (2/3) ... [2019-10-03 02:54:17,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1946f27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:54:17, skipping insertion in model container [2019-10-03 02:54:17,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:54:17" (3/3) ... [2019-10-03 02:54:17,295 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product34.cil.c [2019-10-03 02:54:17,309 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:54:17,322 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:54:17,341 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:54:17,374 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:54:17,374 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:54:17,377 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:54:17,378 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:54:17,378 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:54:17,378 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:54:17,378 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:54:17,378 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:54:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states. [2019-10-03 02:54:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-03 02:54:17,477 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:17,478 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:54:17,483 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:17,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1836415482, now seen corresponding path program 1 times [2019-10-03 02:54:17,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:17,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:17,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:17,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:17,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:18,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:18,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:54:18,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:18,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:54:18,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:54:18,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:54:18,368 INFO L87 Difference]: Start difference. First operand 659 states. Second operand 2 states. [2019-10-03 02:54:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:18,428 INFO L93 Difference]: Finished difference Result 639 states and 865 transitions. [2019-10-03 02:54:18,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:54:18,429 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 198 [2019-10-03 02:54:18,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:18,461 INFO L225 Difference]: With dead ends: 639 [2019-10-03 02:54:18,462 INFO L226 Difference]: Without dead ends: 630 [2019-10-03 02:54:18,463 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:54:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-03 02:54:18,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-03 02:54:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-03 02:54:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 854 transitions. [2019-10-03 02:54:18,571 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 854 transitions. Word has length 198 [2019-10-03 02:54:18,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:18,574 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 854 transitions. [2019-10-03 02:54:18,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:54:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 854 transitions. [2019-10-03 02:54:18,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-03 02:54:18,580 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:18,581 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-03 02:54:18,581 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:18,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:18,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1234031911, now seen corresponding path program 1 times [2019-10-03 02:54:18,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:18,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:18,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:18,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:18,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:18,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:18,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:18,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:18,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:18,900 INFO L87 Difference]: Start difference. First operand 630 states and 854 transitions. Second operand 3 states. [2019-10-03 02:54:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:18,975 INFO L93 Difference]: Finished difference Result 633 states and 857 transitions. [2019-10-03 02:54:18,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:18,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-10-03 02:54:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:18,987 INFO L225 Difference]: With dead ends: 633 [2019-10-03 02:54:18,987 INFO L226 Difference]: Without dead ends: 633 [2019-10-03 02:54:18,988 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-03 02:54:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 632. [2019-10-03 02:54:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-03 02:54:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 856 transitions. [2019-10-03 02:54:19,046 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 856 transitions. Word has length 199 [2019-10-03 02:54:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:19,047 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 856 transitions. [2019-10-03 02:54:19,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:19,047 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 856 transitions. [2019-10-03 02:54:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-03 02:54:19,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:19,052 INFO L411 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] [2019-10-03 02:54:19,052 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:19,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:19,053 INFO L82 PathProgramCache]: Analyzing trace with hash -245674181, now seen corresponding path program 1 times [2019-10-03 02:54:19,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:19,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:19,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:19,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:19,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:19,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:19,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:19,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:19,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:19,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:19,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:19,300 INFO L87 Difference]: Start difference. First operand 632 states and 856 transitions. Second operand 3 states. [2019-10-03 02:54:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:19,331 INFO L93 Difference]: Finished difference Result 675 states and 929 transitions. [2019-10-03 02:54:19,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:19,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-03 02:54:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:19,337 INFO L225 Difference]: With dead ends: 675 [2019-10-03 02:54:19,337 INFO L226 Difference]: Without dead ends: 675 [2019-10-03 02:54:19,338 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:19,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-10-03 02:54:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 674. [2019-10-03 02:54:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-10-03 02:54:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 928 transitions. [2019-10-03 02:54:19,361 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 928 transitions. Word has length 205 [2019-10-03 02:54:19,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:19,362 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 928 transitions. [2019-10-03 02:54:19,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:19,362 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 928 transitions. [2019-10-03 02:54:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-03 02:54:19,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:19,367 INFO L411 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] [2019-10-03 02:54:19,367 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:19,368 INFO L82 PathProgramCache]: Analyzing trace with hash 716085072, now seen corresponding path program 1 times [2019-10-03 02:54:19,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:19,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:19,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:19,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:19,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:19,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:19,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:54:19,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:19,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:54:19,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:54:19,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:54:19,752 INFO L87 Difference]: Start difference. First operand 674 states and 928 transitions. Second operand 11 states. [2019-10-03 02:54:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:27,487 INFO L93 Difference]: Finished difference Result 3349 states and 4705 transitions. [2019-10-03 02:54:27,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-03 02:54:27,488 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 206 [2019-10-03 02:54:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:27,512 INFO L225 Difference]: With dead ends: 3349 [2019-10-03 02:54:27,512 INFO L226 Difference]: Without dead ends: 3349 [2019-10-03 02:54:27,513 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 02:54:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2019-10-03 02:54:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 3328. [2019-10-03 02:54:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3328 states. [2019-10-03 02:54:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3328 states to 3328 states and 4577 transitions. [2019-10-03 02:54:27,672 INFO L78 Accepts]: Start accepts. Automaton has 3328 states and 4577 transitions. Word has length 206 [2019-10-03 02:54:27,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:27,674 INFO L475 AbstractCegarLoop]: Abstraction has 3328 states and 4577 transitions. [2019-10-03 02:54:27,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:54:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 4577 transitions. [2019-10-03 02:54:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-03 02:54:27,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:27,679 INFO L411 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] [2019-10-03 02:54:27,679 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:27,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:27,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2127126410, now seen corresponding path program 1 times [2019-10-03 02:54:27,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:27,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:27,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:27,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:27,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:28,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:28,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-10-03 02:54:28,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:28,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-03 02:54:28,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-03 02:54:28,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-10-03 02:54:28,159 INFO L87 Difference]: Start difference. First operand 3328 states and 4577 transitions. Second operand 20 states. [2019-10-03 02:54:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:28,825 INFO L93 Difference]: Finished difference Result 3292 states and 4596 transitions. [2019-10-03 02:54:28,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-03 02:54:28,825 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 207 [2019-10-03 02:54:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:28,847 INFO L225 Difference]: With dead ends: 3292 [2019-10-03 02:54:28,847 INFO L226 Difference]: Without dead ends: 3274 [2019-10-03 02:54:28,848 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-10-03 02:54:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2019-10-03 02:54:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 3272. [2019-10-03 02:54:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3272 states. [2019-10-03 02:54:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 4493 transitions. [2019-10-03 02:54:28,963 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 4493 transitions. Word has length 207 [2019-10-03 02:54:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:28,964 INFO L475 AbstractCegarLoop]: Abstraction has 3272 states and 4493 transitions. [2019-10-03 02:54:28,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-03 02:54:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 4493 transitions. [2019-10-03 02:54:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-03 02:54:28,968 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:28,969 INFO L411 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] [2019-10-03 02:54:28,969 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:28,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:28,970 INFO L82 PathProgramCache]: Analyzing trace with hash 264077804, now seen corresponding path program 1 times [2019-10-03 02:54:28,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:28,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:28,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:28,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:28,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:29,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:29,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:54:29,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:29,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:54:29,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:54:29,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:54:29,161 INFO L87 Difference]: Start difference. First operand 3272 states and 4493 transitions. Second operand 6 states. [2019-10-03 02:54:29,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:29,892 INFO L93 Difference]: Finished difference Result 6631 states and 9244 transitions. [2019-10-03 02:54:29,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:54:29,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 216 [2019-10-03 02:54:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:29,981 INFO L225 Difference]: With dead ends: 6631 [2019-10-03 02:54:29,982 INFO L226 Difference]: Without dead ends: 6631 [2019-10-03 02:54:29,982 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:54:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6631 states. [2019-10-03 02:54:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6631 to 6560. [2019-10-03 02:54:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6560 states. [2019-10-03 02:54:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6560 states to 6560 states and 9109 transitions. [2019-10-03 02:54:30,204 INFO L78 Accepts]: Start accepts. Automaton has 6560 states and 9109 transitions. Word has length 216 [2019-10-03 02:54:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:30,204 INFO L475 AbstractCegarLoop]: Abstraction has 6560 states and 9109 transitions. [2019-10-03 02:54:30,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:54:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 6560 states and 9109 transitions. [2019-10-03 02:54:30,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-03 02:54:30,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:30,211 INFO L411 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] [2019-10-03 02:54:30,212 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:30,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:30,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1993707159, now seen corresponding path program 1 times [2019-10-03 02:54:30,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:30,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:30,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:30,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:30,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:30,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:54:30,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:30,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:54:30,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:54:30,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:54:30,438 INFO L87 Difference]: Start difference. First operand 6560 states and 9109 transitions. Second operand 5 states. [2019-10-03 02:54:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:32,367 INFO L93 Difference]: Finished difference Result 19044 states and 26946 transitions. [2019-10-03 02:54:32,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:54:32,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-10-03 02:54:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:32,479 INFO L225 Difference]: With dead ends: 19044 [2019-10-03 02:54:32,479 INFO L226 Difference]: Without dead ends: 19044 [2019-10-03 02:54:32,479 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:54:32,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19044 states. [2019-10-03 02:54:33,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19044 to 18948. [2019-10-03 02:54:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18948 states. [2019-10-03 02:54:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18948 states to 18948 states and 26778 transitions. [2019-10-03 02:54:33,095 INFO L78 Accepts]: Start accepts. Automaton has 18948 states and 26778 transitions. Word has length 217 [2019-10-03 02:54:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:33,095 INFO L475 AbstractCegarLoop]: Abstraction has 18948 states and 26778 transitions. [2019-10-03 02:54:33,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:54:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 18948 states and 26778 transitions. [2019-10-03 02:54:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-03 02:54:33,113 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:33,113 INFO L411 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] [2019-10-03 02:54:33,114 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:33,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:33,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1714484018, now seen corresponding path program 1 times [2019-10-03 02:54:33,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:33,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:33,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:33,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:33,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:33,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 02:54:33,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:33,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:54:33,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:54:33,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:54:33,401 INFO L87 Difference]: Start difference. First operand 18948 states and 26778 transitions. Second operand 13 states. [2019-10-03 02:54:34,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:34,132 INFO L93 Difference]: Finished difference Result 18872 states and 26465 transitions. [2019-10-03 02:54:34,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:54:34,133 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 217 [2019-10-03 02:54:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:34,925 INFO L225 Difference]: With dead ends: 18872 [2019-10-03 02:54:34,925 INFO L226 Difference]: Without dead ends: 18872 [2019-10-03 02:54:34,926 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-10-03 02:54:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18872 states. [2019-10-03 02:54:35,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18872 to 18820. [2019-10-03 02:54:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18820 states. [2019-10-03 02:54:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18820 states to 18820 states and 26387 transitions. [2019-10-03 02:54:35,447 INFO L78 Accepts]: Start accepts. Automaton has 18820 states and 26387 transitions. Word has length 217 [2019-10-03 02:54:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:35,447 INFO L475 AbstractCegarLoop]: Abstraction has 18820 states and 26387 transitions. [2019-10-03 02:54:35,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:54:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 18820 states and 26387 transitions. [2019-10-03 02:54:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-03 02:54:35,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:35,463 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:35,464 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:35,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:35,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1765180475, now seen corresponding path program 1 times [2019-10-03 02:54:35,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:35,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:35,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:35,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:35,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:35,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:35,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:35,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:35,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:35,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:35,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:35,624 INFO L87 Difference]: Start difference. First operand 18820 states and 26387 transitions. Second operand 3 states. [2019-10-03 02:54:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:35,715 INFO L93 Difference]: Finished difference Result 19164 states and 27012 transitions. [2019-10-03 02:54:35,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:35,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-10-03 02:54:35,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:35,794 INFO L225 Difference]: With dead ends: 19164 [2019-10-03 02:54:35,794 INFO L226 Difference]: Without dead ends: 19164 [2019-10-03 02:54:35,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:35,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19164 states. [2019-10-03 02:54:36,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19164 to 19160. [2019-10-03 02:54:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19160 states. [2019-10-03 02:54:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19160 states to 19160 states and 27008 transitions. [2019-10-03 02:54:36,411 INFO L78 Accepts]: Start accepts. Automaton has 19160 states and 27008 transitions. Word has length 246 [2019-10-03 02:54:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:36,412 INFO L475 AbstractCegarLoop]: Abstraction has 19160 states and 27008 transitions. [2019-10-03 02:54:36,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 19160 states and 27008 transitions. [2019-10-03 02:54:36,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-03 02:54:36,429 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:36,429 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:36,430 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:36,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:36,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1332042394, now seen corresponding path program 1 times [2019-10-03 02:54:36,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:36,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:36,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:36,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:36,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:36,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:36,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:36,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:36,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:36,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:36,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:36,604 INFO L87 Difference]: Start difference. First operand 19160 states and 27008 transitions. Second operand 3 states. [2019-10-03 02:54:36,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:36,697 INFO L93 Difference]: Finished difference Result 19804 states and 28182 transitions. [2019-10-03 02:54:36,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:36,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-10-03 02:54:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:36,779 INFO L225 Difference]: With dead ends: 19804 [2019-10-03 02:54:36,779 INFO L226 Difference]: Without dead ends: 19804 [2019-10-03 02:54:36,780 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:36,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19804 states. [2019-10-03 02:54:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19804 to 19800. [2019-10-03 02:54:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19800 states. [2019-10-03 02:54:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19800 states to 19800 states and 28178 transitions. [2019-10-03 02:54:37,293 INFO L78 Accepts]: Start accepts. Automaton has 19800 states and 28178 transitions. Word has length 247 [2019-10-03 02:54:37,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:37,295 INFO L475 AbstractCegarLoop]: Abstraction has 19800 states and 28178 transitions. [2019-10-03 02:54:37,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 19800 states and 28178 transitions. [2019-10-03 02:54:37,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-03 02:54:37,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:37,322 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:37,322 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:37,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:37,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1154224121, now seen corresponding path program 1 times [2019-10-03 02:54:37,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:37,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:37,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:37,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:37,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:37,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:37,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:37,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:37,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:37,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:37,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:37,809 INFO L87 Difference]: Start difference. First operand 19800 states and 28178 transitions. Second operand 8 states. [2019-10-03 02:54:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:43,573 INFO L93 Difference]: Finished difference Result 40031 states and 58075 transitions. [2019-10-03 02:54:43,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:43,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 248 [2019-10-03 02:54:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:43,724 INFO L225 Difference]: With dead ends: 40031 [2019-10-03 02:54:43,724 INFO L226 Difference]: Without dead ends: 40031 [2019-10-03 02:54:43,726 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:54:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40031 states. [2019-10-03 02:54:44,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40031 to 22216. [2019-10-03 02:54:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22216 states. [2019-10-03 02:54:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22216 states to 22216 states and 32954 transitions. [2019-10-03 02:54:44,663 INFO L78 Accepts]: Start accepts. Automaton has 22216 states and 32954 transitions. Word has length 248 [2019-10-03 02:54:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:44,664 INFO L475 AbstractCegarLoop]: Abstraction has 22216 states and 32954 transitions. [2019-10-03 02:54:44,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 22216 states and 32954 transitions. [2019-10-03 02:54:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-03 02:54:44,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:44,714 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:44,715 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:44,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:44,715 INFO L82 PathProgramCache]: Analyzing trace with hash 753949824, now seen corresponding path program 1 times [2019-10-03 02:54:44,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:44,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:44,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:44,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:44,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-03 02:54:45,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:45,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:45,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:45,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:45,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:45,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:45,671 INFO L87 Difference]: Start difference. First operand 22216 states and 32954 transitions. Second operand 8 states. [2019-10-03 02:54:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:51,280 INFO L93 Difference]: Finished difference Result 45399 states and 69531 transitions. [2019-10-03 02:54:51,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:51,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 255 [2019-10-03 02:54:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:51,470 INFO L225 Difference]: With dead ends: 45399 [2019-10-03 02:54:51,470 INFO L226 Difference]: Without dead ends: 45399 [2019-10-03 02:54:51,471 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:54:51,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45399 states. [2019-10-03 02:54:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45399 to 27168. [2019-10-03 02:54:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27168 states. [2019-10-03 02:54:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27168 states to 27168 states and 43346 transitions. [2019-10-03 02:54:52,406 INFO L78 Accepts]: Start accepts. Automaton has 27168 states and 43346 transitions. Word has length 255 [2019-10-03 02:54:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:52,406 INFO L475 AbstractCegarLoop]: Abstraction has 27168 states and 43346 transitions. [2019-10-03 02:54:52,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 27168 states and 43346 transitions. [2019-10-03 02:54:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-03 02:54:52,493 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:52,494 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:52,494 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1380372655, now seen corresponding path program 1 times [2019-10-03 02:54:52,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:52,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:52,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-03 02:54:52,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:52,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:52,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:52,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:52,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:52,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:52,705 INFO L87 Difference]: Start difference. First operand 27168 states and 43346 transitions. Second operand 8 states. [2019-10-03 02:54:58,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:58,297 INFO L93 Difference]: Finished difference Result 56287 states and 94079 transitions. [2019-10-03 02:54:58,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:58,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 256 [2019-10-03 02:54:58,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:58,481 INFO L225 Difference]: With dead ends: 56287 [2019-10-03 02:54:58,481 INFO L226 Difference]: Without dead ends: 56287 [2019-10-03 02:54:58,481 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:54:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56287 states. [2019-10-03 02:54:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56287 to 37200. [2019-10-03 02:54:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37200 states. [2019-10-03 02:54:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37200 states to 37200 states and 65670 transitions. [2019-10-03 02:54:59,650 INFO L78 Accepts]: Start accepts. Automaton has 37200 states and 65670 transitions. Word has length 256 [2019-10-03 02:54:59,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:59,650 INFO L475 AbstractCegarLoop]: Abstraction has 37200 states and 65670 transitions. [2019-10-03 02:54:59,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 37200 states and 65670 transitions. [2019-10-03 02:54:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-10-03 02:54:59,825 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:59,825 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:59,825 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:59,826 INFO L82 PathProgramCache]: Analyzing trace with hash 67314336, now seen corresponding path program 1 times [2019-10-03 02:54:59,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:59,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:59,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:59,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:59,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-03 02:55:00,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:00,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:55:00,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:00,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:55:00,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:55:00,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:55:00,106 INFO L87 Difference]: Start difference. First operand 37200 states and 65670 transitions. Second operand 11 states. [2019-10-03 02:55:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:01,516 INFO L93 Difference]: Finished difference Result 54812 states and 92356 transitions. [2019-10-03 02:55:01,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:55:01,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 271 [2019-10-03 02:55:01,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:01,853 INFO L225 Difference]: With dead ends: 54812 [2019-10-03 02:55:01,854 INFO L226 Difference]: Without dead ends: 54776 [2019-10-03 02:55:01,856 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-10-03 02:55:01,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54776 states. [2019-10-03 02:55:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54776 to 54148. [2019-10-03 02:55:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54148 states. [2019-10-03 02:55:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54148 states to 54148 states and 91035 transitions. [2019-10-03 02:55:06,365 INFO L78 Accepts]: Start accepts. Automaton has 54148 states and 91035 transitions. Word has length 271 [2019-10-03 02:55:06,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:06,366 INFO L475 AbstractCegarLoop]: Abstraction has 54148 states and 91035 transitions. [2019-10-03 02:55:06,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:55:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 54148 states and 91035 transitions. [2019-10-03 02:55:06,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-03 02:55:06,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:06,526 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:06,526 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:06,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:06,527 INFO L82 PathProgramCache]: Analyzing trace with hash -506402963, now seen corresponding path program 1 times [2019-10-03 02:55:06,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:06,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:06,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:06,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:06,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-03 02:55:06,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:06,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:55:06,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:06,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:55:06,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:55:06,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:55:06,799 INFO L87 Difference]: Start difference. First operand 54148 states and 91035 transitions. Second operand 3 states. [2019-10-03 02:55:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:07,196 INFO L93 Difference]: Finished difference Result 64008 states and 114719 transitions. [2019-10-03 02:55:07,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:55:07,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2019-10-03 02:55:07,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:07,570 INFO L225 Difference]: With dead ends: 64008 [2019-10-03 02:55:07,571 INFO L226 Difference]: Without dead ends: 64008 [2019-10-03 02:55:07,572 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:55:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64008 states. [2019-10-03 02:55:09,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64008 to 64004. [2019-10-03 02:55:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64004 states. [2019-10-03 02:55:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64004 states to 64004 states and 114715 transitions. [2019-10-03 02:55:09,601 INFO L78 Accepts]: Start accepts. Automaton has 64004 states and 114715 transitions. Word has length 273 [2019-10-03 02:55:09,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:09,601 INFO L475 AbstractCegarLoop]: Abstraction has 64004 states and 114715 transitions. [2019-10-03 02:55:09,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:55:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 64004 states and 114715 transitions. [2019-10-03 02:55:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-03 02:55:09,737 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:09,738 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:09,738 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:09,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:09,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1978992374, now seen corresponding path program 1 times [2019-10-03 02:55:09,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:09,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:09,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:09,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:09,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-03 02:55:13,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:55:13,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:55:13,411 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2019-10-03 02:55:13,426 INFO L207 CegarAbsIntRunner]: [72], [75], [85], [112], [115], [116], [119], [129], [130], [146], [149], [158], [159], [162], [163], [164], [166], [248], [251], [257], [276], [278], [282], [285], [286], [287], [290], [296], [323], [326], [335], [356], [358], [359], [362], [372], [375], [377], [380], [382], [384], [438], [441], [450], [555], [558], [568], [630], [632], [633], [634], [652], [655], [669], [672], [675], [689], [718], [719], [730], [732], [734], [737], [741], [744], [746], [747], [749], [752], [756], [780], [784], [787], [795], [798], [830], [864], [873], [877], [879], [881], [884], [891], [898], [903], [910], [917], [924], [927], [929], [1039], [1041], [1058], [1136], [1139], [1142], [1186], [1187], [1190], [1193], [1196], [1240], [1241], [1263], [1274], [1277], [1278], [1281], [1284], [1315], [1316], [1318], [1320], [1323], [1333], [1335], [1404], [1407], [1413], [1448], [1451], [1465], [1471], [1474], [1483], [1499], [1502], [1504], [1506], [1508], [1513], [1571], [1573], [1574], [1702], [1704], [1706], [1708], [1709], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1755], [1756], [1757], [1758], [1759], [1760], [1763], [1764], [1765], [1766], [1767], [1769], [1770], [1771], [1772], [1789], [1790], [1791], [1792], [1793], [1794], [1833], [1834], [1849], [1850], [1851], [1852], [1853], [1855], [1856], [1861], [1862], [1863], [1864], [1865], [1866], [1867], [1868], [1869], [1871], [1872], [1873], [1874], [1889], [1911], [1912], [1927], [1929], [1930], [1947], [1949], [1950], [1951], [1953], [1954], [1955], [1956], [1957], [1958], [1959], [1960], [1961], [1962], [1963], [1964], [1965], [1967], [1968], [1969], [1975], [1976], [1977], [1978], [1979], [1980], [1981], [1983], [1984], [1999], [2000], [2001], [2002], [2003], [2004], [2005], [2006], [2007] [2019-10-03 02:55:13,481 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:55:13,481 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:55:13,624 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:55:13,626 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 212 root evaluator evaluations with a maximum evaluation depth of 0. Performed 212 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 394 variables. [2019-10-03 02:55:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:13,632 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:55:13,795 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:55:13,796 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:55:13,805 INFO L420 sIntCurrentIteration]: We unified 254 AI predicates to 254 [2019-10-03 02:55:13,805 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:55:13,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:55:13,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [49] total 49 [2019-10-03 02:55:13,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:13,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:55:13,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:55:13,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:55:13,808 INFO L87 Difference]: Start difference. First operand 64004 states and 114715 transitions. Second operand 2 states. [2019-10-03 02:55:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:13,809 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:55:13,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:55:13,809 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 255 [2019-10-03 02:55:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:13,809 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:55:13,809 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:55:13,810 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:55:13,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:55:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:55:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:55:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:55:13,811 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 255 [2019-10-03 02:55:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:13,811 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:55:13,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:55:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:55:13,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:55:13,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:55:13 BoogieIcfgContainer [2019-10-03 02:55:13,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:55:13,821 INFO L168 Benchmark]: Toolchain (without parser) took 60291.27 ms. Allocated memory was 130.5 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 82.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 380.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:55:13,823 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 130.5 MB. Free memory was 104.7 MB in the beginning and 104.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:55:13,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1122.88 ms. Allocated memory was 130.5 MB in the beginning and 200.3 MB in the end (delta: 69.7 MB). Free memory was 82.5 MB in the beginning and 124.4 MB in the end (delta: -41.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:55:13,830 INFO L168 Benchmark]: Boogie Preprocessor took 248.30 ms. Allocated memory is still 200.3 MB. Free memory was 124.4 MB in the beginning and 115.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:55:13,830 INFO L168 Benchmark]: RCFGBuilder took 2382.26 ms. Allocated memory was 200.3 MB in the beginning and 275.8 MB in the end (delta: 75.5 MB). Free memory was 115.1 MB in the beginning and 144.9 MB in the end (delta: -29.7 MB). Peak memory consumption was 76.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:55:13,831 INFO L168 Benchmark]: TraceAbstraction took 56533.44 ms. Allocated memory was 275.8 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 144.9 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 296.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:55:13,844 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.24 ms. Allocated memory is still 130.5 MB. Free memory was 104.7 MB in the beginning and 104.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1122.88 ms. Allocated memory was 130.5 MB in the beginning and 200.3 MB in the end (delta: 69.7 MB). Free memory was 82.5 MB in the beginning and 124.4 MB in the end (delta: -41.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 248.30 ms. Allocated memory is still 200.3 MB. Free memory was 124.4 MB in the beginning and 115.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2382.26 ms. Allocated memory was 200.3 MB in the beginning and 275.8 MB in the end (delta: 75.5 MB). Free memory was 115.1 MB in the beginning and 144.9 MB in the end (delta: -29.7 MB). Peak memory consumption was 76.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56533.44 ms. Allocated memory was 275.8 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 144.9 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 296.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 590]: 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 119 procedures, 830 locations, 1 error locations. SAFE Result, 56.4s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 33.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15458 SDtfs, 12736 SDslu, 56766 SDs, 0 SdLazy, 21685 SolverSat, 3516 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64004occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.0551181102362204 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 12.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 56017 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 3716 NumberOfCodeBlocks, 3716 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3700 ConstructedInterpolants, 0 QuantifiedInterpolants, 1238815 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 660/664 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...