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_spec7_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:54:39,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:54:39,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:54:39,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:54:39,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:54:39,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:54:39,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:54:39,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:54:39,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:54:39,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:54:39,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:54:39,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:54:39,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:54:39,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:54:39,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:54:39,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:54:39,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:54:39,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:54:39,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:54:39,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:54:39,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:54:39,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:54:39,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:54:39,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:54:39,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:54:39,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:54:39,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:54:39,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:54:39,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:54:39,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:54:39,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:54:39,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:54:39,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:54:39,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:54:39,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:54:39,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:54:39,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:54:39,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:54:39,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:54:39,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:54:39,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:54:39,516 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:54:39,531 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:54:39,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:54:39,532 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:54:39,532 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:54:39,533 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:54:39,533 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:54:39,533 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:54:39,534 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:54:39,534 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:54:39,534 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:54:39,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:54:39,535 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:54:39,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:54:39,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:54:39,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:54:39,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:54:39,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:54:39,536 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:54:39,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:54:39,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:54:39,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:54:39,537 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:54:39,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:54:39,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:54:39,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:54:39,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:54:39,538 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:54:39,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:54:39,538 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:54:39,538 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:54:39,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:54:39,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:54:39,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:54:39,588 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:54:39,588 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:54:39,589 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product28.cil.c [2019-10-03 02:54:39,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82f0cd7c/973f6a18b0394b24a38d40b4cbfe36fb/FLAG8258fd1a8 [2019-10-03 02:54:40,271 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:54:40,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product28.cil.c [2019-10-03 02:54:40,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82f0cd7c/973f6a18b0394b24a38d40b4cbfe36fb/FLAG8258fd1a8 [2019-10-03 02:54:40,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82f0cd7c/973f6a18b0394b24a38d40b4cbfe36fb [2019-10-03 02:54:40,504 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:54:40,506 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:54:40,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:54:40,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:54:40,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:54:40,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:54:40" (1/1) ... [2019-10-03 02:54:40,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73fee35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:40, skipping insertion in model container [2019-10-03 02:54:40,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:54:40" (1/1) ... [2019-10-03 02:54:40,523 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:54:40,596 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:54:41,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:54:41,281 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:54:41,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:54:41,567 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:54:41,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:41 WrapperNode [2019-10-03 02:54:41,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:54:41,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:54:41,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:54:41,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:54:41,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:41" (1/1) ... [2019-10-03 02:54:41,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:41" (1/1) ... [2019-10-03 02:54:41,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:41" (1/1) ... [2019-10-03 02:54:41,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:41" (1/1) ... [2019-10-03 02:54:41,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:41" (1/1) ... [2019-10-03 02:54:41,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:41" (1/1) ... [2019-10-03 02:54:41,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:41" (1/1) ... [2019-10-03 02:54:41,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:54:41,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:54:41,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:54:41,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:54:41,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:54:41,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:54:41,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:54:41,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:54:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:54:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:54:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-10-03 02:54:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-03 02:54:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:54:41,862 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:54:41,862 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:54:41,862 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:54:41,863 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:54:41,863 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:54:41,863 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:54:41,863 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:54:41,864 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:54:41,864 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:54:41,864 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:54:41,864 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-03 02:54:41,864 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:54:41,865 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:54:41,865 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-03 02:54:41,865 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-03 02:54:41,865 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:54:41,865 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:54:41,866 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:54:41,866 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:54:41,866 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:54:41,866 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:54:41,867 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:54:41,867 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:54:41,867 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:54:41,867 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-03 02:54:41,867 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-03 02:54:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:54:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:54:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:54:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:54:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:54:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:54:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:54:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:54:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:54:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:54:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:54:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:54:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:54:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:54:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:54:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:54:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:54:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:54:41,871 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:54:41,871 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:54:41,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-03 02:54:41,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:54:41,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:54:41,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:54:41,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:54:41,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:54:41,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:54:41,872 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:54:41,872 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:54:41,872 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:54:41,872 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:54:41,873 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:54:41,873 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:54:41,873 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:54:41,873 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:54:41,873 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:54:41,873 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:54:41,874 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:54:41,874 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:54:41,874 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:54:41,874 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:54:41,874 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:54:41,874 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:54:41,875 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:54:41,875 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:54:41,875 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:54:41,875 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:54:41,875 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:54:41,875 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:54:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:54:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:54:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:54:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:54:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:54:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:54:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:54:41,877 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:54:41,877 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:54:41,877 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:54:41,877 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:54:41,877 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:54:41,877 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:54:41,878 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:54:41,878 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:54:41,878 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:54:41,878 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:54:41,878 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:54:41,878 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:54:41,878 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:54:41,879 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:54:41,879 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:54:41,879 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:54:41,879 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:54:41,879 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:54:41,879 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:54:41,880 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:54:41,880 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:54:41,880 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:54:41,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:54:41,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:54:41,880 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:54:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:54:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:54:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:54:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:54:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:54:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:54:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:54:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:54:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:54:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:54:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:54:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:54:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:54:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:54:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:54:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:54:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:54:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-10-03 02:54:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-03 02:54:41,884 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:54:41,884 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:54:41,884 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:54:41,884 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:54:41,884 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:54:41,884 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:54:41,885 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:54:41,885 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:54:41,885 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:54:41,885 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:54:41,885 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:54:41,885 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:54:41,885 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:54:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:54:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:54:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:54:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:54:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:54:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:54:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:54:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:54:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:54:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:54:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:54:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:54:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:54:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:54:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:54:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-03 02:54:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-03 02:54:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:54:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-03 02:54:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-03 02:54:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-03 02:54:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-03 02:54:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:54:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:54:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:54:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:54:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:54:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:54:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:54:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:54:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:54:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:54:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:54:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:54:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:54:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:54:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:54:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:54:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:54:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:54:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:54:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:54:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:54:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:54:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:54:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:54:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:54:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:54:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:54:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:54:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:54:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:54:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:54:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:54:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:54:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:54:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:54:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:54:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:54:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:54:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:54:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:54:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:54:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:54:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:54:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:54:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:54:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:54:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:54:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:54:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:54:41,896 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:54:41,896 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:54:41,896 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:54:41,896 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:54:41,896 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:54:41,896 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:54:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:54:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:54:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:54:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:54:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:54:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:54:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:54:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:54:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:54:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:54:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:54:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:54:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:54:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:54:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:54:44,008 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:54:44,009 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:54:44,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:54:44 BoogieIcfgContainer [2019-10-03 02:54:44,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:54:44,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:54:44,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:54:44,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:54:44,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:54:40" (1/3) ... [2019-10-03 02:54:44,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1d3d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:54:44, skipping insertion in model container [2019-10-03 02:54:44,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:41" (2/3) ... [2019-10-03 02:54:44,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1d3d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:54:44, skipping insertion in model container [2019-10-03 02:54:44,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:54:44" (3/3) ... [2019-10-03 02:54:44,019 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product28.cil.c [2019-10-03 02:54:44,030 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:54:44,039 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:54:44,057 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:54:44,085 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:54:44,085 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:54:44,085 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:54:44,085 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:54:44,086 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:54:44,086 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:54:44,086 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:54:44,086 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:54:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states. [2019-10-03 02:54:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-03 02:54:44,156 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:44,159 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:44,166 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:44,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:44,174 INFO L82 PathProgramCache]: Analyzing trace with hash 791417093, now seen corresponding path program 1 times [2019-10-03 02:54:44,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:44,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:44,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:44,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:44,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:44,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:44,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:54:44,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:44,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:54:44,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:54:44,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:54:44,880 INFO L87 Difference]: Start difference. First operand 505 states. Second operand 2 states. [2019-10-03 02:54:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:44,937 INFO L93 Difference]: Finished difference Result 463 states and 616 transitions. [2019-10-03 02:54:44,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:54:44,939 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 182 [2019-10-03 02:54:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:44,967 INFO L225 Difference]: With dead ends: 463 [2019-10-03 02:54:44,967 INFO L226 Difference]: Without dead ends: 454 [2019-10-03 02:54:44,970 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:54:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-10-03 02:54:45,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2019-10-03 02:54:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-10-03 02:54:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 605 transitions. [2019-10-03 02:54:45,069 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 605 transitions. Word has length 182 [2019-10-03 02:54:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:45,071 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 605 transitions. [2019-10-03 02:54:45,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:54:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 605 transitions. [2019-10-03 02:54:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-03 02:54:45,077 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:45,078 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:45,078 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:45,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:45,079 INFO L82 PathProgramCache]: Analyzing trace with hash 34062624, now seen corresponding path program 1 times [2019-10-03 02:54:45,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:45,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:45,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:45,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:45,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:45,427 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:45,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:45,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:45,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:45,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:45,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:45,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:45,433 INFO L87 Difference]: Start difference. First operand 454 states and 605 transitions. Second operand 3 states. [2019-10-03 02:54:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:45,503 INFO L93 Difference]: Finished difference Result 457 states and 608 transitions. [2019-10-03 02:54:45,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:45,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-10-03 02:54:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:45,515 INFO L225 Difference]: With dead ends: 457 [2019-10-03 02:54:45,515 INFO L226 Difference]: Without dead ends: 457 [2019-10-03 02:54:45,516 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-10-03 02:54:45,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 456. [2019-10-03 02:54:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-03 02:54:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 607 transitions. [2019-10-03 02:54:45,569 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 607 transitions. Word has length 183 [2019-10-03 02:54:45,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:45,572 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 607 transitions. [2019-10-03 02:54:45,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:45,573 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 607 transitions. [2019-10-03 02:54:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-03 02:54:45,578 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:45,578 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] [2019-10-03 02:54:45,579 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:45,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:45,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2105837044, now seen corresponding path program 1 times [2019-10-03 02:54:45,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:45,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:45,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:45,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:45,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:45,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:45,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:45,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:45,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:45,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:45,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:45,871 INFO L87 Difference]: Start difference. First operand 456 states and 607 transitions. Second operand 3 states. [2019-10-03 02:54:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:45,898 INFO L93 Difference]: Finished difference Result 495 states and 674 transitions. [2019-10-03 02:54:45,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:45,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-10-03 02:54:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:45,902 INFO L225 Difference]: With dead ends: 495 [2019-10-03 02:54:45,903 INFO L226 Difference]: Without dead ends: 495 [2019-10-03 02:54:45,903 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-10-03 02:54:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 494. [2019-10-03 02:54:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-03 02:54:45,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 673 transitions. [2019-10-03 02:54:45,922 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 673 transitions. Word has length 189 [2019-10-03 02:54:45,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:45,923 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 673 transitions. [2019-10-03 02:54:45,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:45,923 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 673 transitions. [2019-10-03 02:54:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-03 02:54:45,927 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:45,928 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] [2019-10-03 02:54:45,928 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash -89354053, now seen corresponding path program 1 times [2019-10-03 02:54:45,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:45,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:45,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:45,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:45,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:54:46,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:46,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 02:54:46,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:46,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 02:54:46,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 02:54:46,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:54:46,381 INFO L87 Difference]: Start difference. First operand 494 states and 673 transitions. Second operand 19 states. [2019-10-03 02:54:50,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:50,961 INFO L93 Difference]: Finished difference Result 1451 states and 1978 transitions. [2019-10-03 02:54:50,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-03 02:54:50,961 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 190 [2019-10-03 02:54:50,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:50,972 INFO L225 Difference]: With dead ends: 1451 [2019-10-03 02:54:50,972 INFO L226 Difference]: Without dead ends: 1451 [2019-10-03 02:54:50,974 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=2385, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 02:54:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-10-03 02:54:51,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1419. [2019-10-03 02:54:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-10-03 02:54:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1938 transitions. [2019-10-03 02:54:51,038 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1938 transitions. Word has length 190 [2019-10-03 02:54:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:51,039 INFO L475 AbstractCegarLoop]: Abstraction has 1419 states and 1938 transitions. [2019-10-03 02:54:51,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 02:54:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1938 transitions. [2019-10-03 02:54:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-03 02:54:51,045 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:51,045 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] [2019-10-03 02:54:51,046 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:51,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:51,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2067450055, now seen corresponding path program 1 times [2019-10-03 02:54:51,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:51,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:51,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:51,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:51,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:51,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:51,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:54:51,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:51,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:54:51,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:54:51,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:54:51,262 INFO L87 Difference]: Start difference. First operand 1419 states and 1938 transitions. Second operand 11 states. [2019-10-03 02:54:51,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:51,614 INFO L93 Difference]: Finished difference Result 1502 states and 2063 transitions. [2019-10-03 02:54:51,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:54:51,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 191 [2019-10-03 02:54:51,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:51,625 INFO L225 Difference]: With dead ends: 1502 [2019-10-03 02:54:51,626 INFO L226 Difference]: Without dead ends: 1484 [2019-10-03 02:54:51,626 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:54:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2019-10-03 02:54:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1477. [2019-10-03 02:54:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1477 states. [2019-10-03 02:54:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2031 transitions. [2019-10-03 02:54:51,705 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 2031 transitions. Word has length 191 [2019-10-03 02:54:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:51,707 INFO L475 AbstractCegarLoop]: Abstraction has 1477 states and 2031 transitions. [2019-10-03 02:54:51,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:54:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 2031 transitions. [2019-10-03 02:54:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-03 02:54:51,788 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:51,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] [2019-10-03 02:54:51,789 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:51,790 INFO L82 PathProgramCache]: Analyzing trace with hash -393480967, now seen corresponding path program 1 times [2019-10-03 02:54:51,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:51,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:51,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:51,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:51,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:51,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:51,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:54:51,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:51,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:54:51,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:54:51,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:54:51,958 INFO L87 Difference]: Start difference. First operand 1477 states and 2031 transitions. Second operand 5 states. [2019-10-03 02:54:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:52,952 INFO L93 Difference]: Finished difference Result 3145 states and 4340 transitions. [2019-10-03 02:54:52,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:54:52,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-10-03 02:54:52,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:52,975 INFO L225 Difference]: With dead ends: 3145 [2019-10-03 02:54:52,975 INFO L226 Difference]: Without dead ends: 3145 [2019-10-03 02:54:52,976 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:54:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2019-10-03 02:54:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 3125. [2019-10-03 02:54:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2019-10-03 02:54:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4309 transitions. [2019-10-03 02:54:53,148 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4309 transitions. Word has length 191 [2019-10-03 02:54:53,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:53,149 INFO L475 AbstractCegarLoop]: Abstraction has 3125 states and 4309 transitions. [2019-10-03 02:54:53,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:54:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4309 transitions. [2019-10-03 02:54:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-03 02:54:53,157 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:53,158 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] [2019-10-03 02:54:53,158 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:53,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:53,158 INFO L82 PathProgramCache]: Analyzing trace with hash -373143592, now seen corresponding path program 1 times [2019-10-03 02:54:53,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:53,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:53,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:53,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:53,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:53,486 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:53,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:53,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:54:53,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:53,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:54:53,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:54:53,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:54:53,488 INFO L87 Difference]: Start difference. First operand 3125 states and 4309 transitions. Second operand 7 states. [2019-10-03 02:54:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:55,367 INFO L93 Difference]: Finished difference Result 7862 states and 11028 transitions. [2019-10-03 02:54:55,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:54:55,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2019-10-03 02:54:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:55,426 INFO L225 Difference]: With dead ends: 7862 [2019-10-03 02:54:55,426 INFO L226 Difference]: Without dead ends: 7862 [2019-10-03 02:54:55,427 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:54:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7862 states. [2019-10-03 02:54:55,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7862 to 7822. [2019-10-03 02:54:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7822 states. [2019-10-03 02:54:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7822 states to 7822 states and 10819 transitions. [2019-10-03 02:54:55,861 INFO L78 Accepts]: Start accepts. Automaton has 7822 states and 10819 transitions. Word has length 191 [2019-10-03 02:54:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:55,862 INFO L475 AbstractCegarLoop]: Abstraction has 7822 states and 10819 transitions. [2019-10-03 02:54:55,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:54:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 7822 states and 10819 transitions. [2019-10-03 02:54:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-03 02:54:55,871 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:55,871 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] [2019-10-03 02:54:55,871 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:55,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:55,872 INFO L82 PathProgramCache]: Analyzing trace with hash 960811411, now seen corresponding path program 1 times [2019-10-03 02:54:55,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:55,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:55,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:56,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:56,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-03 02:54:56,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:56,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-03 02:54:56,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-03 02:54:56,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-03 02:54:56,495 INFO L87 Difference]: Start difference. First operand 7822 states and 10819 transitions. Second operand 26 states. [2019-10-03 02:54:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:57,371 INFO L93 Difference]: Finished difference Result 8801 states and 12513 transitions. [2019-10-03 02:54:57,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 02:54:57,372 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 192 [2019-10-03 02:54:57,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:57,438 INFO L225 Difference]: With dead ends: 8801 [2019-10-03 02:54:57,438 INFO L226 Difference]: Without dead ends: 7467 [2019-10-03 02:54:57,439 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-03 02:54:57,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2019-10-03 02:54:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7197. [2019-10-03 02:54:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7197 states. [2019-10-03 02:54:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7197 states to 7197 states and 9976 transitions. [2019-10-03 02:54:57,817 INFO L78 Accepts]: Start accepts. Automaton has 7197 states and 9976 transitions. Word has length 192 [2019-10-03 02:54:57,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:57,818 INFO L475 AbstractCegarLoop]: Abstraction has 7197 states and 9976 transitions. [2019-10-03 02:54:57,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-03 02:54:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 7197 states and 9976 transitions. [2019-10-03 02:54:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-03 02:54:57,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:57,834 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] [2019-10-03 02:54:57,834 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:57,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1419526608, now seen corresponding path program 1 times [2019-10-03 02:54:57,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:57,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:57,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:57,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:57,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:58,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:58,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:54:58,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:58,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:54:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:54:58,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:54:58,081 INFO L87 Difference]: Start difference. First operand 7197 states and 9976 transitions. Second operand 10 states. [2019-10-03 02:54:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:58,166 INFO L93 Difference]: Finished difference Result 7259 states and 10047 transitions. [2019-10-03 02:54:58,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:54:58,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 196 [2019-10-03 02:54:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:58,214 INFO L225 Difference]: With dead ends: 7259 [2019-10-03 02:54:58,214 INFO L226 Difference]: Without dead ends: 7187 [2019-10-03 02:54:58,214 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:54:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7187 states. [2019-10-03 02:54:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7187 to 7187. [2019-10-03 02:54:58,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7187 states. [2019-10-03 02:54:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7187 states to 7187 states and 9926 transitions. [2019-10-03 02:54:58,487 INFO L78 Accepts]: Start accepts. Automaton has 7187 states and 9926 transitions. Word has length 196 [2019-10-03 02:54:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:58,488 INFO L475 AbstractCegarLoop]: Abstraction has 7187 states and 9926 transitions. [2019-10-03 02:54:58,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:54:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 7187 states and 9926 transitions. [2019-10-03 02:54:58,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-03 02:54:58,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:58,501 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] [2019-10-03 02:54:58,501 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:58,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:58,502 INFO L82 PathProgramCache]: Analyzing trace with hash -106874396, now seen corresponding path program 1 times [2019-10-03 02:54:58,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:58,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:58,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:58,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:58,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:58,754 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:58,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:58,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:54:58,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:58,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:54:58,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:54:58,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:54:58,756 INFO L87 Difference]: Start difference. First operand 7187 states and 9926 transitions. Second operand 5 states. [2019-10-03 02:54:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:58,819 INFO L93 Difference]: Finished difference Result 7392 states and 10219 transitions. [2019-10-03 02:54:58,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:54:58,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2019-10-03 02:54:58,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:58,872 INFO L225 Difference]: With dead ends: 7392 [2019-10-03 02:54:58,873 INFO L226 Difference]: Without dead ends: 7392 [2019-10-03 02:54:58,873 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:54:58,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7392 states. [2019-10-03 02:54:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7392 to 7291. [2019-10-03 02:54:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7291 states. [2019-10-03 02:54:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7291 states to 7291 states and 10066 transitions. [2019-10-03 02:54:59,120 INFO L78 Accepts]: Start accepts. Automaton has 7291 states and 10066 transitions. Word has length 201 [2019-10-03 02:54:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:59,120 INFO L475 AbstractCegarLoop]: Abstraction has 7291 states and 10066 transitions. [2019-10-03 02:54:59,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:54:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 7291 states and 10066 transitions. [2019-10-03 02:54:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-03 02:54:59,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:59,131 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:59,131 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:59,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:59,131 INFO L82 PathProgramCache]: Analyzing trace with hash -530905528, now seen corresponding path program 1 times [2019-10-03 02:54:59,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:59,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:59,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:59,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:59,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:59,333 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:59,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:59,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:54:59,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:59,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:54:59,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:54:59,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:54:59,335 INFO L87 Difference]: Start difference. First operand 7291 states and 10066 transitions. Second operand 5 states. [2019-10-03 02:54:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:59,410 INFO L93 Difference]: Finished difference Result 5722 states and 7828 transitions. [2019-10-03 02:54:59,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:54:59,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-10-03 02:54:59,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:59,440 INFO L225 Difference]: With dead ends: 5722 [2019-10-03 02:54:59,441 INFO L226 Difference]: Without dead ends: 5691 [2019-10-03 02:54:59,442 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:54:59,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5691 states. [2019-10-03 02:54:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5691 to 5679. [2019-10-03 02:54:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5679 states. [2019-10-03 02:54:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 7775 transitions. [2019-10-03 02:54:59,673 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 7775 transitions. Word has length 203 [2019-10-03 02:54:59,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:59,674 INFO L475 AbstractCegarLoop]: Abstraction has 5679 states and 7775 transitions. [2019-10-03 02:54:59,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:54:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 7775 transitions. [2019-10-03 02:54:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-03 02:54:59,683 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:59,684 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:59,684 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:59,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:59,684 INFO L82 PathProgramCache]: Analyzing trace with hash -927665010, now seen corresponding path program 1 times [2019-10-03 02:54:59,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:59,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:59,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:59,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:59,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:54:59,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:59,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:54:59,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:59,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:54:59,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:54:59,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:54:59,909 INFO L87 Difference]: Start difference. First operand 5679 states and 7775 transitions. Second operand 6 states. [2019-10-03 02:55:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:00,467 INFO L93 Difference]: Finished difference Result 11287 states and 15426 transitions. [2019-10-03 02:55:00,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:55:00,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2019-10-03 02:55:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:00,508 INFO L225 Difference]: With dead ends: 11287 [2019-10-03 02:55:00,508 INFO L226 Difference]: Without dead ends: 11287 [2019-10-03 02:55:00,509 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:55:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11287 states. [2019-10-03 02:55:00,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11287 to 11125. [2019-10-03 02:55:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11125 states. [2019-10-03 02:55:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11125 states to 11125 states and 15225 transitions. [2019-10-03 02:55:00,900 INFO L78 Accepts]: Start accepts. Automaton has 11125 states and 15225 transitions. Word has length 201 [2019-10-03 02:55:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:00,901 INFO L475 AbstractCegarLoop]: Abstraction has 11125 states and 15225 transitions. [2019-10-03 02:55:00,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:55:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 11125 states and 15225 transitions. [2019-10-03 02:55:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-03 02:55:00,924 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:00,925 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:00,925 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:00,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:00,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1787182647, now seen corresponding path program 1 times [2019-10-03 02:55:00,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:00,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:00,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:00,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:00,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-03 02:55:01,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:01,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:55:01,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:01,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:55:01,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:55:01,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:55:01,146 INFO L87 Difference]: Start difference. First operand 11125 states and 15225 transitions. Second operand 8 states. [2019-10-03 02:55:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:02,708 INFO L93 Difference]: Finished difference Result 23146 states and 31889 transitions. [2019-10-03 02:55:02,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:55:02,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 221 [2019-10-03 02:55:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:02,803 INFO L225 Difference]: With dead ends: 23146 [2019-10-03 02:55:02,803 INFO L226 Difference]: Without dead ends: 23146 [2019-10-03 02:55:02,804 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:55:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23146 states. [2019-10-03 02:55:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23146 to 22773. [2019-10-03 02:55:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22773 states. [2019-10-03 02:55:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22773 states to 22773 states and 31350 transitions. [2019-10-03 02:55:03,581 INFO L78 Accepts]: Start accepts. Automaton has 22773 states and 31350 transitions. Word has length 221 [2019-10-03 02:55:03,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:03,582 INFO L475 AbstractCegarLoop]: Abstraction has 22773 states and 31350 transitions. [2019-10-03 02:55:03,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:55:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 22773 states and 31350 transitions. [2019-10-03 02:55:03,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-03 02:55:03,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:03,618 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:03,619 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:03,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash 880838603, now seen corresponding path program 1 times [2019-10-03 02:55:03,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:03,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:03,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:03,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:03,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 02:55:03,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:03,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:55:03,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:03,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:55:03,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:55:03,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:55:03,901 INFO L87 Difference]: Start difference. First operand 22773 states and 31350 transitions. Second operand 15 states. [2019-10-03 02:55:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:06,904 INFO L93 Difference]: Finished difference Result 24947 states and 34838 transitions. [2019-10-03 02:55:06,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-03 02:55:06,904 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 221 [2019-10-03 02:55:06,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:07,006 INFO L225 Difference]: With dead ends: 24947 [2019-10-03 02:55:07,006 INFO L226 Difference]: Without dead ends: 24947 [2019-10-03 02:55:07,007 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2019-10-03 02:55:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24947 states. [2019-10-03 02:55:08,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24947 to 23709. [2019-10-03 02:55:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23709 states. [2019-10-03 02:55:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23709 states to 23709 states and 32854 transitions. [2019-10-03 02:55:08,698 INFO L78 Accepts]: Start accepts. Automaton has 23709 states and 32854 transitions. Word has length 221 [2019-10-03 02:55:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:08,698 INFO L475 AbstractCegarLoop]: Abstraction has 23709 states and 32854 transitions. [2019-10-03 02:55:08,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:55:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 23709 states and 32854 transitions. [2019-10-03 02:55:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-03 02:55:08,734 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:08,734 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:08,735 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:08,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:08,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1913967346, now seen corresponding path program 1 times [2019-10-03 02:55:08,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:08,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:08,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 02:55:08,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:08,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:55:08,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:08,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:55:08,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:55:08,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:55:08,932 INFO L87 Difference]: Start difference. First operand 23709 states and 32854 transitions. Second operand 7 states. [2019-10-03 02:55:13,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:13,263 INFO L93 Difference]: Finished difference Result 49769 states and 69743 transitions. [2019-10-03 02:55:13,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:55:13,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 222 [2019-10-03 02:55:13,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:13,471 INFO L225 Difference]: With dead ends: 49769 [2019-10-03 02:55:13,471 INFO L226 Difference]: Without dead ends: 49769 [2019-10-03 02:55:13,474 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:55:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49769 states. [2019-10-03 02:55:14,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49769 to 47804. [2019-10-03 02:55:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47804 states. [2019-10-03 02:55:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47804 states to 47804 states and 66413 transitions. [2019-10-03 02:55:15,085 INFO L78 Accepts]: Start accepts. Automaton has 47804 states and 66413 transitions. Word has length 222 [2019-10-03 02:55:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:15,086 INFO L475 AbstractCegarLoop]: Abstraction has 47804 states and 66413 transitions. [2019-10-03 02:55:15,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:55:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 47804 states and 66413 transitions. [2019-10-03 02:55:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-03 02:55:15,176 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:15,176 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:15,176 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash -728337720, now seen corresponding path program 1 times [2019-10-03 02:55:15,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:15,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:15,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:15,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:15,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 02:55:15,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:15,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:55:15,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:15,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:55:15,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:55:15,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:55:15,455 INFO L87 Difference]: Start difference. First operand 47804 states and 66413 transitions. Second operand 15 states. [2019-10-03 02:55:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:19,412 INFO L93 Difference]: Finished difference Result 49348 states and 68551 transitions. [2019-10-03 02:55:19,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-03 02:55:19,413 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 222 [2019-10-03 02:55:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:19,591 INFO L225 Difference]: With dead ends: 49348 [2019-10-03 02:55:19,591 INFO L226 Difference]: Without dead ends: 49348 [2019-10-03 02:55:19,592 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2019-10-03 02:55:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49348 states. [2019-10-03 02:55:20,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49348 to 47330. [2019-10-03 02:55:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47330 states. [2019-10-03 02:55:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47330 states to 47330 states and 65432 transitions. [2019-10-03 02:55:20,966 INFO L78 Accepts]: Start accepts. Automaton has 47330 states and 65432 transitions. Word has length 222 [2019-10-03 02:55:20,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:20,966 INFO L475 AbstractCegarLoop]: Abstraction has 47330 states and 65432 transitions. [2019-10-03 02:55:20,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:55:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 47330 states and 65432 transitions. [2019-10-03 02:55:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-03 02:55:21,012 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:21,013 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:21,013 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:21,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:21,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2078162666, now seen corresponding path program 2 times [2019-10-03 02:55:21,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:21,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:21,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:21,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:21,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:21,206 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 02:55:21,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:55:21,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:55:21,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:55:21,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:55:21,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:55:21,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:55:21,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:55:21,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:55:21,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-03 02:55:21,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:55:21,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 2559 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-03 02:55:21,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:55:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 02:55:22,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:55:22,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:55:22,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:55:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:55:22,549 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:55:22,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 21 [2019-10-03 02:55:22,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:22,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:55:22,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:55:22,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-10-03 02:55:22,551 INFO L87 Difference]: Start difference. First operand 47330 states and 65432 transitions. Second operand 7 states. [2019-10-03 02:55:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:23,502 INFO L93 Difference]: Finished difference Result 47400 states and 65521 transitions. [2019-10-03 02:55:23,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:55:23,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 222 [2019-10-03 02:55:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:23,726 INFO L225 Difference]: With dead ends: 47400 [2019-10-03 02:55:23,726 INFO L226 Difference]: Without dead ends: 47396 [2019-10-03 02:55:23,727 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 433 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-10-03 02:55:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47396 states. [2019-10-03 02:55:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47396 to 47396. [2019-10-03 02:55:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47396 states. [2019-10-03 02:55:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47396 states to 47396 states and 65515 transitions. [2019-10-03 02:55:26,919 INFO L78 Accepts]: Start accepts. Automaton has 47396 states and 65515 transitions. Word has length 222 [2019-10-03 02:55:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:26,920 INFO L475 AbstractCegarLoop]: Abstraction has 47396 states and 65515 transitions. [2019-10-03 02:55:26,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:55:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 47396 states and 65515 transitions. [2019-10-03 02:55:26,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-03 02:55:26,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:26,964 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:26,964 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:26,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:26,965 INFO L82 PathProgramCache]: Analyzing trace with hash -950608717, now seen corresponding path program 1 times [2019-10-03 02:55:26,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:26,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:26,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:55:26,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:26,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 02:55:27,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:55:27,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:55:27,162 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2019-10-03 02:55:27,165 INFO L207 CegarAbsIntRunner]: [59], [62], [63], [66], [72], [110], [112], [117], [121], [137], [140], [149], [150], [153], [154], [155], [157], [239], [242], [248], [267], [269], [273], [276], [277], [278], [281], [287], [314], [317], [326], [337], [339], [342], [346], [347], [349], [350], [353], [363], [399], [437], [440], [449], [456], [625], [627], [628], [629], [672], [675], [689], [728], [729], [730], [732], [735], [738], [744], [745], [747], [750], [754], [778], [782], [785], [793], [796], [821], [823], [826], [828], [831], [833], [835], [838], [854], [863], [867], [869], [871], [874], [881], [888], [891], [1150], [1204], [1226], [1237], [1240], [1241], [1244], [1248], [1252], [1278], [1279], [1281], [1283], [1290], [1294], [1296], [1365], [1368], [1374], [1409], [1412], [1414], [1417], [1426], [1432], [1435], [1444], [1633], [1635], [1637], [1639], [1640], [1662], [1663], [1664], [1666], [1676], [1677], [1678], [1679], [1680], [1681], [1684], [1685], [1686], [1687], [1688], [1690], [1691], [1692], [1693], [1706], [1707], [1710], [1711], [1722], [1738], [1758], [1759], [1778], [1779], [1780], [1782], [1783], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1798], [1799], [1800], [1801], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1820], [1821], [1822], [1842], [1844], [1845], [1846], [1848], [1849], [1850], [1851], [1852], [1853], [1854], [1855], [1860], [1862], [1863], [1864], [1876], [1877], [1878], [1879], [1880], [1881], [1882], [1883], [1884] [2019-10-03 02:55:27,224 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:55:27,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:55:27,411 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:55:27,413 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 196 root evaluator evaluations with a maximum evaluation depth of 0. Performed 196 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 364 variables. [2019-10-03 02:55:27,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:27,420 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:55:27,543 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:55:27,544 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:55:27,559 INFO L420 sIntCurrentIteration]: We unified 222 AI predicates to 222 [2019-10-03 02:55:27,559 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:55:27,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:55:27,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-03 02:55:27,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:27,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:55:27,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:55:27,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:55:27,562 INFO L87 Difference]: Start difference. First operand 47396 states and 65515 transitions. Second operand 2 states. [2019-10-03 02:55:27,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:27,563 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:55:27,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:55:27,563 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 223 [2019-10-03 02:55:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:27,564 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:55:27,564 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:55:27,565 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:55:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:55:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:55:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:55:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:55:27,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2019-10-03 02:55:27,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:27,566 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:55:27,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:55:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:55:27,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:55:27,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:55:27 BoogieIcfgContainer [2019-10-03 02:55:27,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:55:27,578 INFO L168 Benchmark]: Toolchain (without parser) took 47069.53 ms. Allocated memory was 142.1 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 86.8 MB in the beginning and 280.6 MB in the end (delta: -193.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-10-03 02:55:27,583 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 142.1 MB. Free memory was 108.1 MB in the beginning and 107.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:55:27,584 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1061.28 ms. Allocated memory was 142.1 MB in the beginning and 202.4 MB in the end (delta: 60.3 MB). Free memory was 86.6 MB in the beginning and 133.8 MB in the end (delta: -47.2 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:55:27,585 INFO L168 Benchmark]: Boogie Preprocessor took 213.28 ms. Allocated memory is still 202.4 MB. Free memory was 133.8 MB in the beginning and 125.0 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:55:27,586 INFO L168 Benchmark]: RCFGBuilder took 2228.89 ms. Allocated memory was 202.4 MB in the beginning and 256.4 MB in the end (delta: 54.0 MB). Free memory was 125.0 MB in the beginning and 147.9 MB in the end (delta: -22.9 MB). Peak memory consumption was 83.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:55:27,587 INFO L168 Benchmark]: TraceAbstraction took 43561.03 ms. Allocated memory was 256.4 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 147.9 MB in the beginning and 280.6 MB in the end (delta: -132.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-10-03 02:55:27,599 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 142.1 MB. Free memory was 108.1 MB in the beginning and 107.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1061.28 ms. Allocated memory was 142.1 MB in the beginning and 202.4 MB in the end (delta: 60.3 MB). Free memory was 86.6 MB in the beginning and 133.8 MB in the end (delta: -47.2 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 213.28 ms. Allocated memory is still 202.4 MB. Free memory was 133.8 MB in the beginning and 125.0 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2228.89 ms. Allocated memory was 202.4 MB in the beginning and 256.4 MB in the end (delta: 54.0 MB). Free memory was 125.0 MB in the beginning and 147.9 MB in the end (delta: -22.9 MB). Peak memory consumption was 83.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43561.03 ms. Allocated memory was 256.4 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 147.9 MB in the beginning and 280.6 MB in the end (delta: -132.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: 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 112 procedures, 769 locations, 1 error locations. SAFE Result, 43.4s OverallTime, 18 OverallIterations, 3 TraceHistogramMax, 24.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12926 SDtfs, 9185 SDslu, 75306 SDs, 0 SdLazy, 15038 SolverSat, 1686 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 998 GetRequests, 745 SyntacticMatches, 2 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47804occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.081081081081081 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 11.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 6240 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 3863 NumberOfCodeBlocks, 3844 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4065 ConstructedInterpolants, 0 QuantifiedInterpolants, 1144322 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2559 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 783/788 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...