java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec11_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:50:31,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:50:31,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:50:31,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:50:31,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:50:31,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:50:31,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:50:31,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:50:31,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:50:31,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:50:31,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:50:31,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:50:31,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:50:31,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:50:31,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:50:31,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:50:31,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:50:31,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:50:31,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:50:31,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:50:31,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:50:31,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:50:31,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:50:31,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:50:31,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:50:31,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:50:31,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:50:31,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:50:31,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:50:31,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:50:31,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:50:31,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:50:31,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:50:31,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:50:31,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:50:31,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:50:31,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:50:31,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:50:31,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:50:31,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:50:31,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:50:31,455 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:50:31,472 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:50:31,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:50:31,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:50:31,474 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:50:31,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:50:31,475 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:50:31,476 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:50:31,476 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:50:31,476 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:50:31,476 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:50:31,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:50:31,477 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:50:31,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:50:31,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:50:31,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:50:31,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:50:31,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:50:31,479 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:50:31,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:50:31,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:50:31,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:50:31,480 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:50:31,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:50:31,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:50:31,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:50:31,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:50:31,482 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:50:31,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:50:31,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:50:31,482 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:50:31,519 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:50:31,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:50:31,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:50:31,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:50:31,538 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:50:31,538 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec11_product26.cil.c [2019-10-03 02:50:31,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c45defb6/cf8aff91f31d47288ae37c970f62d979/FLAG0f096e2f8 [2019-10-03 02:50:32,206 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:50:32,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product26.cil.c [2019-10-03 02:50:32,242 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c45defb6/cf8aff91f31d47288ae37c970f62d979/FLAG0f096e2f8 [2019-10-03 02:50:32,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c45defb6/cf8aff91f31d47288ae37c970f62d979 [2019-10-03 02:50:32,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:50:32,454 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:50:32,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:50:32,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:50:32,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:50:32,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:50:32" (1/1) ... [2019-10-03 02:50:32,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7201854e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:32, skipping insertion in model container [2019-10-03 02:50:32,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:50:32" (1/1) ... [2019-10-03 02:50:32,470 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:50:32,556 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:50:33,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:50:33,307 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:50:33,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:50:33,521 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:50:33,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:33 WrapperNode [2019-10-03 02:50:33,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:50:33,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:50:33,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:50:33,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:50:33,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:33" (1/1) ... [2019-10-03 02:50:33,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:33" (1/1) ... [2019-10-03 02:50:33,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:33" (1/1) ... [2019-10-03 02:50:33,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:33" (1/1) ... [2019-10-03 02:50:33,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:33" (1/1) ... [2019-10-03 02:50:33,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:33" (1/1) ... [2019-10-03 02:50:33,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:33" (1/1) ... [2019-10-03 02:50:33,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:50:33,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:50:33,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:50:33,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:50:33,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:50:33,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:50:33,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:50:33,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:50:33,802 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:50:33,802 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:50:33,803 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:50:33,803 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:50:33,803 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:50:33,803 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:50:33,803 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:50:33,804 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:50:33,805 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:50:33,805 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:50:33,806 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:50:33,806 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:50:33,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:50:33,807 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:50:33,808 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:50:33,808 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:50:33,808 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:50:33,809 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:50:33,809 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:50:33,809 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:50:33,810 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:50:33,810 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:50:33,811 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:50:33,811 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:50:33,811 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:50:33,811 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:50:33,811 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:50:33,812 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:50:33,812 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:50:33,812 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:50:33,812 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:50:33,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-03 02:50:33,812 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:50:33,813 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:50:33,813 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:50:33,813 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:50:33,813 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:50:33,813 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:50:33,814 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:50:33,814 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:50:33,814 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:50:33,814 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:50:33,815 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:50:33,815 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:50:33,815 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:50:33,815 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:50:33,815 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:50:33,815 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:50:33,815 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:50:33,816 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:50:33,816 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:50:33,817 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:50:33,817 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-03 02:50:33,817 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-03 02:50:33,818 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:50:33,818 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:50:33,818 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:50:33,818 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:50:33,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:50:33,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:50:33,819 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:50:33,820 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:50:33,820 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:50:33,820 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:50:33,821 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:50:33,821 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:50:33,821 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:50:33,821 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:50:33,821 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:50:33,822 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:50:33,823 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:50:33,823 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:50:33,823 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:50:33,823 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:50:33,823 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:50:33,824 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:50:33,824 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:50:33,824 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:50:33,825 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:50:33,825 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:50:33,825 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:50:33,825 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:50:33,825 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:50:33,826 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:50:33,826 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:50:33,826 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:50:33,826 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:50:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:50:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:50:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:50:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:50:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:50:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:50:33,828 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:50:33,828 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:50:33,828 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-03 02:50:33,828 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-03 02:50:33,828 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-03 02:50:33,828 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:50:33,828 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:50:33,829 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:50:33,829 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:50:33,829 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:50:33,829 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:50:33,829 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:50:33,829 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:50:33,830 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:50:33,830 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:50:33,830 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-03 02:50:33,830 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-03 02:50:33,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:50:33,830 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:50:33,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:50:33,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:50:33,831 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:50:33,832 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:50:33,832 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:50:33,832 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:50:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:50:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:50:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:50:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:50:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:50:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:50:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:50:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:50:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:50:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:50:33,836 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:50:33,836 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:50:33,836 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:50:33,836 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:50:33,836 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:50:33,836 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:50:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:50:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:50:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:50:33,842 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:50:33,842 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:50:33,842 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:50:33,848 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:50:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:50:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:50:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:50:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:50:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:50:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:50:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:50:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:50:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-03 02:50:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:50:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:50:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:50:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:50:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:50:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:50:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:50:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:50:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:50:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:50:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:50:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:50:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:50:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:50:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:50:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:50:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:50:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:50:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:50:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:50:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:50:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:50:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:50:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:50:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:50:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:50:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:50:33,854 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:50:33,854 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:50:33,854 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:50:33,854 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:50:33,854 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:50:33,854 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:50:33,854 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:50:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:50:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:50:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-03 02:50:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-03 02:50:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:50:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:50:33,856 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:50:33,856 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:50:33,856 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:50:33,856 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:50:33,856 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:50:33,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:50:33,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:50:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:50:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:50:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:50:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:50:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:50:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:50:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:50:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:50:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:50:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:50:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:50:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:50:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:50:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:50:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:50:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:50:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:50:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:50:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:50:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:50:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:50:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:50:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:50:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:50:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:50:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:50:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:50:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:50:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:50:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:50:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:50:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:50:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:50:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:50:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-03 02:50:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-03 02:50:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:50:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:50:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-03 02:50:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-03 02:50:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-03 02:50:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:50:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:50:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:50:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:50:36,145 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:50:36,146 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:50:36,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:36 BoogieIcfgContainer [2019-10-03 02:50:36,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:50:36,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:50:36,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:50:36,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:50:36,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:50:32" (1/3) ... [2019-10-03 02:50:36,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf8cc81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:36, skipping insertion in model container [2019-10-03 02:50:36,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:33" (2/3) ... [2019-10-03 02:50:36,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf8cc81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:36, skipping insertion in model container [2019-10-03 02:50:36,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:36" (3/3) ... [2019-10-03 02:50:36,157 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product26.cil.c [2019-10-03 02:50:36,167 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:50:36,180 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:50:36,196 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:50:36,224 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:50:36,224 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:50:36,224 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:50:36,225 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:50:36,226 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:50:36,230 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:50:36,230 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:50:36,230 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:50:36,271 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states. [2019-10-03 02:50:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-03 02:50:36,303 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:36,305 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:36,308 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:36,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:36,315 INFO L82 PathProgramCache]: Analyzing trace with hash 900111105, now seen corresponding path program 1 times [2019-10-03 02:50:36,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:36,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:36,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:36,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:36,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:36,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:36,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:50:36,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:36,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:50:36,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:50:36,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:37,001 INFO L87 Difference]: Start difference. First operand 598 states. Second operand 2 states. [2019-10-03 02:50:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:37,060 INFO L93 Difference]: Finished difference Result 578 states and 786 transitions. [2019-10-03 02:50:37,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:50:37,062 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 195 [2019-10-03 02:50:37,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:37,086 INFO L225 Difference]: With dead ends: 578 [2019-10-03 02:50:37,086 INFO L226 Difference]: Without dead ends: 569 [2019-10-03 02:50:37,088 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:37,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-03 02:50:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-03 02:50:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-03 02:50:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 775 transitions. [2019-10-03 02:50:37,221 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 775 transitions. Word has length 195 [2019-10-03 02:50:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:37,224 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 775 transitions. [2019-10-03 02:50:37,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:50:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 775 transitions. [2019-10-03 02:50:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-03 02:50:37,230 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:37,231 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:37,231 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:37,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:37,232 INFO L82 PathProgramCache]: Analyzing trace with hash -156800952, now seen corresponding path program 1 times [2019-10-03 02:50:37,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:37,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:37,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:37,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:37,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:37,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:37,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:37,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:37,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:37,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:37,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:37,505 INFO L87 Difference]: Start difference. First operand 569 states and 775 transitions. Second operand 3 states. [2019-10-03 02:50:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:37,553 INFO L93 Difference]: Finished difference Result 572 states and 778 transitions. [2019-10-03 02:50:37,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:37,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-03 02:50:37,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:37,565 INFO L225 Difference]: With dead ends: 572 [2019-10-03 02:50:37,565 INFO L226 Difference]: Without dead ends: 572 [2019-10-03 02:50:37,566 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-10-03 02:50:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 571. [2019-10-03 02:50:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-03 02:50:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 777 transitions. [2019-10-03 02:50:37,628 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 777 transitions. Word has length 196 [2019-10-03 02:50:37,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:37,631 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 777 transitions. [2019-10-03 02:50:37,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 777 transitions. [2019-10-03 02:50:37,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-03 02:50:37,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:37,639 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:37,639 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:37,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:37,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1398291401, now seen corresponding path program 1 times [2019-10-03 02:50:37,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:37,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:37,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:37,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:37,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:37,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:37,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:37,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:37,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:37,975 INFO L87 Difference]: Start difference. First operand 571 states and 777 transitions. Second operand 3 states. [2019-10-03 02:50:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:38,030 INFO L93 Difference]: Finished difference Result 616 states and 853 transitions. [2019-10-03 02:50:38,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:38,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-10-03 02:50:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:38,042 INFO L225 Difference]: With dead ends: 616 [2019-10-03 02:50:38,042 INFO L226 Difference]: Without dead ends: 616 [2019-10-03 02:50:38,043 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:38,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-03 02:50:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 615. [2019-10-03 02:50:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-03 02:50:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 852 transitions. [2019-10-03 02:50:38,095 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 852 transitions. Word has length 208 [2019-10-03 02:50:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:38,097 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 852 transitions. [2019-10-03 02:50:38,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 852 transitions. [2019-10-03 02:50:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-03 02:50:38,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:38,110 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:38,111 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:38,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:38,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1218822354, now seen corresponding path program 1 times [2019-10-03 02:50:38,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:38,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:38,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:38,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:38,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:38,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:38,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:38,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:38,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:38,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:38,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:38,399 INFO L87 Difference]: Start difference. First operand 615 states and 852 transitions. Second operand 3 states. [2019-10-03 02:50:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:38,437 INFO L93 Difference]: Finished difference Result 701 states and 997 transitions. [2019-10-03 02:50:38,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:38,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-10-03 02:50:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:38,445 INFO L225 Difference]: With dead ends: 701 [2019-10-03 02:50:38,445 INFO L226 Difference]: Without dead ends: 701 [2019-10-03 02:50:38,446 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:38,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-10-03 02:50:38,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 700. [2019-10-03 02:50:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-10-03 02:50:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 996 transitions. [2019-10-03 02:50:38,492 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 996 transitions. Word has length 209 [2019-10-03 02:50:38,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:38,493 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 996 transitions. [2019-10-03 02:50:38,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 996 transitions. [2019-10-03 02:50:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 02:50:38,502 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:38,502 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:38,503 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:38,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:38,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1024895096, now seen corresponding path program 1 times [2019-10-03 02:50:38,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:38,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:38,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:38,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:38,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:38,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:38,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 02:50:38,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:38,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 02:50:38,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 02:50:38,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:50:38,991 INFO L87 Difference]: Start difference. First operand 700 states and 996 transitions. Second operand 19 states. [2019-10-03 02:50:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:44,012 INFO L93 Difference]: Finished difference Result 1971 states and 2820 transitions. [2019-10-03 02:50:44,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-03 02:50:44,012 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 212 [2019-10-03 02:50:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:44,026 INFO L225 Difference]: With dead ends: 1971 [2019-10-03 02:50:44,026 INFO L226 Difference]: Without dead ends: 1971 [2019-10-03 02:50:44,028 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:50:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2019-10-03 02:50:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1934. [2019-10-03 02:50:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2019-10-03 02:50:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2772 transitions. [2019-10-03 02:50:44,116 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2772 transitions. Word has length 212 [2019-10-03 02:50:44,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:44,117 INFO L475 AbstractCegarLoop]: Abstraction has 1934 states and 2772 transitions. [2019-10-03 02:50:44,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 02:50:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2772 transitions. [2019-10-03 02:50:44,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:50:44,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:44,127 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:44,127 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:44,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:44,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1577885369, now seen corresponding path program 1 times [2019-10-03 02:50:44,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:44,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:44,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:44,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:44,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:44,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:44,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:50:44,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:44,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:50:44,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:50:44,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:50:44,365 INFO L87 Difference]: Start difference. First operand 1934 states and 2772 transitions. Second operand 11 states. [2019-10-03 02:50:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:44,818 INFO L93 Difference]: Finished difference Result 2064 states and 2987 transitions. [2019-10-03 02:50:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:50:44,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 213 [2019-10-03 02:50:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:44,835 INFO L225 Difference]: With dead ends: 2064 [2019-10-03 02:50:44,836 INFO L226 Difference]: Without dead ends: 2056 [2019-10-03 02:50:44,836 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:50:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2019-10-03 02:50:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 2056. [2019-10-03 02:50:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-10-03 02:50:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2969 transitions. [2019-10-03 02:50:44,959 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2969 transitions. Word has length 213 [2019-10-03 02:50:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:44,960 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2969 transitions. [2019-10-03 02:50:44,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:50:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2969 transitions. [2019-10-03 02:50:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:50:44,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:44,974 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:44,975 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:44,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:44,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1520134915, now seen corresponding path program 1 times [2019-10-03 02:50:44,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:44,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:44,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:44,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:44,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:45,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:45,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:50:45,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:45,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:50:45,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:50:45,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:50:45,581 INFO L87 Difference]: Start difference. First operand 2056 states and 2969 transitions. Second operand 15 states. [2019-10-03 02:50:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:49,634 INFO L93 Difference]: Finished difference Result 2174 states and 3155 transitions. [2019-10-03 02:50:49,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-03 02:50:49,635 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 213 [2019-10-03 02:50:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:49,649 INFO L225 Difference]: With dead ends: 2174 [2019-10-03 02:50:49,649 INFO L226 Difference]: Without dead ends: 2174 [2019-10-03 02:50:49,650 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-03 02:50:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2019-10-03 02:50:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2137. [2019-10-03 02:50:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2019-10-03 02:50:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3106 transitions. [2019-10-03 02:50:49,736 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3106 transitions. Word has length 213 [2019-10-03 02:50:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:49,737 INFO L475 AbstractCegarLoop]: Abstraction has 2137 states and 3106 transitions. [2019-10-03 02:50:49,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:50:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3106 transitions. [2019-10-03 02:50:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-03 02:50:49,746 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:49,746 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:49,747 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:49,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:49,747 INFO L82 PathProgramCache]: Analyzing trace with hash -216810818, now seen corresponding path program 1 times [2019-10-03 02:50:49,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:49,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:49,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:49,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:49,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:50:49,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:49,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:49,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:49,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:49,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:49,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:49,923 INFO L87 Difference]: Start difference. First operand 2137 states and 3106 transitions. Second operand 5 states. [2019-10-03 02:50:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:50,015 INFO L93 Difference]: Finished difference Result 1780 states and 2595 transitions. [2019-10-03 02:50:50,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:50:50,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 216 [2019-10-03 02:50:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:50,032 INFO L225 Difference]: With dead ends: 1780 [2019-10-03 02:50:50,032 INFO L226 Difference]: Without dead ends: 1777 [2019-10-03 02:50:50,033 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:50:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2019-10-03 02:50:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1777. [2019-10-03 02:50:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1777 states. [2019-10-03 02:50:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2591 transitions. [2019-10-03 02:50:50,113 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2591 transitions. Word has length 216 [2019-10-03 02:50:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:50,113 INFO L475 AbstractCegarLoop]: Abstraction has 1777 states and 2591 transitions. [2019-10-03 02:50:50,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2591 transitions. [2019-10-03 02:50:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:50:50,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:50,126 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:50,127 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:50,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:50,127 INFO L82 PathProgramCache]: Analyzing trace with hash -455156519, now seen corresponding path program 1 times [2019-10-03 02:50:50,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:50,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:50,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:50,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:50,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-03 02:50:50,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:50,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-03 02:50:50,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:50,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 02:50:50,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 02:50:50,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:50:50,417 INFO L87 Difference]: Start difference. First operand 1777 states and 2591 transitions. Second operand 16 states. [2019-10-03 02:50:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:50,867 INFO L93 Difference]: Finished difference Result 1809 states and 2623 transitions. [2019-10-03 02:50:50,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:50:50,867 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 213 [2019-10-03 02:50:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:50,878 INFO L225 Difference]: With dead ends: 1809 [2019-10-03 02:50:50,878 INFO L226 Difference]: Without dead ends: 1809 [2019-10-03 02:50:50,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-03 02:50:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2019-10-03 02:50:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1807. [2019-10-03 02:50:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1807 states. [2019-10-03 02:50:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2621 transitions. [2019-10-03 02:50:50,943 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2621 transitions. Word has length 213 [2019-10-03 02:50:50,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:50,944 INFO L475 AbstractCegarLoop]: Abstraction has 1807 states and 2621 transitions. [2019-10-03 02:50:50,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 02:50:50,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2621 transitions. [2019-10-03 02:50:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:50:50,951 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:50,951 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:50,952 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:50,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:50,952 INFO L82 PathProgramCache]: Analyzing trace with hash -669130923, now seen corresponding path program 1 times [2019-10-03 02:50:50,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:50,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:50,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:50,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:50,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:51,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:51,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:51,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:51,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:51,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:51,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:51,204 INFO L87 Difference]: Start difference. First operand 1807 states and 2621 transitions. Second operand 5 states. [2019-10-03 02:50:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:52,394 INFO L93 Difference]: Finished difference Result 3842 states and 5527 transitions. [2019-10-03 02:50:52,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:50:52,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-10-03 02:50:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:52,417 INFO L225 Difference]: With dead ends: 3842 [2019-10-03 02:50:52,418 INFO L226 Difference]: Without dead ends: 3842 [2019-10-03 02:50:52,418 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:50:52,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3842 states. [2019-10-03 02:50:52,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3842 to 3828. [2019-10-03 02:50:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3828 states. [2019-10-03 02:50:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3828 states and 5510 transitions. [2019-10-03 02:50:52,540 INFO L78 Accepts]: Start accepts. Automaton has 3828 states and 5510 transitions. Word has length 213 [2019-10-03 02:50:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:52,540 INFO L475 AbstractCegarLoop]: Abstraction has 3828 states and 5510 transitions. [2019-10-03 02:50:52,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3828 states and 5510 transitions. [2019-10-03 02:50:52,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:50:52,552 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:52,552 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:52,552 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:52,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:52,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1624652202, now seen corresponding path program 1 times [2019-10-03 02:50:52,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:52,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:52,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:52,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:52,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:52,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:52,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:50:52,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:52,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:50:52,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:50:52,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:50:52,832 INFO L87 Difference]: Start difference. First operand 3828 states and 5510 transitions. Second operand 7 states. [2019-10-03 02:50:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:55,268 INFO L93 Difference]: Finished difference Result 9194 states and 13880 transitions. [2019-10-03 02:50:55,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:50:55,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 213 [2019-10-03 02:50:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:55,356 INFO L225 Difference]: With dead ends: 9194 [2019-10-03 02:50:55,357 INFO L226 Difference]: Without dead ends: 9194 [2019-10-03 02:50:55,357 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:50:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9194 states. [2019-10-03 02:50:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9194 to 9184. [2019-10-03 02:50:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9184 states. [2019-10-03 02:50:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9184 states to 9184 states and 13864 transitions. [2019-10-03 02:50:55,766 INFO L78 Accepts]: Start accepts. Automaton has 9184 states and 13864 transitions. Word has length 213 [2019-10-03 02:50:55,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:55,767 INFO L475 AbstractCegarLoop]: Abstraction has 9184 states and 13864 transitions. [2019-10-03 02:50:55,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:50:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 9184 states and 13864 transitions. [2019-10-03 02:50:55,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-03 02:50:55,780 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:55,780 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:55,781 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:55,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:55,781 INFO L82 PathProgramCache]: Analyzing trace with hash 902999511, now seen corresponding path program 1 times [2019-10-03 02:50:55,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:55,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:55,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:55,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:55,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:56,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:56,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-10-03 02:50:56,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:56,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-03 02:50:56,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-03 02:50:56,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-10-03 02:50:56,299 INFO L87 Difference]: Start difference. First operand 9184 states and 13864 transitions. Second operand 28 states. [2019-10-03 02:50:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:57,422 INFO L93 Difference]: Finished difference Result 10355 states and 15687 transitions. [2019-10-03 02:50:57,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-03 02:50:57,423 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 214 [2019-10-03 02:50:57,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:57,473 INFO L225 Difference]: With dead ends: 10355 [2019-10-03 02:50:57,474 INFO L226 Difference]: Without dead ends: 10355 [2019-10-03 02:50:57,475 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-10-03 02:50:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10355 states. [2019-10-03 02:50:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10355 to 10338. [2019-10-03 02:50:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10338 states. [2019-10-03 02:50:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10338 states to 10338 states and 15662 transitions. [2019-10-03 02:50:57,827 INFO L78 Accepts]: Start accepts. Automaton has 10338 states and 15662 transitions. Word has length 214 [2019-10-03 02:50:57,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:57,828 INFO L475 AbstractCegarLoop]: Abstraction has 10338 states and 15662 transitions. [2019-10-03 02:50:57,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-03 02:50:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 10338 states and 15662 transitions. [2019-10-03 02:50:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-03 02:50:57,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:57,841 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:57,841 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:57,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:57,841 INFO L82 PathProgramCache]: Analyzing trace with hash 338732121, now seen corresponding path program 1 times [2019-10-03 02:50:57,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:57,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:57,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:58,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:58,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:50:58,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:58,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:50:58,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:50:58,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:50:58,025 INFO L87 Difference]: Start difference. First operand 10338 states and 15662 transitions. Second operand 10 states. [2019-10-03 02:50:58,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:58,118 INFO L93 Difference]: Finished difference Result 10434 states and 15774 transitions. [2019-10-03 02:50:58,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:50:58,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 218 [2019-10-03 02:50:58,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:58,160 INFO L225 Difference]: With dead ends: 10434 [2019-10-03 02:50:58,160 INFO L226 Difference]: Without dead ends: 10434 [2019-10-03 02:50:58,161 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:50:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10434 states. [2019-10-03 02:50:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10434 to 10434. [2019-10-03 02:50:58,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10434 states. [2019-10-03 02:50:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10434 states to 10434 states and 15774 transitions. [2019-10-03 02:50:58,538 INFO L78 Accepts]: Start accepts. Automaton has 10434 states and 15774 transitions. Word has length 218 [2019-10-03 02:50:58,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:58,539 INFO L475 AbstractCegarLoop]: Abstraction has 10434 states and 15774 transitions. [2019-10-03 02:50:58,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:50:58,540 INFO L276 IsEmpty]: Start isEmpty. Operand 10434 states and 15774 transitions. [2019-10-03 02:50:58,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-03 02:50:58,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:58,555 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:58,555 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:58,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:58,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1284073295, now seen corresponding path program 1 times [2019-10-03 02:50:58,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:58,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:58,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:58,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:58,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:59,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:59,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:59,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:59,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:59,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:59,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:59,315 INFO L87 Difference]: Start difference. First operand 10434 states and 15774 transitions. Second operand 5 states. [2019-10-03 02:50:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:59,403 INFO L93 Difference]: Finished difference Result 10761 states and 16634 transitions. [2019-10-03 02:50:59,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:50:59,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-10-03 02:50:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:59,444 INFO L225 Difference]: With dead ends: 10761 [2019-10-03 02:50:59,444 INFO L226 Difference]: Without dead ends: 10761 [2019-10-03 02:50:59,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:59,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10761 states. [2019-10-03 02:50:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10761 to 10590. [2019-10-03 02:50:59,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10590 states. [2019-10-03 02:50:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10590 states to 10590 states and 15929 transitions. [2019-10-03 02:50:59,804 INFO L78 Accepts]: Start accepts. Automaton has 10590 states and 15929 transitions. Word has length 223 [2019-10-03 02:50:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:59,805 INFO L475 AbstractCegarLoop]: Abstraction has 10590 states and 15929 transitions. [2019-10-03 02:50:59,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:59,805 INFO L276 IsEmpty]: Start isEmpty. Operand 10590 states and 15929 transitions. [2019-10-03 02:50:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-03 02:50:59,818 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:59,818 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:59,818 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:59,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:59,819 INFO L82 PathProgramCache]: Analyzing trace with hash 965874213, now seen corresponding path program 1 times [2019-10-03 02:50:59,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:59,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:59,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:59,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:59,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:59,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:50:59,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:59,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:50:59,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:50:59,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:50:59,983 INFO L87 Difference]: Start difference. First operand 10590 states and 15929 transitions. Second operand 6 states. [2019-10-03 02:51:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:00,597 INFO L93 Difference]: Finished difference Result 21427 states and 33049 transitions. [2019-10-03 02:51:00,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:51:00,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 224 [2019-10-03 02:51:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:00,692 INFO L225 Difference]: With dead ends: 21427 [2019-10-03 02:51:00,692 INFO L226 Difference]: Without dead ends: 21427 [2019-10-03 02:51:00,693 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:51:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21427 states. [2019-10-03 02:51:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21427 to 21067. [2019-10-03 02:51:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21067 states. [2019-10-03 02:51:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21067 states to 21067 states and 31816 transitions. [2019-10-03 02:51:01,468 INFO L78 Accepts]: Start accepts. Automaton has 21067 states and 31816 transitions. Word has length 224 [2019-10-03 02:51:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:01,469 INFO L475 AbstractCegarLoop]: Abstraction has 21067 states and 31816 transitions. [2019-10-03 02:51:01,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:51:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21067 states and 31816 transitions. [2019-10-03 02:51:01,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-03 02:51:01,505 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:51:01,506 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:51:01,506 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:51:01,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:01,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1630949321, now seen corresponding path program 1 times [2019-10-03 02:51:01,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:51:01,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:01,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:51:01,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:01,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:51:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:51:01,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:51:01,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:51:01,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:01,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:51:01,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:51:01,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:51:01,656 INFO L87 Difference]: Start difference. First operand 21067 states and 31816 transitions. Second operand 3 states. [2019-10-03 02:51:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:01,776 INFO L93 Difference]: Finished difference Result 22057 states and 33694 transitions. [2019-10-03 02:51:01,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:51:01,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-10-03 02:51:01,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:01,868 INFO L225 Difference]: With dead ends: 22057 [2019-10-03 02:51:01,868 INFO L226 Difference]: Without dead ends: 22057 [2019-10-03 02:51:01,868 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:51:01,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22057 states. [2019-10-03 02:51:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22057 to 22051. [2019-10-03 02:51:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22051 states. [2019-10-03 02:51:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22051 states to 22051 states and 33688 transitions. [2019-10-03 02:51:03,455 INFO L78 Accepts]: Start accepts. Automaton has 22051 states and 33688 transitions. Word has length 259 [2019-10-03 02:51:03,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:03,456 INFO L475 AbstractCegarLoop]: Abstraction has 22051 states and 33688 transitions. [2019-10-03 02:51:03,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:51:03,456 INFO L276 IsEmpty]: Start isEmpty. Operand 22051 states and 33688 transitions. [2019-10-03 02:51:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-03 02:51:03,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:51:03,489 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:51:03,489 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:51:03,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:03,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1522240526, now seen corresponding path program 1 times [2019-10-03 02:51:03,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:51:03,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:03,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:51:03,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:03,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:51:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:51:03,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:51:03,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:51:03,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:03,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:51:03,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:51:03,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:51:03,698 INFO L87 Difference]: Start difference. First operand 22051 states and 33688 transitions. Second operand 8 states. [2019-10-03 02:51:08,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:08,970 INFO L93 Difference]: Finished difference Result 44781 states and 70501 transitions. [2019-10-03 02:51:08,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:51:08,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 260 [2019-10-03 02:51:08,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:09,111 INFO L225 Difference]: With dead ends: 44781 [2019-10-03 02:51:09,112 INFO L226 Difference]: Without dead ends: 44781 [2019-10-03 02:51:09,112 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:51:09,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44781 states. [2019-10-03 02:51:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44781 to 25777. [2019-10-03 02:51:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25777 states. [2019-10-03 02:51:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25777 states to 25777 states and 41512 transitions. [2019-10-03 02:51:10,072 INFO L78 Accepts]: Start accepts. Automaton has 25777 states and 41512 transitions. Word has length 260 [2019-10-03 02:51:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:10,072 INFO L475 AbstractCegarLoop]: Abstraction has 25777 states and 41512 transitions. [2019-10-03 02:51:10,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:51:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 25777 states and 41512 transitions. [2019-10-03 02:51:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-03 02:51:10,310 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:51:10,310 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:51:10,310 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:51:10,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:10,311 INFO L82 PathProgramCache]: Analyzing trace with hash -495178032, now seen corresponding path program 1 times [2019-10-03 02:51:10,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:51:10,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:10,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:51:10,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:10,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:51:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:51:10,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:51:10,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:51:10,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:10,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:51:10,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:51:10,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:51:10,492 INFO L87 Difference]: Start difference. First operand 25777 states and 41512 transitions. Second operand 8 states. [2019-10-03 02:51:16,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:16,368 INFO L93 Difference]: Finished difference Result 53037 states and 89515 transitions. [2019-10-03 02:51:16,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:51:16,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 246 [2019-10-03 02:51:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:16,506 INFO L225 Difference]: With dead ends: 53037 [2019-10-03 02:51:16,507 INFO L226 Difference]: Without dead ends: 53037 [2019-10-03 02:51:16,507 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:51:16,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53037 states. [2019-10-03 02:51:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53037 to 33409. [2019-10-03 02:51:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33409 states. [2019-10-03 02:51:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33409 states to 33409 states and 58756 transitions. [2019-10-03 02:51:17,408 INFO L78 Accepts]: Start accepts. Automaton has 33409 states and 58756 transitions. Word has length 246 [2019-10-03 02:51:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:17,409 INFO L475 AbstractCegarLoop]: Abstraction has 33409 states and 58756 transitions. [2019-10-03 02:51:17,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:51:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 33409 states and 58756 transitions. [2019-10-03 02:51:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-03 02:51:17,484 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:51:17,485 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:51:17,485 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:51:17,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:17,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1676298254, now seen corresponding path program 1 times [2019-10-03 02:51:17,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:51:17,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:17,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:51:17,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:17,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:51:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:51:17,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:51:17,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:51:17,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:17,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:51:17,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:51:17,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:51:17,700 INFO L87 Difference]: Start difference. First operand 33409 states and 58756 transitions. Second operand 8 states. [2019-10-03 02:51:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:22,785 INFO L93 Difference]: Finished difference Result 69777 states and 130669 transitions. [2019-10-03 02:51:22,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:51:22,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 262 [2019-10-03 02:51:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:23,014 INFO L225 Difference]: With dead ends: 69777 [2019-10-03 02:51:23,014 INFO L226 Difference]: Without dead ends: 69777 [2019-10-03 02:51:23,015 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:51:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69777 states. [2019-10-03 02:51:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69777 to 48865. [2019-10-03 02:51:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48865 states. [2019-10-03 02:51:25,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48865 states to 48865 states and 96226 transitions. [2019-10-03 02:51:25,646 INFO L78 Accepts]: Start accepts. Automaton has 48865 states and 96226 transitions. Word has length 262 [2019-10-03 02:51:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:25,646 INFO L475 AbstractCegarLoop]: Abstraction has 48865 states and 96226 transitions. [2019-10-03 02:51:25,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:51:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 48865 states and 96226 transitions. [2019-10-03 02:51:25,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-03 02:51:25,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:51:25,789 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] [2019-10-03 02:51:25,789 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:51:25,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:25,790 INFO L82 PathProgramCache]: Analyzing trace with hash 313851400, now seen corresponding path program 1 times [2019-10-03 02:51:25,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:51:25,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:25,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:51:25,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:25,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:51:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:51:25,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:51:25,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:51:25,965 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2019-10-03 02:51:25,969 INFO L207 CegarAbsIntRunner]: [44], [85], [88], [98], [109], [112], [122], [123], [139], [142], [151], [152], [155], [156], [157], [159], [241], [244], [250], [269], [271], [275], [278], [279], [280], [283], [289], [313], [315], [317], [324], [328], [330], [331], [334], [343], [354], [356], [359], [363], [364], [366], [367], [370], [380], [381], [382], [383], [385], [390], [404], [407], [410], [433], [434], [437], [446], [622], [624], [625], [626], [664], [667], [681], [720], [721], [722], [724], [727], [730], [736], [760], [764], [767], [775], [778], [789], [811], [813], [816], [818], [821], [823], [825], [828], [844], [853], [857], [859], [861], [864], [871], [878], [881], [883], [1021], [1024], [1038], [1146], [1218], [1220], [1237], [1241], [1252], [1255], [1256], [1259], [1263], [1267], [1293], [1296], [1298], [1367], [1370], [1376], [1377], [1380], [1390], [1411], [1414], [1428], [1436], [1439], [1448], [1642], [1644], [1646], [1648], [1649], [1661], [1679], [1689], [1690], [1691], [1692], [1693], [1694], [1697], [1698], [1699], [1700], [1701], [1703], [1704], [1705], [1706], [1713], [1714], [1715], [1716], [1721], [1723], [1724], [1729], [1730], [1733], [1734], [1735], [1736], [1737], [1743], [1744], [1745], [1746], [1747], [1749], [1750], [1771], [1772], [1787], [1788], [1789], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1799], [1801], [1802], [1803], [1804], [1813], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1832], [1833], [1839], [1840], [1859], [1861], [1862], [1879], [1881], [1882], [1883], [1884], [1885], [1886], [1887], [1909], [1910], [1911], [1912], [1913], [1914], [1915], [1916], [1917] [2019-10-03 02:51:26,014 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:51:26,015 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:51:26,151 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:51:26,153 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 225 root evaluator evaluations with a maximum evaluation depth of 0. Performed 225 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 372 variables. [2019-10-03 02:51:26,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:26,157 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:51:26,282 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:51:26,283 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:51:26,291 INFO L420 sIntCurrentIteration]: We unified 242 AI predicates to 242 [2019-10-03 02:51:26,291 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:51:26,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:51:26,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-03 02:51:26,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:26,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:51:26,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:51:26,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:51:26,294 INFO L87 Difference]: Start difference. First operand 48865 states and 96226 transitions. Second operand 2 states. [2019-10-03 02:51:26,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:26,295 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:51:26,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:51:26,295 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 243 [2019-10-03 02:51:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:26,296 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:51:26,296 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:51:26,296 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:51:26,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:51:26,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:51:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:51:26,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:51:26,297 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 243 [2019-10-03 02:51:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:26,297 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:51:26,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:51:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:51:26,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:51:26,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:51:26 BoogieIcfgContainer [2019-10-03 02:51:26,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:51:26,307 INFO L168 Benchmark]: Toolchain (without parser) took 53850.99 ms. Allocated memory was 137.4 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 81.9 MB in the beginning and 412.8 MB in the end (delta: -330.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-10-03 02:51:26,312 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 103.4 MB in the beginning and 103.2 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:51:26,313 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1067.34 ms. Allocated memory was 137.4 MB in the beginning and 198.7 MB in the end (delta: 61.3 MB). Free memory was 81.7 MB in the beginning and 128.8 MB in the end (delta: -47.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:26,314 INFO L168 Benchmark]: Boogie Preprocessor took 182.48 ms. Allocated memory is still 198.7 MB. Free memory was 128.8 MB in the beginning and 119.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:26,315 INFO L168 Benchmark]: RCFGBuilder took 2442.38 ms. Allocated memory was 198.7 MB in the beginning and 277.9 MB in the end (delta: 79.2 MB). Free memory was 119.8 MB in the beginning and 175.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 82.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:26,318 INFO L168 Benchmark]: TraceAbstraction took 50153.86 ms. Allocated memory was 277.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 175.1 MB in the beginning and 412.8 MB in the end (delta: -237.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-10-03 02:51:26,328 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.23 ms. Allocated memory is still 137.4 MB. Free memory was 103.4 MB in the beginning and 103.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1067.34 ms. Allocated memory was 137.4 MB in the beginning and 198.7 MB in the end (delta: 61.3 MB). Free memory was 81.7 MB in the beginning and 128.8 MB in the end (delta: -47.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 182.48 ms. Allocated memory is still 198.7 MB. Free memory was 128.8 MB in the beginning and 119.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2442.38 ms. Allocated memory was 198.7 MB in the beginning and 277.9 MB in the end (delta: 79.2 MB). Free memory was 119.8 MB in the beginning and 175.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 82.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50153.86 ms. Allocated memory was 277.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 175.1 MB in the beginning and 412.8 MB in the end (delta: -237.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2955]: 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 115 procedures, 787 locations, 1 error locations. SAFE Result, 50.0s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 33.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17288 SDtfs, 12968 SDslu, 94398 SDs, 0 SdLazy, 23822 SolverSat, 3012 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 585 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48865occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.041322314049587 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 60201 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 4450 NumberOfCodeBlocks, 4450 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4430 ConstructedInterpolants, 0 QuantifiedInterpolants, 1312075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 699/701 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...